Erdős Problem 1080

[mo271]

What is the conjecture

https://www.erdosproblems.com/1080

Let $G$ be a bipartite graph on $n$ vertices such that one part has $\lfloor n^{2/3}\rfloor$ vertices. Is there a constant $c>0$ such that if $G$ has at least $cn$ edges then $G$ must contain a $C_6$?

Status: open

Choose either option

• I plan on working on this conjecture
• This issue is up for grabs: I would like to see this conjecture added by somebody else