Directed Simplices In Higher Order Tournaments

Details Directed Simplices In Higher Order Tournaments Directed Simplices In Higher Order Tournaments

2009-06-22

arxiv.org/abs/0906.4027v1

Mathematics

Combinatorics

9 pages

Scientific paper

It is well known that a tournament (complete oriented graph) on $n$ vertices has at most ${1/4}\binom{n}{3}$ directed triangles, and that the constant 1/4 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.

Affiliated with

Also associated with

No associations

Rating

Directed Simplices In Higher Order Tournaments does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Directed Simplices In Higher Order Tournaments, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Directed Simplices In Higher Order Tournaments will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-495714