Schnyder's theorem, in graph theory, characterizes planar graphs in terms of the order dimension of their incidence posets, the partial orders formed by a graph's vertices and edges ordered by which vertices are endpoints of which edges. Walter Schnyder proved in 1989 that a graph is planar if and only if the order dimension of its incidence poset, the smallest number of linear orderings whose intersection produces that partial order, does not exceed three. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Classification
Statement FormCharacterization Theorem 1 Connections
Has Statement Form
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
Source Schnyder's theorem (Wikipedia)
Sources
1. Wikipedia: Schnyder's theorem
WikipediaLead section, statement-form referenceQuote, Lead section, statement-form reference
Schnyder's theorem states that a graph G is planar if and only if the order dimension of P(G) is at most three.
2. Schnyder's theorem (Wikipedia)
In Branch: Graph Theory, Lead sentenceQuote, In Branch: Graph Theory, Lead sentence
In graph theory, Schnyder's theorem is a characterization of planar graphs in terms of the order dimension of their incidence pose
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.