Approximate Counting of Matchings in Sparse Uniform Hypergraphs

DOI10.1137/1.9781611973037.9zbMath1430.68450arXiv1204.5335OpenAlexW2949993664MaRDI QIDQ5194740

Andrzej Ruciński, Edyta Szymańska, Marek Karpinski

Publication date: 17 September 2019

Published in: 2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Hypergraphs (05C65) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (1)

Counting hypergraph matchings up to uniqueness threshold

This page was built for publication: Approximate Counting of Matchings in Sparse Uniform Hypergraphs