Matsumoto–Ohno interpolation conjecture for face hypergraphs of planar triangulations
Matsumoto–Ohno interpolation conjecture for face hypergraphs of planar triangulations
Let be a -uniform face hypergraph obtained from a planar triangulation. A coloring of is complete if every pair of colors occurs together in some hyperedge; write for the chromatic number and for the achromatic number of .
Matsumoto–Ohno conjecture. If is -colorable, then it admits a complete -coloring for every integer satisfying
The conjecture proposes the interpolation property for complete colorings in this special family of face hypergraphs. The source states that it is disproved in the paper by a particular hypergraph of order .
Sources & referencesView supporting material
Primary source
Nastaran Haghparast, Morteza Hasanvand and Yumiko Ohno, “The existence of uniform hypergraphs for which interpolation property of complete coloring fails”, arXiv:2103.02034 (2021).
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
Sign in to submit a solution.
No solutions have been posted yet.