Graphs with Few 3-cliques and 3-anticliques are 3-universal

Nati Linial; Avraham Morgenstern

doi:10.1002/jgt.21801

Graphs with Few 3-cliques and 3-anticliques are 3-universal

Nati Linial, Avraham Morgenstern

The Rachel and Selim Benin School of Engineering and Computer Science

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

4 Scopus citations

Abstract

For given integers k, l we ask whether every large graph with a sufficiently small number of k-cliques and k-anticliques must contain an induced copy of every l-vertex graph. Here we prove this claim for k = l = 3 with a sharp bound. A similar phenomenon is established as well for tournaments with k = l = 4.

Original language	English
Pages (from-to)	229-238
Number of pages	10
Journal	Journal of Graph Theory
Volume	78
Issue number	3
DOIs	https://doi.org/10.1002/jgt.21801
State	Published - 1 Mar 2015

Bibliographical note

Publisher Copyright:
© 2014 Wiley Periodicals, Inc.

Keywords

Anticliques
Cliques
Erdos-Hajnal conjecture
Tournaments
Universality

Access to Document

10.1002/jgt.21801

Cite this

@article{080925b0be5f4d89b8c2afac4fb155fb,

title = "Graphs with Few 3-cliques and 3-anticliques are 3-universal",

abstract = "For given integers k, l we ask whether every large graph with a sufficiently small number of k-cliques and k-anticliques must contain an induced copy of every l-vertex graph. Here we prove this claim for k = l = 3 with a sharp bound. A similar phenomenon is established as well for tournaments with k = l = 4.",

keywords = "Anticliques, Cliques, Erdos-Hajnal conjecture, Tournaments, Universality",

author = "Nati Linial and Avraham Morgenstern",

note = "Publisher Copyright: {\textcopyright} 2014 Wiley Periodicals, Inc.",

year = "2015",

month = mar,

day = "1",

doi = "10.1002/jgt.21801",

language = "אנגלית",

volume = "78",

pages = "229--238",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "Wiley-Liss Inc.",

number = "3",

}

TY - JOUR

T1 - Graphs with Few 3-cliques and 3-anticliques are 3-universal

AU - Linial, Nati

AU - Morgenstern, Avraham

PY - 2015/3/1

Y1 - 2015/3/1

N2 - For given integers k, l we ask whether every large graph with a sufficiently small number of k-cliques and k-anticliques must contain an induced copy of every l-vertex graph. Here we prove this claim for k = l = 3 with a sharp bound. A similar phenomenon is established as well for tournaments with k = l = 4.

AB - For given integers k, l we ask whether every large graph with a sufficiently small number of k-cliques and k-anticliques must contain an induced copy of every l-vertex graph. Here we prove this claim for k = l = 3 with a sharp bound. A similar phenomenon is established as well for tournaments with k = l = 4.

KW - Anticliques

KW - Cliques

KW - Erdos-Hajnal conjecture

KW - Tournaments

KW - Universality

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

U2 - 10.1002/jgt.21801

DO - 10.1002/jgt.21801

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

AN - SCOPUS:84920815712

SN - 0364-9024

VL - 78

SP - 229

EP - 238

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 3

ER -

Graphs with Few 3-cliques and 3-anticliques are 3-universal

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this