Minimalist designs

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

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


The iterative absorption method has recently led to major progress in the area of (hyper-)graph decompositions. Among 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 languageEnglish
Pages (from-to)47-63
Number of pages17
JournalRandom Structures and Algorithms
Issue number1
Publication statusPublished - 1 Aug 2020

Bibliographical note

Publisher Copyright:
© 2020 Wiley Periodicals, Inc.


  • design theory
  • extremal graph theory
  • iterative absorption
  • triangle decomposition

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Computer Graphics and Computer-Aided Design
  • Applied Mathematics


Dive into the research topics of 'Minimalist designs'. Together they form a unique fingerprint.

Cite this