Unavoidable subgraphs of colored graphs

DOI10.1016/j.disc.2007.08.102zbMath1157.05039OpenAlexW2078451812MaRDI QIDQ941378

Balázs Montágh, Jonathan Cutler

Publication date: 4 September 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.08.102

zbMATH Keywords

Ramsey theoryunavoidable structures

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (10)

Large unavoidable subtournaments ⋮ Turán theorems for unavoidable patterns ⋮ Turán‐ and Ramsey‐type results for unavoidable subgraphs ⋮ Unavoidable chromatic patterns in 2‐colorings of the complete graph ⋮ Unbalanced spanning subgraphs in edge labeled complete graphs ⋮ The balancing number and generalized balancing number of some graph classes ⋮ Large Unavoidable Subtournaments ⋮ Finding unavoidable colorful patterns in multicolored graphs ⋮ Unavoidable patterns ⋮ Dependent random choice

Cites Work

• Unnamed Item
• Unnamed Item
• On the number of homogeneous subgraphs of a graph
• Ramsey's theorem - a new lower bound
• An upper bound for some ramsey numbers
• On a combinatorical problem of K. Zarankiewicz
• Some remarks on the theory of graphs
• On a problem of K. Zarankiewicz

This page was built for publication: Unavoidable subgraphs of colored graphs