Erdös–Hajnal conjecture for new infinite families of tournaments

DOI10.1002/jgt.22877zbMath1522.05169arXiv2010.12329OpenAlexW3094182308WikidataQ113915781 ScholiaQ113915781MaRDI QIDQ6093157

Soukaina Zayat, Salman Ghazal

Publication date: 6 October 2023

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

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

zbMATH Keywords

orderingtransitivitytournamentErdös-Hajnal conjecture

Mathematics Subject Classification ID

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

Related Items (4)

Pure pairs. X. Tournaments and the strong Erdős-Hajnal property ⋮ Forests and the strong Erdős-Hajnal property ⋮ Forbidding couples of tournaments and the Erdös-Hajnal conjecture ⋮ Unnamed Item

Cites Work

• Ramsey-type theorems
• On the Erdős-Hajnal conjecture for six-vertex tournaments
• Forcing large transitive subtournaments
• EH-suprema of tournaments with no nontrivial homogeneous sets
• The Voting Problem
• Ramsey-type theorems with forbidden subgraphs

This page was built for publication: Erdös–Hajnal conjecture for new infinite families of tournaments