Erdős Problem #1182 — Size-Ramsey extremal functions for triangles versus sparse graphs
Statement
Let be the least number of edges in a graph such that every red-blue colouring of contains a red copy of or a blue copy of . Let be the largest for which some -vertex graph with edges satisfies , and let be the largest such that every -vertex graph with at most edges satisfies this inequality. Determine the orders of growth of and . In particular, do and ?
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.