Tags
Prizes
More
FAQ
Problem Lists
Definitions
Links
How to help
Go
Go
All
Random Solved
Random Open
OPEN
Is there some constant $C$ such that any graph $G$ on $n$ vertices with $\geq Cn$ edges must contain a cycle which has at least as many diagonals as vertices?
#642
:
[Er97d]
graph theory
,
cycles
A problem of Hamburger and Szegedy.
Previous
Next
