36 citations · 216 across the 28 of their papers we have counts for
24 papers · 1 filter
Fully graphic degree sequences and P-stable degree sequences
Péter L. Erdős, István Miklós, Lajos Soukup
The notion of -stability of an infinite set of degree sequences plays influential role in approximating the permanents, rapidly sampling the realizations of graphic degree seque…
On the Small Quasi-kernel conjecture
Péter L. Erdős, Ervin Győri, Tamás Róbert Mezei +2
An independent vertex subset of the directed graph is a kernel if the set of out-neighbors of is . An independent vertex subset of is a quasi-k…
The sequence of prime gaps is graphic
Péter L. Erdős, Gergely Harcos, Shubha R. Kharel +3
Let us call a simple graph on vertices a prime gap graph if its vertex degrees are and the first prime gaps. We show that such a graph exists for every large $n…
Degree-preserving graph dynamics -- a versatile process to construct random networks
Péter L. Erdős, Shubha R. Kharel, Tamás R. Mezei +1
Real-world networks evolve over time via additions or removals of vertices and edges. In current network evolution models, vertex degree varies or grows arbitrarily. A recently int…
Defining phylogenetic networks using ancestral profiles
Allan Bai, Peter Erdos, Charles Semple +1
Rooted phylogenetic networks provide a more complete representation of the ancestral relationship between species than phylogenetic trees when reticulate evolutionary processes are…
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…