A blow-up lemma for approximate decompositions
DOI10.1090/tran/7411zbMath1409.05114arXiv1604.07282WikidataQ124982694 ScholiaQ124982694MaRDI QIDQ4633567
Daniela Kühn, Deryk Osthus, Mykhaylo Tyomkyn, Jae-Hoon Kim
Publication date: 3 May 2019
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.07282
05C35: Extremal problems in graph theory
05C80: Random graphs (graph-theoretic aspects)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05B40: Combinatorial aspects of packing and covering
05D40: Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.)
05C42: Density (toughness, etc.)
