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

DOI10.1007/S00493-020-4220-ZMaRDI QIDQ822644zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Directed simplices in higher order tournaments
• The number of oriantations having no fixed tournament
• On the maximum number of spanning copies of an orientation in a tournament
• Orientations making \(k\)-cycles cyclic
• Counting orientations of graphs with no strongly connected tournaments

Cites work

• scientific article; zbMATH DE number 4102053 (Why is no real title available?)
• scientific article; zbMATH DE number 3501518 (Why is no real title available?)
• scientific article; zbMATH DE number 1849959 (Why is no real title available?)
• scientific article; zbMATH DE number 3267979 (Why is no real title available?)
• scientific article; zbMATH DE number 3303831 (Why is no real title available?)
• scientific article; zbMATH DE number 3194324 (Why is no real title available?)
• scientific article; zbMATH DE number 3102313 (Why is no real title available?)
• ON THE METHOD OF PAIRED COMPARISONS
• On 5-cycles and 6-cycles in regular \(n\)-tournaments
• On The Number of Faces of a Convex Polytope
• On the number of 5-cycles in a tournament
• On the number of 7-cycles in regular \(n\)-tournaments
• The difference between consecutive primes. II

Cited in

(1)

• Directed simplices in higher order tournaments

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q822644)