New bounds on the size of nearly perfect matchings in almost regular hypergraphs

DOI10.1112/jlms.12792zbMath1529.05016arXiv2010.04183OpenAlexW3092384090MaRDI QIDQ6139785

Abhishek Methuku, Daniela Kühn, Dong Yeap Kang, Deryk Osthus

Publication date: 19 December 2023

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

chromatic indexSteiner triple systemsperfect matchingalmost regular hypergraphs

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Hypergraphs (05C65) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Nearly-perfect hypergraph packing is in NC
• Hanani triple systems
• Asymptotic behavior of the chromatic index for hypergraphs
• On a packing and covering problem
• Near perfect coverings in graphs and hypergraphs
• More-than-nearly-perfect packings and partial designs
• An existence theory for pairwise balanced designs. III: Proof of the existence conjectures
• Transversals of latin squares and their generalizations
• A note on partial parallel classes in Steiner systems
• On the difference between asymptotically good packings and coverings
• Nearly perfect matchings in regular simple hypergraphs
• Asymptotically good list-colorings
• Asymptotically optimal covering designs
• On a hypergraph matching problem
• An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
• An existence theory for pairwise balanced designs. II: Structure of PBD- closed sets and the existence conjectures
• On the chromatic number of Latin square graphs
• On the Size of a Maximum Transversal in a Steiner Triple System
• New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help
• Near-optimal list colorings
• Long gaps between primes
• Steiner Triple Systems with High Chromatic Index
• Asymptotic packing via a branching process
• [https://portal.mardi4nfdi.de/wiki/Publication:4870539 A linear programming perspective on the Frankl?R�dl?Pippenger theorem]
• Pseudorandom hypergraph matchings
• New bounds for Ryser’s conjecture and related problems
• The Chromatic Index of Projective Triple Systems
• The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New bounds on the size of nearly perfect matchings in almost regular hypergraphs