- Centre National de la Recherche ScientifiqueFR238 papers
- Helmholtz-Zentrum Berlin für Materialien und EnergieDE229 papers
- Technische Universität BerlinDE205 papers
- Deutsches Zentrum für Luft- und Raumfahrt e. V. (DLR)DE122 papers
- University of CambridgeGB113 papers
- Humboldt-Universität zu BerlinDE110 papers
- ETH ZurichCH105 papers
- Zuse Institute BerlinDE105 papers
- University of GenevaCH95 papers
- Sorbonne UniversitéFR94 papers
- Leiden UniversityNL91 papers
- Princeton UniversityUS90 papers
8 papers · 2 filters
Minimum vertex covers and the spectrum of the normalized Laplacian on trees
Hao Chen, Jürgen Jost
We show that, in the graph spectrum of the normalized graph Laplacian on trees, the eigenvalue 1 and eigenvalues near 1 are strongly related to minimum vertex covers. In particular…
Generic combinatorial rigidity of periodic frameworks
Justin Malestein, Louis Theran
We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigid…
Paths of homomorphisms from stable Kneser graphs
Carsten Schultz
We denote by SG_{n,k} the stable Kneser graph (Schrijver graph) of stable n-subsets of a set of cardinality 2n+k. For k congruent 3 (mod 4) and n\ge2 we show that there is a compon…
The Local Lemma is asymptotically tight for SAT
Heidi Gebauer, Tibor Szabo, Gabor Tardos
The Local Lemma is a fundamental tool of probabilistic combinatorics and theoretical computer science, yet there are hardly any natural problems known where it provides an asymptot…
A quantitative version of Steinhaus' theorem for compact, connected, rank-one symmetric spaces
Fernando Mário de Oliveira Filho, Frank Vallentin
Let , , ... be a sequence of positive numbers that converges to zero. A generalization of Steinhaus' theorem due to Weil implies that, if a subset of a homogeneous Rieman…
Bounds on the Coefficients of Tension and Flow Polynomials
Felix Breuer, Aaron Dall
The goal of this article is to obtain bounds on the coefficients of modular and integral flow and tension polynomials of graphs. To this end we make use of the fact that these poly…