Erdős Problem #636 — Many vertex-edge types in Ramsey graphs
Statement
For every constant , is there a constant such that every -vertex graph with no clique or independent set of size has at least induced subgraphs with pairwise distinct ordered pairs (number of vertices, number of edges)?
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.