Jackson and Ringel's bichromatic number conjecture
Jackson and Ringel's bichromatic number conjecture
Let be the orientable surface of genus , and let denote the smallest such that the graph is biembeddable in the orientable surface . The bichromatic number of , denoted by , is the maximum chromatic number over all graphs biembeddable in . For , the Heawood-like inequality is
Jackson and Ringel's conjecture. For all , the bound in this inequality is tight:
This is a higher-genus generalization of the Map Color Theorem and the Earth-Moon problem. The source presents the claim as a conjecture; its resolution is not specified here.
Sources & referencesView supporting material
Primary source
Juvenal F. Barajas and Timothy Sun, “Index 3 biembeddings of the complete graphs”, arXiv:2301.00286 (2022).
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.