Erdős's smaller subgraphs of minimum degree conjecture
Statement
Let , let , and define
A graph has minimum degree if every vertex has at least neighbors.
Erdős's conjecture. For every there exists an such that every graph on vertices and edges contains a subgraph of minimum degree with at most vertices.
Erdős, Faudree, Rousseau and Schelp proved the corresponding existence result with a smaller saving of order , while this paper improves the guaranteed saving to at least . The conjecture asks for a positive constant proportion of the vertices to be removed, and remains open in the supplied source.
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.