The Erdős-Hajnal conjecture for three colors and triangles

DOI10.1016/j.disc.2021.112791zbMath1491.05072OpenAlexW4229073116WikidataQ113877036 ScholiaQ113877036MaRDI QIDQ2113341

Richard Snyder, Lea Weber, Maria A. Axenovich

Publication date: 14 March 2022

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

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

zbMATH Keywords

edge-coloringtrianglesErdős-Hajnal conjecturecolor patternsindependent sets in multicolorings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Ramsey theory (05D10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Near packings of two graphs
• Rainbow generalizations of Ramsey theory: A survey
• Ramsey-type theorems
• Highly connected monochromatic subgraphs of two-colored complete graphs
• The early evolution of the \(H\)-free process
• The triangle-free process
• A note on Ramsey numbers
• Asymptotic lower bounds for Ramsey functions
• The independence number of dense graphs with large odd girth
• Asymptotic bounds for some bipartite graph: Complete graph Ramsey numbers
• Generalizing the Ramsey problem through diameter
• The Erdős-Hajnal conjecture for rainbow triangles
• Sharp bounds for some multicolour Ramsey numbers
• The Erdös-Hajnal Conjecture-A Survey
• A Precise Threshold for Quasi-Ramsey Numbers
• Ramsey Problems with Bounded Degree Spread
• Bipartite Subgraphs of Triangle-Free Graphs
• On a Quasi‐Ramsey problem
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The C_ℓ‐free process
• Transitiv orientierbare Graphen
• Nordhaus–Gaddum‐type Theorems for decompositions into many parts
• Some remarks on the theory of graphs
• Combinatorial Relations and Chromatic Graphs