2022/02/17 by Noga Alon, Michael Krivelevich, Alon, Noga +3
Computer Science · Mathematics · #05C35 #05C83 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2202.08530
openalex publication_date 2022/02/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01
We provide a short and self-contained proof of the classical result of Kostochka and of Thomason, ensuring that every graph of average degree d has a complete minor of order d/√(log d).