Existence of minimal uncolorable uniform bi-hypergraphs
Let be the set of -uniform bi-hypergraphs of order , and let be the set of minimal uncolorable bi-hypergraphs in . For , every bi-hypergraph in is colorable when , while minimal uncolorable bi-hypergraphs are known to exist at in the complete case.
Existence conjecture. For any with and , the set is not empty.
This conjecture concerns the existence of minimal obstructions to proper coloring beyond the first possible uncolorable order and would provide a general response to the existence aspect of the problem posed by Tuza and Voloshin. The supplied text gives no resolution beyond the stated known colorability range.
References
- Meiqiao Zhang, Fengming Dong and Ruixue Zhang, “On the colorability of bi-hypergraphs”, arXiv:2310.06464 (2023).
Progress summary
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.