6 citations · 8 across the 3 of their papers we have counts for
6 papers
On the Complexity of Embeddable Simplicial Complexes
Anna Gundert
This thesis addresses the question of the maximal number of -simplices for a simplicial complex which is embeddable into for some . A lower boun…
The Theta Number of Simplicial Complexes
Christine Bachoc, Anna Gundert, Alberto Passuello
We introduce a generalization of the celebrated Lovász theta number of a graph to simplicial complexes of arbitrary dimension. Our generalization takes advantage of real simplicial…
On Eigenvalues of Random Complexes
Anna Gundert, Uli Wagner
We consider higher-dimensional generalizations of the normalized Laplacian and the adjacency matrix of graphs and study their eigenvalues for the Linial-Meshulam model o…
On Topological Minors in Random Simplicial Complexes
Anna Gundert, Uli Wagner
For random graphs, the containment problem considers the probability that a binomial random graph contains a given graph as a substructure. When asking for the graph as a…
Higher Dimensional Discrete Cheeger Inequalities
Anna Gundert, May Szedlák
For graphs there exists a strong connection between spectral and combinatorial expansion properties. This is expressed, e.g., by the discrete Cheeger inequality, the lower bound of…
Not All Saturated 3-Forests Are Tight
Heidi Gebauer, Anna Gundert, Robin A. Moser +1
A basic statement in graph theory is that every inclusion-maximal forest is connected, i.e. a tree. Using a definiton for higher dimensional forests by Graham and Lovasz and the co…