On tournaments free of large transitive subtournaments

DOI10.1007/s003730050025zbMath0918.05058OpenAlexW2055334092MaRDI QIDQ1393032

Adolfo Sánchez-Flores

Publication date: 2 August 1998

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

Full work available at URL: https://doi.org/10.1007/s003730050025

zbMATH Keywords

transitive tournament

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items

On the dichromatic number of surfaces ⋮ A note on some embedding problems for oriented graphs ⋮ The number of edge-disjoint transitive triples in a tournament ⋮ Design and serial construction of digraph braids ⋮ Tighter bounds on directed Ramsey number \(R(7)\) ⋮ The smallest 5-chromatic tournament ⋮ New bounds on the Ramsey number \(r ( I_m , L_n )\) ⋮ On the restricted isometry property of the Paley matrix ⋮ Semidefinite Programming and Ramsey Numbers ⋮ A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments ⋮ Upper bounds on the size of transitive subtournaments in digraphs ⋮ Tournaments and Semicomplete Digraphs ⋮ Transitive Tournament Tilings in Oriented Graphs with Large Minimum Total Degree ⋮ Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth ⋮ Infinite families of -dichromatic vertex critical circulant tournaments

This page was built for publication: On tournaments free of large transitive subtournaments