Erdős Problem #927 — The number of distinct clique sizes in a graph
Statement
Let be the maximum, over graphs on vertices, of the number of distinct clique sizes occurring in the graph. Is , where is the number of iterated logarithms needed to fall below 1?
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.