BOUNDING THE NUMBER OF COMPATIBLE SIMPLICES IN HIGHER DIMENSIONAL TOURNAMENTS
A tournament graph G is a vertex set V of size n, together with a directed edge set E ⊂ V × V such that (i, j) ∈ E if and only if (j, i) ∉ E for all distinct i, j ∈ V and (i, i) ∉ E for all i ∈ V. We explore the following generalization: For a fixed k we orient every k-subset of V by assigning it an...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
UKnowledge
2019
|
| Subjects: | |
| Online Access: | https://uknowledge.uky.edu/math_etds/63 https://uknowledge.uky.edu/cgi/viewcontent.cgi?article=1064&context=math_etds |