Combinatorics and Graph Theory - Proved - By Century - 20th century - Vizing's Theorem

Facts

Statement

Vizing's theorem states that every simple undirected graph may be edge colored using a number of colors that is at most one larger than the maximum degree of the graph. 1

Proof Year

1964 1

Classification

Statement Form

Uniqueness Theorem 1

Statement Form

Inequality 1

Connections

Has Statement Form

Inequality

Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.

Uniqueness Theorem

Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.

In Branch

Graph Theory

Sources

1. Vizing's Theorem (Wikipedia)

Wikimedia Foundation

lead paragraph, opening sentence
In graph theory, Vizing's theorem states that every simple undirected graph may be edge colored using a number of colors that is at most one larger than the maximum degree Δ of the graph.
lead paragraph, sentence naming the publication year
The theorem is named for Vadim G. Vizing who published it in 1964.

Switch Atlas

The Inner World

The Civil World

The Natural World

Vizing's Theorem

Has Statement Form

In Branch