The 4-Sample Theorem on planar graphs

Snapshots of modern mathematics from Oberwolfach

The 4-Sample Theorem on planar graphs

The famous 4-Color Theorem from graph theory states that the vertices of any planar graph can be colored with four colors, so that no neighboring vertices have the same color. The 4-Sample Theorem from algebraic statistics says that the maximum likelihood estimator for a Gaussian graphical model of a planar graph exists with probability 1 if one has at least four samples. This number of necessary samples, the maximum likelihood threshold, is a new graph invariant from algebraic statistics and connected not only to parameter estimation, but also to matrix completion, the theory of filling partial matrices, and rigidity theory, which deals with stability of objects. 

If you are interested in translating this Snapshot, please contact us at info@imaginary.org

Mathematical subjects

Discrete Mathematics and Foundations
Probability Theory and Statistics

Author(s)

Carlos Améndola, Thomas Kahle

License

DOI (Digital Object Identifier)

10.14760/SNAP-2026-005-EN

Download PDF

PDF

snapshots: overview

Mathematical subjects

Algebra and Number Theory
Analysis
Didactics and Education
Discrete Mathematics and Foundations
Geometry and Topology
Numerics and Scientific Computing
Probability Theory and Statistics

Connections to other fields

Chemistry and Earth Science
Computer Science
Engineering and Technology
Finance
Humanities and Social Sciences
Life Science
Physics
Reflections on Mathematics

These icons are available under the CC BY-SA 4.0 license. Please feel free to use them to classify your own content.
The vector icons can be downloaded here.