ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.