A counterexample to the Alon-Saks-Seymour conjecture and related problems

Hao Huang; Benny Sudakov

doi:10.1007/s00493-012-2746-4

A counterexample to the Alon-Saks-Seymour conjecture and related problems

Hao Huang
, Benny Sudakov

Institute for Mathematics and its Applications

Research output: Contribution to journal › Article › peer-review

27 Scopus citations

Abstract

Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs. Alon, Saks, and Seymour conjectured that such graphs have chromatic number at most k+1. This well known conjecture remained open for almost twenty years. In this paper, we construct a counterexample to this conjecture and discuss several related problems in combinatorial geometry and communication complexity.

Original language	English (US)
Pages (from-to)	205-219
Number of pages	15
Journal	Combinatorica
Volume	32
Issue number	2
DOIs	https://doi.org/10.1007/s00493-012-2746-4
State	Published - Mar 2012

Bibliographical note

Funding Information:
∗ Research supported in part by NSF CAREER award DMS-0812005 and by a USA-Israeli BSF grant. Research supported in part by NSF grant DMS-1101185, NSF CAREER award DMS-0812005, and by a USA-Israeli BSF grant.

Publisher link

10.1007/s00493-012-2746-4

Find It

Find It at U of M Libraries

Cite this

@article{21a2c7810c864ebe92e9e15d73fb14ff,

title = "A counterexample to the Alon-Saks-Seymour conjecture and related problems",

abstract = "Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs. Alon, Saks, and Seymour conjectured that such graphs have chromatic number at most k+1. This well known conjecture remained open for almost twenty years. In this paper, we construct a counterexample to this conjecture and discuss several related problems in combinatorial geometry and communication complexity.",

author = "Hao Huang and Benny Sudakov",

note = "Funding Information: ∗ Research supported in part by NSF CAREER award DMS-0812005 and by a USA-Israeli BSF grant. Research supported in part by NSF grant DMS-1101185, NSF CAREER award DMS-0812005, and by a USA-Israeli BSF grant.",

year = "2012",

month = mar,

doi = "10.1007/s00493-012-2746-4",

language = "English (US)",

volume = "32",

pages = "205--219",

journal = "Combinatorica",

issn = "0209-9683",

publisher = "Janos Bolyai Mathematical Society",

number = "2",

}

TY - JOUR

T1 - A counterexample to the Alon-Saks-Seymour conjecture and related problems

AU - Huang, Hao

AU - Sudakov, Benny

N1 - Funding Information: ∗ Research supported in part by NSF CAREER award DMS-0812005 and by a USA-Israeli BSF grant. Research supported in part by NSF grant DMS-1101185, NSF CAREER award DMS-0812005, and by a USA-Israeli BSF grant.

PY - 2012/3

Y1 - 2012/3

N2 - Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs. Alon, Saks, and Seymour conjectured that such graphs have chromatic number at most k+1. This well known conjecture remained open for almost twenty years. In this paper, we construct a counterexample to this conjecture and discuss several related problems in combinatorial geometry and communication complexity.

AB - Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs. Alon, Saks, and Seymour conjectured that such graphs have chromatic number at most k+1. This well known conjecture remained open for almost twenty years. In this paper, we construct a counterexample to this conjecture and discuss several related problems in combinatorial geometry and communication complexity.

UR - https://www.scopus.com/pages/publications/84862136758

UR - https://www.scopus.com/pages/publications/84862136758#tab=citedBy

U2 - 10.1007/s00493-012-2746-4

DO - 10.1007/s00493-012-2746-4

M3 - Article

AN - SCOPUS:84862136758

SN - 0209-9683

VL - 32

SP - 205

EP - 219

JO - Combinatorica

JF - Combinatorica

IS - 2

ER -

A counterexample to the Alon-Saks-Seymour conjecture and related problems

Abstract

Bibliographical note

Publisher link

Find It

Other files and links

Fingerprint

Cite this