2021/09/08 by Younjin Kim, Kim, Younjin
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.2109.03449
openalex publication_date 2021/09/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In 2009, Krivelevich and Sudakov studied the existence of large complete minors in (t,α)-expanding graphs whenever the expansion factor t becomes super-constant. In this paper, we give an extension of the results of Krivelevich and Sudakov by investigating a connection between the existence of large complete minors in graphs and good vertex expansion properties.