Minimalist designs

Ben Barber, Stefan Glock, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus

Research output: Contribution to journalArticlepeer-review

37 Downloads (Pure)

Abstract

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 combinatorial designs, and some generalizations, was obtained. Here, we illustrate the method by investigating triangle decompositions: we give a simple proof that a triangle-divisible graph of large minimum degree has a triangle decomposition and prove a similar result for quasi-random host graphs.
Original languageUndefined
JournalRandom Structures & Algorithms
Publication statusPublished - 21 Aug 2018

Keywords

  • math.CO

Cite this