421 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University College LondonGB63 papers
- Systemic Risk CentreGB48 papers
- University of OxfordGB20 papers
- University of WarwickGB18 papers
- King's College LondonGB16 papers
- London Mathematical LaboratoryGB12 papers
- University of Illinois Urbana-ChampaignUS12 papers
- Centre National de la Recherche ScientifiqueFR11 papers
- Queen Mary University of LondonGB11 papers
- The Open UniversityGB11 papers
- City, University of LondonGB10 papers
- ETH ZurichCH10 papers
7 papers · 2 filters
A linear bound on the Manickam-Miklos-Singhi Conjecture
Alexey Pokrovskiy
Suppose that we have a set of numbers x_1, ..., x_n which have nonnegative sum. How many subsets of k numbers from {x_1, ..., x_n} must have nonnegative sum? Manickam, Miklos, and…
The Ramsey number of the clique and the hypercube
Gonzalo Fiz Pontiveros, Simon Griffiths, Robert Morris +2
The Ramsey number r(K_s,Q_n) is the smallest positive integer N such that every red-blue colouring of the edges of the complete graph K_N on N vertices contains either a red n-dime…
Spanning embeddings of arrangeable graphs with sublinear bandwidth
Julia Böttcher, Anusch Taraz, Andreas Würfl
The Bandwidth Theorem of Böttcher, Schacht and Taraz [Mathematische Annalen 343 (1), 175-205] gives minimum degree conditions for the containment of spanning graphs H with small ba…
An Extension of the Blow-up Lemma to arrangeable graphs
Julia Böttcher, Yoshiharu Kohayakawa, Anusch Taraz +1
The Blow-up Lemma established by Komlós, Sárközy, and Szemerédi in 1997 is an important tool for the embedding of spanning subgraphs of bounded maximum degree. Here we prove severa…
Advantage in the discrete Voronoi game
Dániel Gerbner, Viola Mészáros, Dömötör Pálvölgyi +2
We study the discrete Voronoi game, where two players alternately claim vertices of a graph for t rounds. In the end, the remaining vertices are divided such that each player recei…
Tight Hamilton cycles in random hypergraphs
Peter Allen, Julia Böttcher, Yoshiharu Kohayakawa +1
We give an algorithmic proof for the existence of tight Hamilton cycles in a random r-uniform hypergraph with edge probability p=n^{-1+eps} for every eps>0. This partly answers a q…
Maximum planar subgraphs in dense graphs
Peter Allen, Jozef Skokan, Andreas Würfl
Kühn, Osthus and Taraz showed that for each γ>0 there exists C such that any n-vertex graph with minimum degree γn contains a planar subgraph with at least 2n-C edges. We find the…