Article contents
DIRECTED SIMPLICES IN HIGHER ORDER TOURNAMENTS
Published online by Cambridge University Press: 10 December 2009
Abstract
It is well known that a tournament (complete oriented graph) on n vertices has at most directed triangles, and that the constant is best possible. Motivated by some geometric considerations, our aim in this paper is to consider some “higher order” versions of this statement. For example, if we give each 3-set from an n-set a cyclic ordering, then what is the greatest number of “directed 4-sets” we can have? We give an asymptotically best possible answer to this question, and give bounds in the general case when we orient each d-set from an n-set.
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © University College London 2010
References
- 5
- Cited by