For which graphs H does there exist \varepsilon>0 such that every n-vertex \varepsilon-sparse H-free graph G with n>1 contains sets A,B satisfying one of: (a)…
Statement
For which graphs H does there exist \varepsilon>0 such that every n-vertex \varepsilon-sparse H-free graph G with n>1 contains sets A,B satisfying one of: (a) |A|,|B|\geq\varepsilonn; (b) |A|\geq\varepsilonn and |B|\geqn^{\varepsilon}; or (c) |A|,|B|\geqn^{\varepsilon}; with A complete or anticomplete to B?
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.