4 citations · 9 across the 6 of their papers we have counts for
3 papers · 1 filter
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…
New results on graph matching from degree preserving growth
Péter L. Erdős, Shubha R. Kharel, Tamás Róbert Mezei +1
The recently introduced \emph{Degree Preserving Growth} model (Nature Physics, \DOI{10.1038/s41567-021-01417-7}) uses matchings to insert new vertices of prescribed degrees into th…
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…