J. Nummenpalo

activity

20152019

most citedSparse Kneser graphs are Hamiltonian

10 citations · 10 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2017★ 10 cited

Sparse Kneser graphs are Hamiltonian

Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak

For integers $k \geq 1$ and $n \geq 2 k + 1$ , the Kneser graph $K (n, k)$ is the graph whose vertices are the $k$ -element subsets of ${1, \dots, n}$ and whose edges connect pairs of subs…

math.CO2017

A short proof of the middle levels theorem

Petr Gregor, Torsten Mütze, Jerri Nummenpalo

Consider the graph that has as vertices all bitstrings of length $2 n + 1$ with exactly $n$ or $n + 1$ entries equal to 1, and an edge between any two bitstrings that differ in exactly…