Forbidding couples of tournaments and the Erdös-Hajnal conjecture

DOI10.1007/s00373-023-02643-xOpenAlexW3124147190WikidataQ123153713 ScholiaQ123153713MaRDI QIDQ2701398

Salman Ghazal, Soukaina Zayat

Publication date: 28 April 2023

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

orderingtournamenttransitive setErdös-Hajnal conjecture

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Forests and the strong Erdős-Hajnal property ⋮ 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
• Excluding pairs of tournaments
• Ramsey-type theorems with forbidden subgraphs
• Erdös–Hajnal conjecture for new infinite families of tournaments

This page was built for publication: Forbidding couples of tournaments and the Erdös-Hajnal conjecture