Assertion: complete graph | /r/HasProperty | one
Facets:
value: among k-chromatic graphs
type: OTHER
value: with smallest crossing number
type: OTHER
Source sentences:
text: Other open problems concerning the chromatic number of graphs include the Hadwiger conjecture stating that every graph with chromatic number k has a complete graph on k vertices as a minor, the Erdős–Faber–Lovász conjecture bounding the chromatic number of unions of complete graphs that have at most one vertex in common to each pair, and the Albertson conjecture that among k-chromatic graphs the complete graphs are the ones with smallest crossing number.