ETH Institute for Theoretical Studies

output

20132022

most citedCosmology and Fundamental Physics with the Euclid Satellite

1k citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing math.COShow all

12 papers · 1 filter

math.CO2019★ 6 cited

Counting Hamilton cycles in Dirac hypergraphs

Stefan Glock, Stephen Gould, Felix Joos +2

A tight Hamilton cycle in a $k$ -uniform hypergraph ( $k$ -graph) $G$ is a cyclic ordering of the vertices of $G$ such that every set of $k$ consecutive vertices in the ordering forms…

math.CO2019★ 22 cited

Pseudorandom hypergraph matchings

Stefan Ehard, Stefan Glock, Felix Joos

A celebrated theorem of Pippenger states that any almost regular hypergraph with small codegrees has an almost perfect matching. We show that one can find such an almost perfect ma…

math.CO2018★ 4 cited

Dense induced bipartite subgraphs in triangle-free graphs

Matthew Kwan, Shoham Letzter, Benny Sudakov +1

The problem of finding dense induced bipartite subgraphs in $H$ -free graphs has a long history, and was posed 30 years ago by Erdős, Faudree, Pach and Spencer. In this paper, we ob…

math.CO2018★ 2 cited

Monochromatic trees in random tournaments

Matija Bucic, Sven Heberle, Shoham Letzter +1

We prove that, with high probability, in every $2$ -edge-colouring of the random tournament on $n$ vertices there is a monochromatic copy of every oriented tree of order $O (n / \sq…

math.CO2018

Euler tours in hypergraphs

Stefan Glock, Felix Joos, Daniela Kühn +1

We show that a quasirandom $k$ -uniform hypergraph $G$ has a tight Euler tour subject to the necessary condition that $k$ divides all vertex degrees. The case when $G$ is complete c…

math.CO2018

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…

math.CO2018★ 28 cited

Three colour bipartite Ramsey number of cycles and paths

Matija Bucić, Shoham Letzter, Benny Sudakov

The $k$ -colour bipartite Ramsey number of a bipartite graph $H$ is the least integer $n$ for which every $k$ -edge-coloured complete bipartite graph $K_{n, n}$ contains a monochromat…

math.CO2018★ 5 cited

Minimum saturated families of sets

Matija Bucić, Shoham Letzter, Benny Sudakov +1

We call a family $F$ of subsets of $[n]$ $s$ -saturated if it contains no $s$ pairwise disjoint sets, and moreover no set can be added to $F$ while preserving th…

math.CO2017★ 6 cited

Directed Ramsey number for trees

Matija Bucic, Shoham Letzter, Benny Sudakov

In this paper, we study Ramsey-type problems for directed graphs. We first consider the $k$ -colour oriented Ramsey number of $H$ , denoted by $R (H, k)$ , which is the…

math.CO2017★ 15 cited

Monochromatic paths in random tournaments

Matija Bucić, Shoham Letzter, Benny Sudakov

We prove that, with high probability, any $2$ -edge-colouring of a random tournament on $n$ vertices contains a monochromatic path of length $Ω (n / lo g n)$ . This resolves a…

math.CO2016★ 46 cited

Upper bounds for sunflower-free sets

Eric Naslund, William F. Sawin

A collection of $k$ sets is said to form a $k$ -sunflower, or $Δ$ -system, if the intersection of any two sets from the collection is the same, and we call a family of sets $\mathcal…

math.CO2015

Exact maximum-entropy estimation with Feynman diagrams

Tomer M. Schlank, Ran J. Tessler, Amitai Netser Zernik

A classical longstanding open problem in statistics is finding an explicit expression for the probability measure which maximizes entropy with respect to given constraints. In this…