2000 character limit reached
The de Bruijn-Erdös-Hanani theorem
Published 24 May 2017 in math.CO and math.HO | (1705.08706v1)
Abstract: The paper is devoted to a somewhat idiosyncratic account of the theorem of de Bruijn-Erd\"{o}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\"{o}s and Hanani and few others. It is explained how one of the proofs was discovered, and how another one could have been discovered.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.