Matsumoto–Ohno interpolation conjecture for face hypergraphs of planar triangulations
Statement
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 .
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.