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

DOI10.1007/S00493-020-4220-ZzbMATH Open1488.05487OpenAlexW3156259002MaRDI QIDQ822644FDOQ822644

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

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

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

• ON THE METHOD OF PAIRED COMPARISONS
• Title not available (Why is that?)
• The difference between consecutive primes. II
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the number of 7-cycles in regular \(n\)-tournaments
• On 5-cycles and 6-cycles in regular \(n\)-tournaments
• Title not available (Why is that?)
• On the number of 5-cycles in a tournament
• On The Number of Faces of a Convex Polytope
• Title not available (Why is that?)
• Title not available (Why is that?)

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)