Pure pairs. X. Tournaments and the strong Erdős-Hajnal property

DOI10.1016/j.ejc.2023.103786zbMath1525.05063arXiv2202.13977MaRDI QIDQ6081115

Maria Chudnovsky, P. D. Seymour, Alexander D. Scott, Sophie Spirkl

Publication date: 25 October 2023

Published in: European Journal of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Erdős-Hajnal conjecturetransitive subtournament

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Forests and the strong Erdős-Hajnal property

Cites Work

• Unnamed Item
• Unnamed Item
• Ramsey-type theorems
• A bipartite analogue of Dilworth's theorem
• On universality of graphs with uniformly distributed edges
• On the Erdős-Hajnal conjecture for six-vertex tournaments
• Tournaments and colouring
• Tournaments and the strong Erdős-Hajnal property
• Pure pairs. I: Trees and linear anticomplete pairs
• Forcing large transitive subtournaments
• EH-suprema of tournaments with no nontrivial homogeneous sets
• Graph Theory and Probability
• A Ramsey-Type Theorem for Orderings of a Graph
• Pure Pairs VI: Excluding an Ordered Tree
• Ramsey-type theorems with forbidden subgraphs
• Strengthening Rödl's theorem
• Erdős–Hajnal for graphs with no 5‐hole
• Erdös–Hajnal conjecture for new infinite families of tournaments

This page was built for publication: Pure pairs. X. Tournaments and the strong Erdős-Hajnal property