Random matchings in linear hypergraphs

DOI10.1017/FMS.2026.10253MaRDI QIDQ7307885zbMATH OpenFDO

Authors Hyun Woo Lee

Publication date 3 August 2026

Published in Forum of Mathematics, Sigma (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/FMS.2026.10253

Mathematics Subject Classification ID

Hypergraphs (05C65) Transversal (matching) theory (05D15) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites work

• A proof of the Erdős-Faber-Lovász conjecture
• Asymptotic behavior of the chromatic index for hypergraphs
• scientific article; zbMATH DE number 981679 (Why is no real title available?)
• scientific article; zbMATH DE number 850071 (Why is no real title available?)
• scientific article; zbMATH DE number 3221072 (Why is no real title available?)
• scientific article; zbMATH DE number 3266380 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• Matchings and walks in graphs
• On the adjacency spectra of hypertrees
• Random matchings in regular graphs
• The \(n\)-queens completion problem
• The matching polynomials and spectral radii of uniform supertrees
• The spectra of uniform hypertrees
• Triangle packings and 1-factors in oriented graphs

This page was built for publication: Random matchings in linear hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7307885)