No article text was recorded for this version.
hypergraph matching complexity
Version 1 of 17 papers16 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Almost Perfect Matchings in k-Partite k-Graphs
- Blog: Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels
- Blog: Vertex degree sums for perfect matchings in 3-uniform hypergraphs
- Blog: A better bound on the size of rainbow matchings
- Blog: Rainbow Perfect Matchings for 4-Uniform Hypergraphs
- Blog: Packing perfect matchings in random hypergraphs
- Blog: Approximate generalized Steiner systems and near-optimal constant weight codes
History & citation
Current · Permanent link
- This direction split from Degree Thresholds for Spanning Structures in Uniform Hypergraphs (71% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_hypergraph_matching_complexity_25b0f01a,
title = {hypergraph matching complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/hypergraph-matching-complexity/rdr_25b0f01ae2284d5a8cfd39a30deb4270},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-19},
}This exact version (version 1, frozen text):
@misc{lacuna_hypergraph_matching_complexity_25b0f01a_v1,
title = {hypergraph matching complexity},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/hypergraph-matching-complexity/rdr_25b0f01ae2284d5a8cfd39a30deb4270/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-19},
}