Erdős Problem #1037 — Trivial Subgraphs in Graphs with Many Distinct Degrees
Statement
No. The following assertion is false: for every real number and every real number , for all sufficiently large natural numbers , every simple graph on vertices such that each degree occurs at most twice and the number of distinct degrees is greater than contains a set of vertices which is either an independent set or a clique and satisfies
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.