Papers
Topics
Authors
Recent
Search
2000 character limit reached

Extremal problems related to Betti numbers of flag complexes

Published 22 Sep 2011 in math.CO | (1109.4775v4)

Abstract: We study the problem of maximizing Betti numbers of simplicial complexes. We prove an upper bound of 1.32n for the sum of Betti numbers of any n-vertex flag complex and 1.25n for the independence complex of a triangle-free graph. These findings imply upper bounds for the Betti numbers of various related classes of spaces, including the neighbourhood complex of a graph. We also make some related observations.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (1)

  1. Michal Adamaszek 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up