Like I said, that was the way I saw it.
People have different ways of seeing things. So if you can see it with a direct proof, then congrats to you. I didn't see it that way.
I may've not used diam(G') explicitly, which is fine, but I did use it implicitly to to show that the verticies in...
I guess your right. So I'll make sure to clearly stated an existence, uniqueness, and for all if its happening in a future problem.
I forgot to take into account that many people here engage in research and may've potentially come across notation such as M(u, v) = diam(G') with M(u, v) not...
You sure are picky aren't you?
But I understand that the vertex I choose is not true for all t in G. I know mathematicians take their "For all", "There are some", and "There exists a unique" very serious.
Matt, I'm sorry, but I've timed out one too many times trying to write this problem to...
Ok guys,
I have another one I worked on. I originally approached this one with a proof by contradiction. I've seen it done with a direct proof. I think all of my logic is correct, but I need a second opinion:
Problem:
If G is a simple connected graph such that diam(G) >=3, then prove that...
You're right. I feel like custard right now. That's what I get for quitting math. I should've not posted this and thought about the problem further. I just went back in circles with my logic.
That was on me.
Thanks for your help guys.
Well your proof I've already saw after I wrote mine up. That's fine because I already saw all that stuff going on when thinking about writing mine up. Unforunately, I wasnt thinking about writing it like that when writing mine up.
The only reason I choose the degree is because any two sets...
First and foremost, let's get something straight before I post my proof:
I'm not enrolled in any classes. I don't have any class money. Though my grades were strong enough for grad school, I don't think I would've made a good mathematician. I'm just not good enough. I thought I was done with...
Homework Statement
Is there a Laurent Series for Log(z) in the Annulus 0<|z|<1?
Homework Equations
Go here for the Theorem. It is theorem 7.8:
www.math.fullerton.edu/mathews/c2003/LaurentSeriesMod.html[/URL]
(copy and paste the link below if you are having problems. Exclude the "[url]" in...