On Perfect Matchings in k-Complexes

DOI10.1093/imrn/rnz343zbMath1473.05242arXiv1911.10986OpenAlexW2999306665MaRDI QIDQ3382619

Jie Han

Publication date: 21 September 2021

Published in: International Mathematics Research Notices (Search for Journal in Brave)

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

zbMATH Keywords

hypergraph matchingsdense simplicial complexes

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Combinatorial aspects of simplicial complexes (05E45)

Related Items (3)

A Stability Result on Matchings in 3-Uniform Hypergraphs ⋮ Rainbow Perfect Matchings for 4-Uniform Hypergraphs ⋮ Rainbow matchings for 3-uniform hypergraphs

This page was built for publication: On Perfect Matchings in k-Complexes