Category
page 1Unsolved problems in graph theory
Hadwiger–Nelson problem
mathematical problem
Hadwiger conjecture
conjecture that all graphs requiring k or more colors contain a k-vertex complete minor
Erdős–Faber–Lovász conjecture
conjecture about coloring graphs formed by combining complete graphs
Erdős–Gyárfás conjecture
unproven conjecture that every graph with minimum degree 3 contains a simple cycle whose length is a power of two
Oberwolfach problem
Unsolved problem of discrete mathematics
Barnette's conjecture
unsolved problem in graph theory
reconstruction conjecture
graphs are uniquely determined by their subgraphs