Randomized Algorithms to Generate Hypergraphs with Given Degree Sequences
The question whether there exists a hypergraph whose degrees are equal to a given sequence of integers is a well-known reconstruction problem in graph theory, which is motivated by discrete tomography. In this paper we approach the problem by randomized algorithms which generate the required hypergraph with positive probability if the sequence satisfies certain constraints.
Authors
- Anusch Taraz (ORCID: https://orcid.org/0000-0003-3646-3683)
- Matthias Schulte (ORCID: https://orcid.org/0000-0002-0107-2044)
- Michela Ascolese (ORCID: https://orcid.org/0000-0003-4173-8610)
- Matthias Lienau (ORCID: https://orcid.org/0009-0000-7269-3342)
Institutions
- Universität Hamburg (DE)
- University of Florence (IT)
- Hamburg University of Technology (DE)
Publication Details
- Journal
- The Electronic Journal of Combinatorics
- Published
- 2025-04-24
- DOI
- https://doi.org/10.37236/12748
- Primary Topic
- Rough Sets and Fuzzy Logic
- Type
- article
- Field-Weighted Citation Impact
- 0.00