3 citations · 8 across the 3 of their papers we have counts for
5 papers · 1 filter
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…
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…
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…
Even cycle creating paths
Daniel Soltész
We say that two graphs on the same vertex set are -creating (-different in other papers, this difference is explained in the introduction) if the union of the two g…
Independent sets in the union of two Hamiltonian cycles
Ron Aharoni, Daniel Soltész
Motivated by a question on the maximal number of vertex disjoint Schrijver graphs in the Kneser graph, we investigate the following function, denoted by : the maximal numbe…