2017/05/24 by Nikolai V. Ivanov, Ivanov, Nikolai V.
Computer Science · Mathematics · #Graph Labeling and Dimension Problems #Advanced Combinatorial Mathematics #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1705.08706
The paper is devoted to a somewhat idiosyncratic account of the theorem of de Bruijn-Erdös and Hanani from the combinatorics of finite geometries and its various proofs. Among the proofs discussed are the original proofs by de Bruijn--Erdös and Hanani and few others. It is explained how one of the proofs was discovered, and how another one could have been discovered.