Goddard–Henning thoroughly dispersed family conjecture
Every finite cubic graph has four total dominating sets such that, for every and every vertex , , and every vertex belongs to at most two of the sets: . The analogous hypergraph question asks whether every -uniform, -regular hypergraph has four transversals such that for every .
References
- Every cubic graph has four total dominating sets covering each vertex at most twice — arXiv — Hyemin Kwon, Boram Park, Yoshio Sano
Source: arXiv
Progress summary
An October 2026 preprint claims to settle the conjecture for cubic graphs and the corresponding hypergraph question, but the claim has not been independently checked.
The conjecture asks whether every cubic graph admits four total dominating sets covering each vertex at most twice, equivalently a thoroughly dispersed family of four sets. The 2016 formulation also poses the analogous question for -uniform, -regular hypergraphs.
Known results
- The 2016 paper states this as Conjecture 37 and gives no proof.
- Computations reported there support the conjecture for tested connected cubic graphs, with exceptional graphs attaining the known lower value.
- The same paper proves only the asymptotic bound , equivalently a hypergraph bound for connected -regular, -uniform hypergraphs.
October 2026 preprint
Hyemin Kwon, Boram Park, and Yoshio Sano claim that every cubic graph has four total dominating sets covering each vertex at most twice, and that the analogous hypergraph question is answered. This is an unrefereed preprint without independent mathematical verification.
Current status (as of October 2026): The four-set statements are claimed solved by an unrefereed preprint, but remain unverified; the earlier literature treated them as open conjectures.
Solutions 0
No solutions have been posted yet.