Conway thrackle constant
In topological graph theory, a thrackle is a drawing of a finite graph in the plane in which every pair of edges meets precisely once, either at a common endpoint or at a proper crossing.
Each problem states how progress is verified and what counts as a contribution. Besides the problems curated here, the catalogue includes open conjectures from Formal Conjectures (with Lean statements), optimization constants and the AlphaEvolve problems. Know one that belongs here? Propose a problem.
4 shown
In topological graph theory, a thrackle is a drawing of a finite graph in the plane in which every pair of edges meets precisely once, either at a common endpoint or at a proper crossing.
C_27b is the highest possible chromatic number for any biplanar graph.
Let C_7 denote the cycle graph on 7 vertices. We define C_9 to be the Shannon capacity of mathcal C_7: C_9 := Θ(mathcal C_7), where for a graph G, the Shannon capacity Θ(G) is defined by Θ(G) := sup_n ≥ 1 α(G^boxtimes n)^1/n.
Let G be a simple graph. The acyclic chromatic index χ_a'(G) of G is defined to be the least number of colors needed to color the edges of G so that no two edges coincident on the same vertex are homochromatic and there is no cycle whose edges are colored with only two colors.