The Erdo{combining double acute accent}s-Hajnal conjecture for bull-free graphs

Maria Chudnovsky; Shmuel Safra

doi:10.1016/j.jctb.2008.02.005

The Erdo{combining double acute accent}s-Hajnal conjecture for bull-free graphs

Maria Chudnovsky^*, Shmuel Safra

^*Corresponding author for this work

School of Computer Science

Columbia University

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

39 Scopus citations

Abstract

The bull is a graph consisting of a triangle and two pendant edges. A graphs is called bull-free if no induced subgraph of it is a bull. In this paper we prove that every bull-free graph on n vertices contains either a clique or a stable set of size n^{frac(1, 4)}, thus settling the Erdo{combining double acute accent}s-Hajnal conjecture [P. Erdo{combining double acute accent}s, A. Hajnal, Ramsey-type theorems, Discrete Appl. Math. 25 (1989) 37-52] for the bull.

Original language	English
Pages (from-to)	1301-1310
Number of pages	10
Journal	Journal of Combinatorial Theory. Series B
Volume	98
Issue number	6
DOIs	https://doi.org/10.1016/j.jctb.2008.02.005
State	Published - Nov 2008

Keywords

Bull-free graphs
Clique
Induced subgraphs
Stable set

Access to Document

10.1016/j.jctb.2008.02.005

Cite this

@article{2428db40d72641c8916f10546edb0a39,

title = "The Erdo{combining double acute accent}s-Hajnal conjecture for bull-free graphs",

abstract = "The bull is a graph consisting of a triangle and two pendant edges. A graphs is called bull-free if no induced subgraph of it is a bull. In this paper we prove that every bull-free graph on n vertices contains either a clique or a stable set of size nfrac(1, 4), thus settling the Erdo{combining double acute accent}s-Hajnal conjecture [P. Erdo{combining double acute accent}s, A. Hajnal, Ramsey-type theorems, Discrete Appl. Math. 25 (1989) 37-52] for the bull.",

keywords = "Bull-free graphs, Clique, Induced subgraphs, Stable set",

author = "Maria Chudnovsky and Shmuel Safra",

year = "2008",

month = nov,

doi = "10.1016/j.jctb.2008.02.005",

language = "אנגלית",

volume = "98",

pages = "1301--1310",

journal = "Journal of Combinatorial Theory. Series B",

issn = "0095-8956",

publisher = "Academic Press Inc.",

number = "6",

}

TY - JOUR

T1 - The Erdo{combining double acute accent}s-Hajnal conjecture for bull-free graphs

AU - Chudnovsky, Maria

AU - Safra, Shmuel

PY - 2008/11

Y1 - 2008/11

N2 - The bull is a graph consisting of a triangle and two pendant edges. A graphs is called bull-free if no induced subgraph of it is a bull. In this paper we prove that every bull-free graph on n vertices contains either a clique or a stable set of size nfrac(1, 4), thus settling the Erdo{combining double acute accent}s-Hajnal conjecture [P. Erdo{combining double acute accent}s, A. Hajnal, Ramsey-type theorems, Discrete Appl. Math. 25 (1989) 37-52] for the bull.

AB - The bull is a graph consisting of a triangle and two pendant edges. A graphs is called bull-free if no induced subgraph of it is a bull. In this paper we prove that every bull-free graph on n vertices contains either a clique or a stable set of size nfrac(1, 4), thus settling the Erdo{combining double acute accent}s-Hajnal conjecture [P. Erdo{combining double acute accent}s, A. Hajnal, Ramsey-type theorems, Discrete Appl. Math. 25 (1989) 37-52] for the bull.

KW - Bull-free graphs

KW - Clique

KW - Induced subgraphs

KW - Stable set

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

U2 - 10.1016/j.jctb.2008.02.005

DO - 10.1016/j.jctb.2008.02.005

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:52149113770

SN - 0095-8956

VL - 98

SP - 1301

EP - 1310

JO - Journal of Combinatorial Theory. Series B

JF - Journal of Combinatorial Theory. Series B

IS - 6

ER -

The Erdo{combining double acute accent}s-Hajnal conjecture for bull-free graphs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this