Forests and the strong Erdős-Hajnal property

DOI10.1016/j.disc.2024.113920arXiv2207.09146OpenAlexW4391708046MaRDI QIDQ6204336

Soukaina Zayat

Publication date: 27 March 2024

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

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

zbMATH Keywords

orderingtournamentforestErdős-Hajnal conjecturepure pair

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Ramsey theory (05D10) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Ramsey-type theorems
• On the Erdős-Hajnal conjecture for six-vertex tournaments
• Tournaments and the strong Erdős-Hajnal property
• Forcing large transitive subtournaments
• EH-suprema of tournaments with no nontrivial homogeneous sets
• Forbidding couples of tournaments and the Erdös-Hajnal conjecture
• The Voting Problem
• Excluding pairs of tournaments
• Ramsey-type theorems with forbidden subgraphs
• About the Erdős-Hajnal conjecture for seven-vertex tournaments
• Pure pairs. X. Tournaments and the strong Erdős-Hajnal property
• Erdös–Hajnal conjecture for new infinite families of tournaments
• Unnamed Item

This page was built for publication: Forests and the strong Erdős-Hajnal property