Unavoidable chromatic patterns in 2‐colorings of the complete graph

DOI10.1002/jgt.22645zbMath1522.05102arXiv1810.12375OpenAlexW3098432165MaRDI QIDQ6055932

Adriana Hansberg, Yair Caro, Amanda Montejano

Publication date: 29 September 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1810.12375

zbMATH Keywords

Ramsey theoryextremal graph theoryedge colouringsunavoidable patternsbalanceableomnitonal

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)

Related Items (5)

Turán‐ and Ramsey‐type results for unavoidable subgraphs ⋮ Graphs isomorphisms under edge-replacements and the family of amoebas ⋮ Unbalanced spanning subgraphs in edge labeled complete graphs ⋮ The balancing number and generalized balancing number of some graph classes ⋮ On zero-sum spanning trees and zero-sum connectivity

Cites Work

• Unnamed Item
• Unnamed Item
• Unavoidable subgraphs of colored graphs
• Unavoidable patterns
• Ramsey theory. Yesterday, today, and tomorrow
• Interpolation theorems for graphs, hypergraphs and matroids
• Zero-sum subsequences in bounded-sum \(\{-1,1\}\)-sequences
• Interpolation theorems on graph parameters
• Path Ramsey numbers in multicolorings
• Zero-sum problems -- a survey
• Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\)
• Non-monochromatic triangles in a 2-edge-coloured graph
• On small balanceable, strongly-balanceable and omnitonal graphs
• Finding unavoidable colorful patterns in multicolored graphs
• On maximal paths and circuits of graphs
• Classification of interpolation theorems for spanning trees and other families of spanning subgraphs
• On three zero‐sum Ramsey‐type problems
• The History of Degenerate (Bipartite) Extremal Graph Problems
• On a problem of K. Zarankiewicz
• On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\)
• Graphs isomorphisms under edge-replacements and the family of amoebas

This page was built for publication: Unavoidable chromatic patterns in 2‐colorings of the complete graph