KnowraEdge coloringLinked fromLinked fromThe 15 pages that link to Edge coloring, each with the reason it gives.All 15Related 7Narrower topic 4Compared with 4Ramsey theoryRelated: The basic finite Ramsey problem asks what colored edges force.Line graphRelated: Edge coloring becomes vertex coloring of the line graph.Kőnig's theoremRelated: Bipartite edge-coloring results use repeated matchings as color classes.Erdős–Faber–Lovász conjectureRelated: Coloring the hyperedges is the same as coloring vertices of their line graph.Burr–Erdős conjectureRelated: Monochromatic copies in edge-colorings define the Ramsey numbers at issue.Dinitz theoremRelated: Treating cells as edges turns the array condition into a proper edge-coloring condition.Friends and strangers theoremRelated: Coloring each pair by relationship type turns the claim into a two-color graph problem.