1 citations · 1 across the 4 of their papers we have counts for
6 papers
New results for MaxCut in -free graphs
Stefan Glock, Oliver Janzer, Benny Sudakov
The MaxCut problem asks for the size of a largest cut in a graph . It is well known that for any -edge graph , and the difference ${\rm…
Note on induced paths in sparse random graphs
Stefan Glock
We show that for , with high probability, the random graph contains an induced path of length . This improves a result obtained in…
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…
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…
A rainbow blow-up lemma for almost optimally bounded edge-colourings
Stefan Ehard, Stefan Glock, Felix Joos
A subgraph of an edge-coloured graph is called rainbow if all its edges have different colours. We prove a rainbow version of the blow-up lemma of Komlós, Sárközy and Szemerédi tha…
Decompositions into isomorphic rainbow spanning trees
Stefan Glock, Daniela Kühn, Richard Montgomery +1
A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. Our main result implies that, given any optimal colouring of a sufficiently large com…