Unsolved Problems
Showing 1-2 of 2 problems
Category
Problem Set
Status
GT-009
Solved
The Erdős-Faber-Lovász Conjecture (Hypergraph Version)
For any linear hypergraph with $n$ edges, each of size $n$, can the vertices be colored with $n$ colors such that no edge is monochromatic?...
L4
234
20
GT-011
Solved
The List Coloring Conjecture
For every graph $G$, is the list chromatic number equal to the chromatic number?...
L4
187
16