10 citations · 10 across the 3 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
math.CO2017★ 10 cited
Sparse Kneser graphs are Hamiltonian
Torsten Mütze, Jerri Nummenpalo, Bartosz Walczak
For integers and , the Kneser graph is the graph whose vertices are the -element subsets of 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 with exactly or entries equal to 1, and an edge between any two bitstrings that differ in exactly…
cs.DM2017
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems
Jean Cardinal, Jerri Nummenpalo, Emo Welzl
We investigate parameterizing hard combinatorial problems by the size of the solution set compared to all solution candidates. Our main result is a uniform sampling algorithm for s…