3 citations · 8 across the 3 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
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…
math.CO2019★ 2 cited
New bounds on even cycle creating Hamiltonian paths using expander graphs
Gergely Harcos, Daniel Soltész
We say that two graphs on the same vertex set are -creating if their union (the union of their edges) contains as a subgraph. Let be the maximum number of pairwise…
math.CO2019★ 3 cited
Questions on the Structure of Perfect Matchings inspired by Quantum Physics
Mario Krenn, Xuemei Gu, Daniel Soltész
We state a number of related questions on the structure of perfect matchings. Those questions are inspired by and directly connected to Quantum Physics. In particular, they concern…