Large Chromatic Number and Ramsey Graphs

Csaba Biró, Z. Füredi, Sogol Jahanbekam

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Let Q (n, χ) denote the minimum clique size an n-vertex graph can have if its chromatic number is χ. Using Ramsey graphs we give an exact, albeit implicit, formula for the case χ ≥ (n + 3)/2.

Original languageEnglish
Pages (from-to)1183-1191
Number of pages9
JournalGraphs and Combinatorics
Volume29
Issue number5
DOIs
Publication statusPublished - Sep 2013

Fingerprint

Chromatic number
Graph in graph theory
Clique
Denote
Vertex of a graph

Keywords

  • Chromatic number
  • Clique number
  • Ramsey graphs

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Large Chromatic Number and Ramsey Graphs. / Biró, Csaba; Füredi, Z.; Jahanbekam, Sogol.

In: Graphs and Combinatorics, Vol. 29, No. 5, 09.2013, p. 1183-1191.

Research output: Contribution to journalArticle

Biró, Csaba ; Füredi, Z. ; Jahanbekam, Sogol. / Large Chromatic Number and Ramsey Graphs. In: Graphs and Combinatorics. 2013 ; Vol. 29, No. 5. pp. 1183-1191.
@article{2103baab28634563b9d49e92c3deba6f,
title = "Large Chromatic Number and Ramsey Graphs",
abstract = "Let Q (n, χ) denote the minimum clique size an n-vertex graph can have if its chromatic number is χ. Using Ramsey graphs we give an exact, albeit implicit, formula for the case χ ≥ (n + 3)/2.",
keywords = "Chromatic number, Clique number, Ramsey graphs",
author = "Csaba Bir{\'o} and Z. F{\"u}redi and Sogol Jahanbekam",
year = "2013",
month = "9",
doi = "10.1007/s00373-012-1179-6",
language = "English",
volume = "29",
pages = "1183--1191",
journal = "Graphs and Combinatorics",
issn = "0911-0119",
publisher = "Springer Japan",
number = "5",

}

TY - JOUR

T1 - Large Chromatic Number and Ramsey Graphs

AU - Biró, Csaba

AU - Füredi, Z.

AU - Jahanbekam, Sogol

PY - 2013/9

Y1 - 2013/9

N2 - Let Q (n, χ) denote the minimum clique size an n-vertex graph can have if its chromatic number is χ. Using Ramsey graphs we give an exact, albeit implicit, formula for the case χ ≥ (n + 3)/2.

AB - Let Q (n, χ) denote the minimum clique size an n-vertex graph can have if its chromatic number is χ. Using Ramsey graphs we give an exact, albeit implicit, formula for the case χ ≥ (n + 3)/2.

KW - Chromatic number

KW - Clique number

KW - Ramsey graphs

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

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

U2 - 10.1007/s00373-012-1179-6

DO - 10.1007/s00373-012-1179-6

M3 - Article

AN - SCOPUS:84882822829

VL - 29

SP - 1183

EP - 1191

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 0911-0119

IS - 5

ER -