39 citations · 93 across the 25 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.CO2019
Connected Hypergraphs without long Berge paths
Ervin Győri, Nika Salia, Oscar Zamora
We generalize a result of Balister, Gy{ő}ri, Lehel and Schelp for hypergraphs. We determine the unique extremal structure of an -vertex, -uniform, connected, hypergraph with…
math.CO2019★ 3 cited
Half-graphs, other non-stable degree sequences, and the switch Markov chain
Péter L. Erdős, Ervin Győri, Tamás Róbert Mezei +2
One of the simplest methods of generating a random graph with a given degree sequence is provided by the Monte Carlo Markov Chain method using switches. The switch Markov chain con…