Skip to main content
MathOverflow
OmG's user avatar
OmG's user avatar
OmG's user avatar
OmG
  • Member for 7 years, 11 months
  • Last seen more than a month ago
Profile Activity

17 Actions

All Accepts Posts Badges Comments Revisions Reviews Suggestions
revised
Initial conditions to falsify Rowland's conjecture
edited body
revised
Initial conditions to falsify Rowland's conjecture
added 5 characters in body
revised
Initial conditions to falsify Rowland's conjecture
edited tags
asked
Initial conditions to falsify Rowland's conjecture
comment
Is there any connection between the minimum vertex cover and the size of longest path in a graph?
@LouisD Thanks, Louis. That's a good point.
awarded
 Student
comment
Is there any connection between the minimum vertex cover and the size of longest path in a graph?
@ZacharyHunter By the way, I am looking for a formula in a general graph without any extra assumptions on $G$.
revised
Is there any connection between the minimum vertex cover and the size of longest path in a graph?
added 16 characters in body
comment
Is there any connection between the minimum vertex cover and the size of longest path in a graph?
@ZacharyHunter Sorry, but you are wrong. The minimum vertex cover size for a complete graph with $n$ vertices is $n-1$ (not 1). Also, the minimum vertex cover in a star graph is $1$.
asked
Is there any connection between the minimum vertex cover and the size of longest path in a graph?
awarded
 Citizen Patrol
revised
When is $2\varphi(n) > n$ – and how to prove it?
added 509 characters in body
awarded
 Teacher
answered
When is $2\varphi(n) > n$ – and how to prove it?
awarded
 Editor
awarded
 Informed
awarded
 Supporter