3.2k citations
- 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
14 papers · 2 filters
Extremal graphs for clique-paths
Roman Glebov
In this paper we deal with a Turán-type problem: given a positive integer n and a forbidden graph H, how many edges can there be in a graph on n vertices without a subgraph H? How…
On extremal hypergraphs for hamiltonian cycles
Roman Glebov, Yury Person, Wilma Weps
We study sufficient conditions for Hamiltonian cycles in hypergraphs, and obtain both Turán- and Dirac-type results. While the Turán-type result gives an exact threshold for the ap…
On covering expander graphs by Hamilton cycles
Roman Glebov, Michael Krivelevich, Tibor Szabó
The problem of packing Hamilton cycles in random and pseudorandom graphs has been studied extensively. In this paper, we look at the dual question of covering all edges of a graph…
Brick polytopes of spherical subword complexes and generalized associahedra
Vincent Pilaud, Christian Stump
We generalize the brick polytope of V. Pilaud and F. Santos to spherical subword complexes for finite Coxeter groups. This construction provides polytopal realizations for a certai…
Acyclic systems of permutations and fine mixed subdivisions of simplices
Federico Ardila, Cesar Ceballos
A fine mixed subdivision of a (d-1)-simplex T of size n gives rise to a system of permutations of [n] on the edges of T, and to a collection of n unit (d-1)-simplic…
An improved error term for minimum H-decompositions of graphs
Peter Allen, Julia Böttcher, Yury Person
We consider partitions of the edge set of a graph G into copies of a fixed graph H and single edges. Let ϕ_H(n) denote the minimum number p such that any n-vertex G admits such a p…