A note on the multicolour version of the Erdős-Hajnal conjecture

DOI10.1016/J.DISC.2025.114437MaRDI QIDQ7014501zbMATH OpenFDO

Authors Maria Axenovich, Lea Weber

Publication date 11 March 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114437

zbMATH Keywords

Erdős-Hajnal conjectureforbidden colour patternshomogeneous setsmulticolour

Mathematics Subject Classification ID

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

Cites work

• Complement reducible graphs
• Edge colorings of complete graphs without tricolored triangles
• Erdős-Hajnal conjecture for graphs with bounded VC-dimension
• Hedgehogs are not colour blind
• scientific article; zbMATH DE number 3889565 (Why is no real title available?)
• scientific article; zbMATH DE number 3041944 (Why is no real title available?)
• Induced subgraph density. I: A loglog step towards Erdős-Hajnal
• Large cliques or cocliques in hypergraphs with forbidden order-size pairs
• New lower bounds for hypergraph Ramsey numbers
• On 3‐graphs with no four vertices spanning exactly two edges
• Rainbow Ramsey theorems for colorings establishing negative partition relations
• Ramsey-type theorems
• Ramsey-type theorems with forbidden subgraphs
• The asymptotics of r(4,t)
• The Erdős-Hajnal conjecture for paths and antipaths
• The Erdős-Hajnal conjecture for rainbow triangles
• The Erdős-Hajnal conjecture for three colors and triangles
• The Erdős-Hajnal conjecture. A survey
• Transitiv orientierbare Graphen

This page was built for publication: A note on the multicolour version of the Erdős-Hajnal conjecture

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