1k citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- ETH ZurichCH96 papers
- Tokyo University of ScienceJP12 papers
- KTH Royal Institute of TechnologySE10 papers
- McGill UniversityCA10 papers
- Stockholm UniversitySE10 papers
- Centre National de la Recherche ScientifiqueFR9 papers
- Nordic Institute for Theoretical PhysicsSE8 papers
- Universidad Autónoma de MadridES7 papers
- Aix-Marseille UniversitéFR6 papers
- Heidelberg UniversityDE6 papers
- Instituto de Física TeóricaES6 papers
- Kyoto UniversityJP6 papers
6 papers · 2 filters
Dense induced bipartite subgraphs in triangle-free graphs
Matthew Kwan, Shoham Letzter, Benny Sudakov +1
The problem of finding dense induced bipartite subgraphs in -free graphs has a long history, and was posed 30 years ago by Erdős, Faudree, Pach and Spencer. In this paper, we ob…
Monochromatic trees in random tournaments
Matija Bucic, Sven Heberle, Shoham Letzter +1
We prove that, with high probability, in every -edge-colouring of the random tournament on vertices there is a monochromatic copy of every oriented tree of order $O (n / \sq…
Euler tours in hypergraphs
Stefan Glock, Felix Joos, Daniela Kühn +1
We show that a quasirandom -uniform hypergraph has a tight Euler tour subject to the necessary condition that divides all vertex degrees. The case when is complete c…
Minimalist designs
Ben Barber, Stefan Glock, Daniela Kühn +3
The iterative absorption method has recently led to major progress in the area of (hyper-)graph decompositions. Amongst other results, a new proof of the Existence conjecture for c…
Three colour bipartite Ramsey number of cycles and paths
Matija Bucić, Shoham Letzter, Benny Sudakov
The -colour bipartite Ramsey number of a bipartite graph is the least integer for which every -edge-coloured complete bipartite graph contains a monochromat…
Minimum saturated families of sets
Matija Bucić, Shoham Letzter, Benny Sudakov +1
We call a family of subsets of -saturated if it contains no pairwise disjoint sets, and moreover no set can be added to while preserving th…