Erdős–Faudree conjecture on Hamiltonian subsets of regular Dirac graphs
Erdős–Faudree conjecture on Hamiltonian subsets of regular Dirac graphs
Let be an -regular graph on vertices. A subset is called Hamiltonian when the induced subgraph contains a Hamilton cycle. Erdős–Faudree conjecture. There is an absolute constant such that has at least Hamiltonian subsets. The source presents this as a question of Erdős and Faudree; no resolution is supplied in the given text.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Wanting Sun, Shunan Wei and Donglei Yang, “Clique factors in random samplings of regular graphs”, arXiv:2512.20287 (2025).
Additional references
2 papers in this index state this conjecture (2025). The statement above is taken from the most recent of them; the others are arXiv:2503.01826.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.