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
• On the mixing time of switch Markov chains
• Computing the Difficulty of Critical Bootstrap Percolation Models is NP-hard
• COVID-19 informant
• Mixing time of the swap Markov chain and P-stability (extended version)
• Mixing time of the swap Markov chain and P-stability
• Efficiently sampling the realizations of bounded, irregular degree sequences of bipartite and directed graphs
• Mobile vs. point guards
• Extremal solutions to some art gallery and terminal-pairability problems
• Oral administration of pyrophosphate inhibits connective tissue calcification
• Terminal-Pairability in Complete Bipartite Graphs with Non-Bipartite Demands
• Terminal-Pairability in Complete Bipartite Graphs
• Note on Terminal-Pairability in Complete Grid Graphs
• Terminal-Pairability in Complete Graphs
• Partitioning orthogonal polygons into at most 8-vertex pieces, with application to an art gallery theorem
• Seating couples and Tic-Tac-Toe
• Combiantorial Nullstellensätze (in Hungarian)