3 citations · 4 across the 11 of their papers we have counts for
4 papers · 1 filter
The intersection spectrum of 3-chromatic intersecting hypergraphs
Matija Bucić, Stefan Glock, Benny Sudakov
For a hypergraph , define its intersection spectrum as the set of all intersection sizes of distinct edges . In their seminal paper from 1973 whi…
Extremal aspects of graph and hypergraph decomposition problems
Stefan Glock, Daniela Kühn, Deryk Osthus
We survey recent advances in the theory of graph and hypergraph decompositions, with a focus on extremal results involving minimum degree conditions. We also collect a number of in…
A note on dense bipartite induced subgraphs
Stefan Glock
This exposition contains a short and streamlined proof of the recent result of Kwan, Letzter, Sudakov and Tran that every triangle-free graph with minimum degree contains an in…
An average degree condition for independent transversals
Stefan Glock, Benny Sudakov
In 1994, Erdős, Gyárfás and Łuczak posed the following problem: given disjoint vertex sets of size~, with exactly one edge between any pair , how large…