Highly connected monochromatic subgraphs

Béla Bollobás, A. Gyárfás

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

We conjecture that for n > 4 (k - 1) every 2-coloring of the edges of the complete graph Kn contains a k-connected monochromatic subgraph with at least n - 2 (k - 1) vertices. This conjecture, if true, is best possible. Here we prove it for k = 2, and show how to reduce it to the case n <7 k - 6. We prove the following result as well: for n > 16 k every 2-colored Kn contains a k-connected monochromatic subgraph with at least n - 12 k vertices.

Original languageEnglish
Pages (from-to)1722-1725
Number of pages4
JournalDiscrete Mathematics
Volume308
Issue number9
DOIs
Publication statusPublished - May 6 2008

Fingerprint

Coloring
Subgraph
Complete Graph
Colouring

Keywords

  • Edge coloring of complete graphs
  • k-connected monochromatic subgraphs

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Highly connected monochromatic subgraphs. / Bollobás, Béla; Gyárfás, A.

In: Discrete Mathematics, Vol. 308, No. 9, 06.05.2008, p. 1722-1725.

Research output: Contribution to journalArticle

Bollobás, Béla ; Gyárfás, A. / Highly connected monochromatic subgraphs. In: Discrete Mathematics. 2008 ; Vol. 308, No. 9. pp. 1722-1725.
@article{f4307174ebeb41b2a0d9872b37916624,
title = "Highly connected monochromatic subgraphs",
abstract = "We conjecture that for n > 4 (k - 1) every 2-coloring of the edges of the complete graph Kn contains a k-connected monochromatic subgraph with at least n - 2 (k - 1) vertices. This conjecture, if true, is best possible. Here we prove it for k = 2, and show how to reduce it to the case n <7 k - 6. We prove the following result as well: for n > 16 k every 2-colored Kn contains a k-connected monochromatic subgraph with at least n - 12 k vertices.",
keywords = "Edge coloring of complete graphs, k-connected monochromatic subgraphs",
author = "B{\'e}la Bollob{\'a}s and A. Gy{\'a}rf{\'a}s",
year = "2008",
month = "5",
day = "6",
doi = "10.1016/j.disc.2006.01.030",
language = "English",
volume = "308",
pages = "1722--1725",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "9",

}

TY - JOUR

T1 - Highly connected monochromatic subgraphs

AU - Bollobás, Béla

AU - Gyárfás, A.

PY - 2008/5/6

Y1 - 2008/5/6

N2 - We conjecture that for n > 4 (k - 1) every 2-coloring of the edges of the complete graph Kn contains a k-connected monochromatic subgraph with at least n - 2 (k - 1) vertices. This conjecture, if true, is best possible. Here we prove it for k = 2, and show how to reduce it to the case n <7 k - 6. We prove the following result as well: for n > 16 k every 2-colored Kn contains a k-connected monochromatic subgraph with at least n - 12 k vertices.

AB - We conjecture that for n > 4 (k - 1) every 2-coloring of the edges of the complete graph Kn contains a k-connected monochromatic subgraph with at least n - 2 (k - 1) vertices. This conjecture, if true, is best possible. Here we prove it for k = 2, and show how to reduce it to the case n <7 k - 6. We prove the following result as well: for n > 16 k every 2-colored Kn contains a k-connected monochromatic subgraph with at least n - 12 k vertices.

KW - Edge coloring of complete graphs

KW - k-connected monochromatic subgraphs

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

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

U2 - 10.1016/j.disc.2006.01.030

DO - 10.1016/j.disc.2006.01.030

M3 - Article

VL - 308

SP - 1722

EP - 1725

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 9

ER -