Document Type
Lecture
Publication Date
11-19-2014
Abstract
It is well known that a tournament (complete oriented graph) on n vertices has at most ¼·(n choose 2) cyclic triangles, and that the constant ¼ is best possible. Motivated by some geometric considerations, our aim is to consider some 'higher order' versions of this result. No knowledge of tournaments will be assumed.
Relational Format
presentation
Recommended Citation
Leader, Imre, "Higher Order Tournaments" (2014). Colloquium. 15.
https://egrove.olemiss.edu/math_colloquium/15
COinS
