Tags
Prizes
More
FAQ
Problem Lists
Definitions
Links
How to help
Go
Go
All
Random Solved
Random Open
OPEN
Is it true that, for $k\geq 2$, \[\mathrm{ex}(n;\{C_{2k-1},C_{2k}\})=(1+o(1))(n/2)^{1+\frac{1}{k}}.\]
#574
:
[ErSi82]
graph theory
,
turan number
A problem of Erdős and Simonovits.
See also
[573]
and
the entry in the graphs problem collection
.
Previous
Next