DIRECTED SIMPLICES IN HIGHER ORDER TOURNAMENTS

DOI10.1112/S0025579309000539zbMath1201.05068arXiv0906.4027MaRDI QIDQ3406664

Ta Sheng Tan, Imre Leader

Publication date: 19 February 2010

Published in: Mathematika (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Hypergraphs (05C65) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

On high-dimensional acyclic tournaments ⋮ Cycles in oriented 3-graphs ⋮ Matricial characterization of tournaments with maximum number of diamonds

Cites Work

• The number of triangles covering the center of an \(n\)-set
• A generalization of Caratheodory's theorem
• On the upper-bound conjecture for convex polytopes

This page was built for publication: DIRECTED SIMPLICES IN HIGHER ORDER TOURNAMENTS