Large cliques in C4-free graphs

A. Gyárfás, Alice Hubenko, József Solymosi

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

A graph is called C4-free if it contains no cycle of length four as an induced subgraph. We prove that if a C4-free graph has n vertices and at least c1n2 edges then it has a complete subgraph of c2n vertices, where c2 depends only on c1. We also give estimates on c2 and show that a similar result does not hold for H-free graphs-unless H is an induced subgraph of C4. The best value of c2 is determined for chordal graphs.

Original languageEnglish
Pages (from-to)269-274
Number of pages6
JournalCombinatorica
Volume22
Issue number2
DOIs
Publication statusPublished - 2002

Fingerprint

Clique
Induced Subgraph
Graph in graph theory
Chordal Graphs
Subgraph
Cycle
Estimate

ASJC Scopus subject areas

  • Mathematics(all)
  • Discrete Mathematics and Combinatorics

Cite this

Large cliques in C4-free graphs. / Gyárfás, A.; Hubenko, Alice; Solymosi, József.

In: Combinatorica, Vol. 22, No. 2, 2002, p. 269-274.

Research output: Contribution to journalArticle

Gyárfás, A, Hubenko, A & Solymosi, J 2002, 'Large cliques in C4-free graphs', Combinatorica, vol. 22, no. 2, pp. 269-274. https://doi.org/10.1007/s004930200012
Gyárfás, A. ; Hubenko, Alice ; Solymosi, József. / Large cliques in C4-free graphs. In: Combinatorica. 2002 ; Vol. 22, No. 2. pp. 269-274.
@article{24681d37d8324f55a39fcf5561e7164e,
title = "Large cliques in C4-free graphs",
abstract = "A graph is called C4-free if it contains no cycle of length four as an induced subgraph. We prove that if a C4-free graph has n vertices and at least c1n2 edges then it has a complete subgraph of c2n vertices, where c2 depends only on c1. We also give estimates on c2 and show that a similar result does not hold for H-free graphs-unless H is an induced subgraph of C4. The best value of c2 is determined for chordal graphs.",
author = "A. Gy{\'a}rf{\'a}s and Alice Hubenko and J{\'o}zsef Solymosi",
year = "2002",
doi = "10.1007/s004930200012",
language = "English",
volume = "22",
pages = "269--274",
journal = "Combinatorica",
issn = "0209-9683",
publisher = "Janos Bolyai Mathematical Society",
number = "2",

}

TY - JOUR

T1 - Large cliques in C4-free graphs

AU - Gyárfás, A.

AU - Hubenko, Alice

AU - Solymosi, József

PY - 2002

Y1 - 2002

N2 - A graph is called C4-free if it contains no cycle of length four as an induced subgraph. We prove that if a C4-free graph has n vertices and at least c1n2 edges then it has a complete subgraph of c2n vertices, where c2 depends only on c1. We also give estimates on c2 and show that a similar result does not hold for H-free graphs-unless H is an induced subgraph of C4. The best value of c2 is determined for chordal graphs.

AB - A graph is called C4-free if it contains no cycle of length four as an induced subgraph. We prove that if a C4-free graph has n vertices and at least c1n2 edges then it has a complete subgraph of c2n vertices, where c2 depends only on c1. We also give estimates on c2 and show that a similar result does not hold for H-free graphs-unless H is an induced subgraph of C4. The best value of c2 is determined for chordal graphs.

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

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

U2 - 10.1007/s004930200012

DO - 10.1007/s004930200012

M3 - Article

AN - SCOPUS:0036335774

VL - 22

SP - 269

EP - 274

JO - Combinatorica

JF - Combinatorica

SN - 0209-9683

IS - 2

ER -