Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- 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
5 papers · 2 filters
Creating cycles in Walker-Breaker games
Dennis Clemens, Tuan Tran
We consider biased Walker-Breaker games: Walker and Breaker alternately claim edges of the complete graph , Walker taking one edge and Breaker claiming edges in ea…
Quantum jumps of normal polytopes
Winfried Bruns, Joseph Gubeladze, Mateusz Michałek
We introduce a partial order on the set of all normal polytopes in R^d. This poset NPol(d) is a natural discrete counterpart of the continuum of convex compact sets in R^d, ordered…
Spanning trees in random series-parallel graphs
Julia Ehrenmüller, Juanjo Rué
By means of analytic techniques we show that the expected number of spanning trees in a connected labelled series-parallel graph on vertices chosen uniformly at random satisfie…
Color or cover
Ivan Izmestiev
If all but two vertices of a triangulated sphere have degrees divisible by , then the exceptional vertices are not adjacent. This theorem is proved for with the help of th…
On the minimum degree of minimal Ramsey graphs for multiple colours
Jacob Fox, Andrey Grinshpun, Anita Liebenau +2
A graph G is r-Ramsey for a graph H, denoted by G\rightarrow (H)_r, if every r-colouring of the edges of G contains a monochromatic copy of H. The graph G is called r-Ramsey-minima…