1 citations · 2 across the 2 of their papers we have counts for
4 papers · 1 filter
Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree
Stefan Ehard, Felix Joos
We prove that any quasirandom uniform hypergraph can be approximately decomposed into any collection of bounded degree hypergraphs with almost as many edges. In fact, our resul…
Low Weight Perfect Matchings
Stefan Ehard, Elena Mohr, Dieter Rautenbach
Answering a question posed by Caro, Hansberg, Lauri, and Zarb, we show that for every positive integer and every function with $σ\left(E(K_{4n})\…
Biholes in balanced bipartite graphs
Stefan Ehard, Elena Mohr, Dieter Rautenbach
A bihole in a bipartite graph with partite sets and is an independent set in with . We prove lower bounds on the largest order of biholes i…
A short proof of the blow-up lemma for approximate decompositions
Stefan Ehard, Felix Joos
Kim, Kühn, Osthus and Tyomkyn (Trans. Amer. Math. Soc. 371 (2019), 4655--4742) greatly extended the well-known blow-up lemma of Komlós, Sárközy and Szemerédi by proving a `blow-up…