HYPERGRAPH MATCHINGS AND DESIGNS

DOI10.1142/9789813272880_0174zbMath1451.05160arXiv1807.05752OpenAlexW2972677125MaRDI QIDQ5122149

Peter Keevash

Publication date: 22 September 2020

Published in: Proceedings of the International Congress of Mathematicians (ICM 2018) (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1807.05752

zbMATH Keywords

hypergraphmatchingsdesigns

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Density (toughness, etc.) (05C42)

Related Items (6)

Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ Large deviations in random latin squares ⋮ Graph and hypergraph packing ⋮ Co-degrees resilience for perfect matchings in random hypergraphs ⋮ Pseudorandom hypergraph matchings

This page was built for publication: HYPERGRAPH MATCHINGS AND DESIGNS