Small Complete Minors Above the Extremal Edge Density

@article{Shapira2015SmallCM,
  title={Small Complete Minors Above the Extremal Edge Density},
  author={Asaf Shapira and Benny Sudakov},
  journal={Combinatorica},
  year={2015},
  volume={35},
  pages={75-94}
}
A fundamental result of Mader from 1972 asserts that a graph of high average degree contains a highly connected subgraph with roughly the same average degree. We prove a lemma showing that one can strengthen Mader’s result by replacing the notion of high connectivity by the notion of vertex expansion. Another well known result in graph theory states that for every integer t there is a smallest real c(t), such that every n-vertex graph with c(t)n edges contains a Kt-minor. Fiorini, Joret, Theis… CONTINUE READING

From This Paper

Topics from this paper.
5 Citations
29 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 29 references

Graph Theory

  • R. Diestel
  • (4th Edition), Springer, Heidenberg
  • 2012
2 Excerpts

Short paths in expander graphs , Proc . 37 t h Symposium on Foundations of Computer Science ( FOCS )

  • N. Linial, A. Wigderson
  • 2006

Similar Papers

Loading similar papers…