Large complete minors in expanding graphs
Combinatorics
2021-09-10 v2
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.
Cite
@article{arxiv.2109.03449,
title = {Large complete minors in expanding graphs},
author = {Younjin Kim},
journal= {arXiv preprint arXiv:2109.03449},
year = {2021}
}
Comments
11 pages