Largest digraphs contained in all n-tournaments

DOI10.1007/BF02579345zbMath0532.05032OpenAlexW1970492311MaRDI QIDQ788740

Vera T. Sós, Michael E. Saks, Nathan Linial

Publication date: 1983

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

tournamentsubgraphs

Mathematics Subject Classification ID

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

Related Items (11)

What must be contained in every oriented k-uniform hypergraph ⋮ \(k\)-ary spanning trees contained in tournaments ⋮ An Extension of the Hajnal–Szemerédi Theorem to Directed Graphs ⋮ Learnability and rationality of choice. ⋮ On claws belonging to every tournament ⋮ Claws contained in all \(n\)-tournaments ⋮ Ramsey numbers for tournaments ⋮ 2-partition-transitive tournaments ⋮ Tournaments and Semicomplete Digraphs ⋮ On avoidable and unavoidable claws ⋮ Orientation Ramsey Thresholds for Cycles and Cliques

Cites Work

• Realization of certain generalized paths in tournaments
• Antidirected Hamiltonian circuits in tournaments
• Parity of paths and circuits in tournaments
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Largest digraphs contained in all n-tournaments