Convex hull of face vectors of colored complexes

DOI10.1016/j.ejc.2013.07.004zbMath1295.52013arXiv1210.8390OpenAlexW2050522399MaRDI QIDQ2441631

Afshin Goodarzi

Publication date: 25 March 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.8390

zbMATH Keywords

graph\(f\)-vectorsimplicial complexTurán graph\(r\)-colourable

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

UPPER BOUND THEOREM FOR ODD‐DIMENSIONAL FLAG TRIANGULATIONS OF MANIFOLDS

Cites Work

• Convex hulls of \(f\)- and \(\beta\)-vectors
• Shadows of colored complexes.
• Turan's Graph Theorem
• Proofs from THE BOOK

This page was built for publication: Convex hull of face vectors of colored complexes