Péter L. Erdős

Latest

• Degree-preserving network growth
• The mixing time of switch Markov chains: a unified approach
• Half-graphs, other non-stable degree sequences, and the switch Markov chain
• Rooted NNI moves and distance-1 tail moves on tree-based phylogenetic networks
• Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs
• Terminal-Pairability in Complete Bipartite Graphs with Non-Bipartite Demands
• Terminal-Pairability in Complete Bipartite Graphs