Quanta Magazine · Science

Mathematicians Prove Graph Sandwich Conjecture

A 2004 conjecture linking random regular graphs to random binomial graphs has been proven, simplifying the analysis of complex network structures.

The "sandwich conjecture" proposed that large random regular graphs could be bounded by two simpler random binomial graphs.

This would allow properties of hard-to-analyze regular graphs to be inferred from easier-to-study binomial graphs.

Random binomial graphs connect vertices randomly, while regular graphs require each vertex to have the same number of connections.

Proving the conjecture required a method to build both graph types simultaneously, ensuring they fit together.

A 2025 proof uses an edge-by-edge construction, guaranteeing the regular graph contains the binomial one, and vice-versa.

This resolves a long-standing problem, enabling mathematicians to streamline proofs and gain new insights into network structures.

The methods developed may also aid in understanding more complex graph structures.

AI-samenvatting op basis van de bron.