[Paper Review] The existence of designs via iterative absorption

Stefan Glock, Daniela Kühn+2 more|arXiv (Cornell University)|Nov 21, 2016

Limits and Structures in Graph Theory39 references57 citations

TL;DR

This paper presents a new proof of the Existence Conjecture for combinatorial designs using iterative absorption, a novel method that enables flexible $K^{(r)}_{q}$-decompositions in hypergraphs under uniformity conditions. The approach strengthens Keevash's original result and yields new resilience and minimum degree versions of design theorems.

ABSTRACT

In a recent breakthrough, Keevash proved the Existence conjecture for combinatorial designs, which has its roots in the 19th century. We give a new proof, based on the method of iterative absorption. Our main result concerns $K^{(r)}_{q}$-decompositions of hypergraphs whose clique distribution fulfils certain uniformity criteria. These criteria offer considerable flexibility. This enables us to strengthen the results of Keevash as well as to derive a number of new results, for example a resilience version and minimum degree version.

Motivation & Objective

• To provide a new, self-contained proof of the Existence Conjecture for combinatorial designs using iterative absorption.
• To generalize Keevash's result by relaxing structural constraints through uniformity criteria on clique distributions.
• To establish resilience and minimum degree versions of design theorems for hypergraphs.
• To demonstrate the flexibility and robustness of the iterative absorption framework in hypergraph decomposition problems.

Proposed method

• The method of iterative absorption is applied to construct $K^{(r)}_{q}$-decompositions in hypergraphs with uniformly distributed cliques.
• Uniformity criteria on clique distributions are introduced to ensure structural flexibility and control over local configurations.
• The iterative absorption process systematically builds decompositions by absorbing small, controlled substructures while preserving global design properties.
• The framework allows for resilience analysis by maintaining decomposition feasibility under edge deletions.
• Minimum degree conditions are incorporated by ensuring sufficient local density to support absorption at each stage.
• The approach combines probabilistic and combinatorial techniques to maintain control over global and local hypergraph structure.

Experimental results

Research questions

• RQ1 Can the Existence Conjecture for combinatorial designs be reproven using a novel method that offers greater structural flexibility?
• RQ2 To what extent can the clique distribution uniformity criteria relax constraints in hypergraph decomposition?
• RQ3 Can resilience versions of design theorems be derived using iterative absorption?
• RQ4 What minimum degree thresholds guarantee the existence of $K^{(r)}_{q}$-decompositions under the new framework?

Key findings

• A new proof of the Existence Conjecture for combinatorial designs is established via iterative absorption, offering an alternative to Keevash's original proof.
• The method allows for $K^{(r)}_{q}$-decompositions in hypergraphs whose clique distributions satisfy uniformity criteria, significantly broadening applicability.
• Resilience versions of design theorems are derived, showing that decompositions persist under bounded edge deletions when uniformity conditions hold.
• Minimum degree versions are obtained, proving that sufficiently high minimum degree ensures $K^{(r)}_{q}$-decompositions under the same criteria.
• The framework demonstrates that iterative absorption can handle complex hypergraph decomposition problems with high structural control and flexibility.