Extremal problems related to Betti numbers of flag complexes
Adamaszek, Michal
Original · EN
We study the problem of maximizing Betti numbers of simplicial complexes. We prove an upper bound of 1.32ⁿ for the sum of Betti numbers of any n-vertex flag complex and 1.25ⁿ 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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.