Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 1 of 1
Full-Text Articles in Number Theory
Bounding The Number Of Compatible Simplices In Higher Dimensional Tournaments, Karthik Chandrasekhar
Bounding The Number Of Compatible Simplices In Higher Dimensional Tournaments, Karthik Chandrasekhar
Theses and Dissertations--Mathematics
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 orientation. That is, every facet of the (k − 1)-skeleton of the ( …