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

DOI10.1007/S00373-023-02643-XOpenAlexW3124147190WikidataQ123153713 ScholiaQ123153713MaRDI QIDQ2701398FDOQ2701398

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

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

Cites Work

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

Cited In (4)

• Forbidding Couples of Tournaments and the Erd\"{o}s-Hajnal Conjecture
• Forests and the strong Erdős-Hajnal property
• Title not available (Why is that?)
• 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

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