Complete minors and average degree: A short proof

Noga Alon, Michael Krivelevich, Benny Sudakov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We provide a short and self-contained proof of the classical result of Kostochka and of Thomason, ensuring that every graph of average degree (Formula presented.) has a complete minor of order (Formula presented.).

Original languageEnglish
Pages (from-to)599-602
Number of pages4
JournalJournal of Graph Theory
Volume103
Issue number3
DOIs
StatePublished - Jul 2023

Keywords

  • clique minors
  • probabilistic methods

Fingerprint

Dive into the research topics of 'Complete minors and average degree: A short proof'. Together they form a unique fingerprint.

Cite this