Large complete minors in expanding graphs
Younjin Kim

TL;DR
This paper extends previous work on large complete minors in expanding graphs by exploring the relationship between the existence of such minors and vertex expansion properties, providing new insights into graph structure.
Contribution
It introduces a novel connection between large complete minors and vertex expansion in graphs, extending prior results on super-constant expansion factors.
Findings
Established a link between large minors and vertex expansion.
Extended previous results to broader classes of graphs.
Provided theoretical bounds relating minors and expansion properties.
Abstract
In 2009, Krivelevich and Sudakov studied the existence of large complete minors in -expanding graphs whenever the expansion factor 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Graph theory and applications
