19 citations · 21 across the 5 of their papers we have counts for
6 papers
Dense, irregular, yet always graphic -uniform hypergraph degree sequences
Runze Li, Istvan Miklos
A -uniform hypergraph is a generalization of simple graphs where each hyperedge is a subset of vertices of size . The degree of a vertex in a hypergraph is the number of hype…
Constructing and sampling partite, -uniform hypergraphs with given degree sequence
Andras Hubai, Tamas Robert Mezei, Ferenc Beres +2
Partite, -uniform hypergraphs are -uniform hypergraphs in which each hyperedge contains exactly one point from each of the disjoint vertex classes. We consider the degree…
Approximate Sampling of Graphs with Near--stable Degree Intervals
Péter L. Erdős, Tamás Róbert Mezei, István Miklós
The approximate uniform sampling of graph realizations with a given degree sequence is an everyday task in several social science, computer science, engineering etc. projects. One…
Constructing bounded degree graphs with prescribed degree and neighbor degree sequences
Uroš Čibej, Aaron Li, István Miklós +2
Let and be two sequences of positive integers. We consider the following decision problems: is there a multigraph, …
The mixing time of the switch Markov chains: a unified approach
Péter L. Erdős, Catherine Greenhill, Tamás Róbert Mezei +3
Since 1997 a considerable effort has been spent to study the mixing time of switch Markov chains on the realizations of graphic degree sequences of simple graphs. Several results w…
Packing tree degree sequences
Kristóf Bérczi, Zoltán Király, Changshuo Liu +1
We consider special cases of the two tree degree sequences problem. We show that if two tree degree sequences do not have common leaves then they always have edge-disjoint caterpil…