Hadwiger's conjecture for degree sequences

Guantao Chen, Katsuhiro Ota

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Hadwiger conjectured that every graph contains K<inf>χ(G)</inf> as a minor, where χ(G) is the chromatic number of G. In 2005, Robertson made a weaker conjecture that for any graph G, there exists a graph H with the same degree sequence of G and containing K<inf>χ(G)</inf> as a minor, which was confirmed by Dvořák and Mohar recently. In this note, we give a short proof of Robertson's Conjecture.

Original languageEnglish
Pages (from-to)247-249
Number of pages3
JournalJournal of Combinatorial Theory. Series B
Volume114
DOIs
Publication statusPublished - 2015 Sep 1

Fingerprint

Hadwiger's Conjecture
Degree Sequence
Minor
Graph in graph theory
Chromatic number

Keywords

  • Chromatic numbers
  • Degree sequences
  • Graph minors
  • Hadwiger's conjecture

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science
  • Computational Theory and Mathematics

Cite this

Hadwiger's conjecture for degree sequences. / Chen, Guantao; Ota, Katsuhiro.

In: Journal of Combinatorial Theory. Series B, Vol. 114, 01.09.2015, p. 247-249.

Research output: Contribution to journalArticle

@article{92438517412f4c6b9ae6eb0bb3e09f4b,
title = "Hadwiger's conjecture for degree sequences",
abstract = "Hadwiger conjectured that every graph contains Kχ(G) as a minor, where χ(G) is the chromatic number of G. In 2005, Robertson made a weaker conjecture that for any graph G, there exists a graph H with the same degree sequence of G and containing Kχ(G) as a minor, which was confirmed by Dvoř{\'a}k and Mohar recently. In this note, we give a short proof of Robertson's Conjecture.",
keywords = "Chromatic numbers, Degree sequences, Graph minors, Hadwiger's conjecture",
author = "Guantao Chen and Katsuhiro Ota",
year = "2015",
month = "9",
day = "1",
doi = "10.1016/j.jctb.2015.03.006",
language = "English",
volume = "114",
pages = "247--249",
journal = "Journal of Combinatorial Theory. Series B",
issn = "0095-8956",
publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - Hadwiger's conjecture for degree sequences

AU - Chen, Guantao

AU - Ota, Katsuhiro

PY - 2015/9/1

Y1 - 2015/9/1

N2 - Hadwiger conjectured that every graph contains Kχ(G) as a minor, where χ(G) is the chromatic number of G. In 2005, Robertson made a weaker conjecture that for any graph G, there exists a graph H with the same degree sequence of G and containing Kχ(G) as a minor, which was confirmed by Dvořák and Mohar recently. In this note, we give a short proof of Robertson's Conjecture.

AB - Hadwiger conjectured that every graph contains Kχ(G) as a minor, where χ(G) is the chromatic number of G. In 2005, Robertson made a weaker conjecture that for any graph G, there exists a graph H with the same degree sequence of G and containing Kχ(G) as a minor, which was confirmed by Dvořák and Mohar recently. In this note, we give a short proof of Robertson's Conjecture.

KW - Chromatic numbers

KW - Degree sequences

KW - Graph minors

KW - Hadwiger's conjecture

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

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

U2 - 10.1016/j.jctb.2015.03.006

DO - 10.1016/j.jctb.2015.03.006

M3 - Article

AN - SCOPUS:84930571254

VL - 114

SP - 247

EP - 249

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

SN - 0095-8956

ER -