Help Privacy Policy Disclaimer
  Advanced SearchBrowse





An Upper Bound Theorem for a Class of Flag Weak Pseudomanifolds


Adamaszek,  Michal
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

(Preprint), 202KB

Supplementary Material (public)
There is no public supplementary material available

Adamaszek, M. (2013). An Upper Bound Theorem for a Class of Flag Weak Pseudomanifolds. Retrieved from http://arxiv.org/abs/1303.5603.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0024-44C7-9
If K is an odd-dimensional flag closed manifold, flag generalized homology sphere or a more general flag weak pseudomanifold with sufficiently many vertices, then the maximal number of edges in K is achieved by the balanced join of cycles. The proof relies on stability results from extremal graph theory. In the case of manifolds we also offer an alternative (very) short proof utilizing the non-embeddability theorem of Flores. The main theorem can also be interpreted without the topological contents as a graph-theoretic extremal result about a class of graphs such that 1) every maximal clique in the graph has size d+1 and 2) every clique of size d belongs to exactly two maximal cliques.