Bounds on the number of compatible \(k\)-simplices matching the orientation of the \((k-1)\)-skeleton of a simplex

DOI10.1007/S00493-020-4220-ZzbMath1488.05487OpenAlexW3156259002MaRDI QIDQ822644

Karthik Chandrasekhar, Richard Ehrenborg

Publication date: 22 September 2021

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-020-4220-z

zbMATH Keywords

tournament\((k-1)\)-skeleton of a simplexoriented simplexpolynomial bounds

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Combinatorial aspects of simplicial complexes (05E45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of 7-cycles in regular \(n\)-tournaments
• The Difference Between Consecutive Primes, II
• On 5-Cycles and 6-Cycles in Regular n-Tournaments
• On the Number of 5‐Cycles in a Tournament
• On The Number of Faces of a Convex Polytope
• ON THE METHOD OF PAIRED COMPARISONS

This page was built for publication: Bounds on the number of compatible \(k\)-simplices matching the orientation of the \((k-1)\)-skeleton of a simplex