Dense flag triangulations of 3-manifolds via extremal graph theory

DOI10.1090/S0002-9947-2014-06153-9zbMath1306.05259arXiv1205.4060MaRDI QIDQ5496677

Michał Adamaszek, Jan Hladký

Publication date: 2 February 2015

Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

\(f\)-vectorsimplicial complexGal's conjectureflag triangulations of 3-manifolds

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Exact enumeration problems, generating functions (05A15) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Combinatorial aspects of simplicial complexes (05E45)

Related Items (4)

Extremal Graph Theory and Face Numbers of Flag Triangulations of Manifolds ⋮ The flag $f$-vectors of Gorenstein* order complexes of dimension $3$ ⋮ UPPER BOUND THEOREM FOR ODD‐DIMENSIONAL FLAG TRIANGULATIONS OF MANIFOLDS ⋮ The upper bound theorem for flag homology 5-manifolds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(\gamma \)-vectors satisfying the Kruskal-Katona inequalities
• Supersaturated graphs and hypergraphs
• The Euler characteristic of a nonpositively curved, piecewise Euclidean manifold
• The \(\gamma \)-vector of a barycentric subdivision
• The numbers of faces of simplicial polytopes
• Real root conjecture fails for five- and higher-dimensional spheres
• The flag $f$-vectors of Gorenstein* order complexes of dimension $3$

This page was built for publication: Dense flag triangulations of 3-manifolds via extremal graph theory