1 problem

0 votes0 replies1 view
Erdős's conjecture on cycles whose edges are chords of another cycle
Erdős's conjecture. There is a constant $c$ such that every $n$ -vertex graph with $cn$ edges contains two cycles $C_1$ and $C_2$ whose edges in $C_2$ are chords of $C_1$ .
Conjectureopenchords cycles extremal-graph-theoryarXiv posted 2 days ago

Erdős's conjecture on cycles whose edges are chords of another cycle