umu.sePublikationer
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Unavoidable subgraphs of colored graphs
Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Matematiska institutionen. Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152, USA.
2008 (Engelska)Ingår i: Discrete Mathematics, ISSN 0012-365X, E-ISSN 1872-681X, Vol. 308, nr 19, s. 4396-4413Artikel i tidskrift (Refereegranskat) Published
Resurstyp
Text
Abstract [en]

A natural generalization of graph Ramsey theory is the study of unavoidable sub-graphs in large colored graphs. In this paper. we find a minimal family of unavoidable graphs in two-edge-colored graphs. Namely, for a positive even integer k, let y(k) be the family of two-edge-colored graphs on k vertices such that one of the colors forms either two disjoint K-k/2's or simply one K-k/2. Bollobas conjectured that for all k and epsilon > 0, there exists an n(k, epsilon) such that if n >= n(k, epsilon) then every two-edge-coloring of K-n, in which the density of each color is at least epsilon, contains a member of this family. We solve this conjecture and present a series of results bounding it (k, s) for different ranges of epsilon. In particular, if epsilon is sufficiently close to 1/2, the gap between out upper and lower bounds for n(k, epsilon) is smaller than those for the classical Ramsey number R(k, k).

Ort, förlag, år, upplaga, sidor
Amsterdam: Elsevier, 2008. Vol. 308, nr 19, s. 4396-4413
Nyckelord [en]
Ramsey theory, unavoidable structures
Nationell ämneskategori
Diskret matematik
Identifikatorer
URN: urn:nbn:se:umu:diva-117479DOI: 10.1016/j.disc.2007.08.102ISI: 000257978700011OAI: oai:DiVA.org:umu-117479DiVA, id: diva2:911396
Konferens
Workshop on Extremal Graph Theory, JUN 23-27, 2003, Csopak, HUNGARY
Tillgänglig från: 2016-03-11 Skapad: 2016-03-01 Senast uppdaterad: 2018-03-15Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltext
Av organisationen
Matematiska institutionen
I samma tidskrift
Discrete Mathematics
Diskret matematik

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 161 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf