de Bruijn–Erdős theorem

The de Bruijn–Erdős theorem is a fundamental result in combinatorics and graph theory that relates finite and infinite structures, notably asserting that certain properties of infinite graphs or set systems are determined by their finite substructures.

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.