Random Ramsey graphs for the four-cycle

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

It is shown that there is a graph L with n vertices and at least n1.36 edges such that it contains neither L3 nor K2, 3 but every subgraph with 2n 4 3(log n)2 edges contains a C4, (n > nO). Moreover, chromatic number of G is at least n0.1.

Original languageEnglish
Pages (from-to)407-410
Number of pages4
JournalDiscrete Mathematics
Volume126
Issue number1-3
DOIs
Publication statusPublished - Mar 1 1994

Fingerprint

Chromatic number
Subgraph
Cycle
Graph in graph theory

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Random Ramsey graphs for the four-cycle. / Füredi, Z.

In: Discrete Mathematics, Vol. 126, No. 1-3, 01.03.1994, p. 407-410.

Research output: Contribution to journalArticle

Füredi, Z. / Random Ramsey graphs for the four-cycle. In: Discrete Mathematics. 1994 ; Vol. 126, No. 1-3. pp. 407-410.
@article{88a907b2fe0042ca8cf8812264388073,
title = "Random Ramsey graphs for the four-cycle",
abstract = "It is shown that there is a graph L with n vertices and at least n1.36 edges such that it contains neither L3 nor K2, 3 but every subgraph with 2n 4 3(log n)2 edges contains a C4, (n > nO). Moreover, chromatic number of G is at least n0.1.",
author = "Z. F{\"u}redi",
year = "1994",
month = "3",
day = "1",
doi = "10.1016/0012-365X(94)90287-9",
language = "English",
volume = "126",
pages = "407--410",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Random Ramsey graphs for the four-cycle

AU - Füredi, Z.

PY - 1994/3/1

Y1 - 1994/3/1

N2 - It is shown that there is a graph L with n vertices and at least n1.36 edges such that it contains neither L3 nor K2, 3 but every subgraph with 2n 4 3(log n)2 edges contains a C4, (n > nO). Moreover, chromatic number of G is at least n0.1.

AB - It is shown that there is a graph L with n vertices and at least n1.36 edges such that it contains neither L3 nor K2, 3 but every subgraph with 2n 4 3(log n)2 edges contains a C4, (n > nO). Moreover, chromatic number of G is at least n0.1.

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

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

U2 - 10.1016/0012-365X(94)90287-9

DO - 10.1016/0012-365X(94)90287-9

M3 - Article

AN - SCOPUS:38149147656

VL - 126

SP - 407

EP - 410

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -