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
11 papers · 2 filters
On strong infinite Sidon and sets and random sets of integers
David Fabian, Juanjo Rué, Christoph Spiegel
A set of integers is an -strong Sidon set if the pairwise sums of its elements are far apart by a certain measure depending on , more specifically if $…
Hamiltonicity of random graphs in the stochastic block model
Michael Anastos, Alan Frieze, Pu Gao
We study the Hamiltonicity of the following model of a random graph. Suppose that we partition [n] into V_1,V_2,...,V_k and add edge {x,y} to our graph with probability p if there…
Exploring Projective Norm Graphs
Tomas Bayer, Tamás Mészáros, Lajos Rónyai +1
The projective norm graphs provide tight constructions for the Turán number of complete bipartite graphs with . In this paper we determine thei…
Minimal Representations of Order Types by Geometric Graphs
Oswin Aichholzer, Martin Balko, Michael Hoffmann +8
In order to have a compact visualization of the order type of a given point set S, we are interested in geometric graphs on S with few edges that unambiguously display the order ty…
Unimodular covers of 3-dimensional parallelepipeds and Cayley sums
Giulia Codenotti, Francisco Santos
We show that the following classes of lattice polytopes have unimodular covers, in dimension three: the class of parallelepipeds, the class of centrally symmetric polytopes, and th…
A local maximizer for lattice width of -dimensional hollow bodies
Gennadiy Averkov, Giulia Codenotti, Antonio Macchia +1
The second and fourth authors have conjectured that a certain hollow tetrahedron of width attains the maximum lattice width among all three-dimensional convex bodies…
A new face iterator for polyhedra and more general finite locally branched lattices
Jonathan Kliem, Christian Stump
We discuss a new memory-efficient depth-first algorithm and its implementation that iterates over all elements of a finite locally branched lattice. This algorithm can be applied t…
Characterization of the response maps of alternating-current networks
Günter Rote
In an alternating-current network, each edge has a complex "conductance" with positive real part. The response map is the linear map from the vector of voltages at a subset of "bou…
The covering radius and a discrete surface area for non-hollow simplices
Giulia Codenotti, Francisco Santos, Matthias Schymura
We explore upper bounds on the covering radius of non-hollow lattice polytopes. In particular, we conjecture a general upper bound of in dimension , achieved by the "stand…
Finding any given 2-factor in sparse pseudorandom graphs efficiently
Jie Han, Yoshiharu Kohayakawa, Patrick Morris +1
Given an -vertex pseudorandom graph and an -vertex graph with maximum degree at most two, we wish to find a copy of in , i.e.\ an embedding $φ\colon V(H)\to V(…
Ramsey properties of randomly perturbed graphs: cliques and cycles
Shagnik Das, Andrew Treglown
Given graphs , a graph is -Ramsey if for every colouring of the edges of with red and blue, there is a red copy of or a blue copy of . In thi…