Erdős–Faudree conjecture on Hamiltonian subsets of regular Dirac graphs

About 1 year old · traced to

Let GG be an (n+1)(n+1)-regular graph on 2n2n vertices. A subset S⊆V(G)S\subseteq V(G) is called Hamiltonian when the induced subgraph G[S]G[S] contains a Hamilton cycle. Erdős–Faudree conjecture. There is an absolute constant c>0c>0 such that GG has at least c22nc2^{2n} Hamiltonian subsets. The source presents this as a question of Erdős and Faudree; no resolution is supplied in the given text.

References

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.

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.