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

DOI10.1016/J.DISC.2021.112791zbMATH Open1491.05072OpenAlexW4229073116WikidataQ113877036 ScholiaQ113877036MaRDI QIDQ2113341FDOQ2113341

Authors: Richard Snyder, Lea Weber, Maria 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

Recommendations

• The Erdős-Hajnal conjecture for rainbow triangles
• Three edge-coloring conjectures
• scientific article; zbMATH DE number 1463391
• Proof of a conjecture of Erdős on triangles in set-systems
• A new proof of 3-colorability of Eulerian triangulations
• On the Erdős-Hajnal problem for 3-graphs
• scientific article; zbMATH DE number 5139507
• A coloring problem related to the Erdős, Faber, Lovasz conjecture
• On some three-color Ramsey numbers

zbMATH Keywords

edge-coloringtrianglescolor patternsindependent sets in multicoloringsErdős-Hajnal conjecture

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• The Erdős-Hajnal conjecture for rainbow triangles
• A new proof of 3-colorability of Eulerian triangulations
• Bordeaux 3-color conjecture and 3-choosability
• Large cliques or cocliques in hypergraphs with forbidden order-size pairs
• Cliques with many colors in triple systems

This page was built for publication: The Erdős-Hajnal conjecture for three colors and triangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113341)