On high-dimensional acyclic tournaments

DOI10.1007/s00454-013-9543-8zbMath1280.05052arXiv1302.1684OpenAlexW1990073828MaRDI QIDQ393743

Avraham Morgenstern, Nathan Linial

Publication date: 24 January 2014

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

enumerationtournamenthigh-dimensionalacyclichyper-plane arrangements

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Spanning surfaces in \(3\)-graphs ⋮ The Erdős-Hajnal hypergraph Ramsey problem ⋮ Cycles in oriented 3-graphs ⋮ A universal exponent for homeomorphs

Cites Work

• An improved bound for the stepping-up lemma
• Ramsey-type theorems
• On the asymptotic number of tournament score sequences
• The complexity of point configurations
• DIRECTED SIMPLICES IN HIGHER ORDER TOURNAMENTS
• Ramsey-type theorems with forbidden subgraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On high-dimensional acyclic tournaments