Randomized algorithms to generate hypergraphs with given degree sequences

Publikationstyp
Journal Article
Date Issued
2025-04-25
Sprache
English
Author(s)
Ascolese, Michela 
Lienau, Matthias  
Mathematik E-10  
Schulte, Matthias  
Mathematik E-10  
Taraz, Anusch  
Mathematik E-10  
TORE-DOI
10.15480/882.15226
TORE-URI
https://hdl.handle.net/11420/55735
Journal
The electronic journal of combinatorics  
Volume
32
Issue
2
Article Number
P2.15
Citation
Electronic Journal of Combinatorics 32 (2): P2.15 (2025)
Publisher DOI
10.37236/12748
Scopus ID
2-s2.0-105004736585
Publisher
EMIS ELibEMS
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.
DDC Class
510: Mathematics
005: Computer Programming, Programs, Data and Security
Publication version
publishedVersion
Lizenz
https://creativecommons.org/licenses/by-nd/4.0/
Loading...
Thumbnail Image
Name

12748-PDF file-54486-1-10-20250417.pdf

Type

Main Article

Size

474.33 KB

Format

Adobe PDF