Matsumoto–Ohno interpolation conjecture for face hypergraphs of planar triangulations

Let HH be a 33-uniform face hypergraph obtained from a planar triangulation. A coloring of HH is complete if every pair of colors occurs together in some hyperedge; write χ(H)\chi(H) for the chromatic number and ψ(H)\psi(H) for the achromatic number of HH.

Matsumoto–Ohno conjecture. If HH is 33-colorable, then it admits a complete tt-coloring for every integer tt satisfying

χ(H)tψ(H).\chi(H) \le t \le \psi(H).

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 1212.

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

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.