Complete minors and average degree: A short proof

Noga Alon; Michael Krivelevich; Benny Sudakov

doi:10.1002/jgt.22937

Complete minors and average degree: A short proof

Noga Alon, Michael Krivelevich, Benny Sudakov

Mathematics

Research output: Contribution to journal › Article › peer-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 language	English (US)
Pages (from-to)	599-602
Number of pages	4
Journal	Journal of Graph Theory
Volume	103
Issue number	3
DOIs	https://doi.org/10.1002/jgt.22937
State	Published - Jul 2023

All Science Journal Classification (ASJC) codes

Geometry and Topology
Discrete Mathematics and Combinatorics

Keywords

clique minors
probabilistic methods

Access to Document

10.1002/jgt.22937

Cite this

@article{ac43f3aa236b4dd4a4557746d02773ea,

title = "Complete minors and average degree: A short proof",

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.).",

keywords = "clique minors, probabilistic methods",

author = "Noga Alon and Michael Krivelevich and Benny Sudakov",

note = "Funding Information: This research was supported as part by NSF grant DMS-1855464, USA-Israel BSF grant 2018267 and by SNSF grant 200021_196965. Funding Information: This research was supported as part by NSF grant DMS‐1855464, USA‐Israel BSF grant 2018267 and by SNSF grant 200021_196965. Publisher Copyright: {\textcopyright} 2023 Wiley Periodicals LLC.",

year = "2023",

month = jul,

doi = "10.1002/jgt.22937",

language = "English (US)",

volume = "103",

pages = "599--602",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "Wiley-Liss Inc.",

number = "3",

}

TY - JOUR

T1 - Complete minors and average degree

T2 - A short proof

AU - Alon, Noga

AU - Krivelevich, Michael

AU - Sudakov, Benny

N1 - Funding Information: This research was supported as part by NSF grant DMS-1855464, USA-Israel BSF grant 2018267 and by SNSF grant 200021_196965. Funding Information: This research was supported as part by NSF grant DMS‐1855464, USA‐Israel BSF grant 2018267 and by SNSF grant 200021_196965. Publisher Copyright: © 2023 Wiley Periodicals LLC.

PY - 2023/7

Y1 - 2023/7

N2 - 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.).

AB - 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.).

KW - clique minors

KW - probabilistic methods

UR - http://www.scopus.com/inward/record.url?scp=85148527700&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85148527700&partnerID=8YFLogxK

U2 - 10.1002/jgt.22937

DO - 10.1002/jgt.22937

M3 - Article

AN - SCOPUS:85148527700

SN - 0364-9024

VL - 103

SP - 599

EP - 602

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 3

ER -

Complete minors and average degree: A short proof

Abstract

All Science Journal Classification (ASJC) codes

Keywords

Access to Document

Other files and links

Fingerprint

Cite this