Ascolese, MichelaMichelaAscoleseLienau, MatthiasMatthiasLienauSchulte, MatthiasMatthiasSchulteTaraz, AnuschAnuschTaraz2025-06-032025-06-032025-04-25Electronic Journal of Combinatorics 32 (2): P2.15 (2025)https://hdl.handle.net/11420/55735The 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.en1097-144020252EMIS ELibEMShttps://creativecommons.org/licenses/by-nd/4.0/Natural Sciences and Mathematics::510: MathematicsComputer Science, Information and General Works::005: Computer Programming, Programs, Data and SecurityJournal Articlehttps://doi.org/10.15480/882.1522610.37236/1274810.15480/882.15226Journal Article