English

The flag upper bound theorem for 3- and 5-manifolds

Combinatorics 2015-12-23 v1

Abstract

We prove that among all flag 3-manifolds on nn vertices, the join of two circles with n2\left\lceil{\frac{n}{2}}\right \rceil and n2\left\lfloor{\frac{n}{2}}\right \rfloor vertices respectively is the unique maximizer of the face numbers. This solves the first case of a conjecture due to Lutz and Nevo. Further, we establish a sharp upper bound on the number of edges of flag 5-manifolds and characterize the cases of equality. We also show that the inequality part of the flag upper bound conjecture continues to hold for all flag 3-dimensional Eulerian complexes and find all maximizers of the face numbers in this class.

Keywords

Cite

@article{arxiv.1512.06958,
  title  = {The flag upper bound theorem for 3- and 5-manifolds},
  author = {Hailun Zheng},
  journal= {arXiv preprint arXiv:1512.06958},
  year   = {2015}
}

Comments

13 pages

R2 v1 2026-06-22T12:15:37.242Z