J. Fink

collaborators

4 papers

math.CO2026

The realization graph of every degree sequence has a Hamilton path

Petr HladÃk, JiÅÃ Fink

Given a degree sequence $d$ , the realization graph $G_{F} (d)$ is the graph whose vertices are all labeled realizations of $d$ , where two realizations are adjacent if they d…

cs.DS2026

Faster and simpler traversal of 0/1-polytopes

JiÅÃ Fink, Petr HladÃk, Arturo Merino +2

Recently, Merino and MÃ¼tze (FOCS'23+SICOMP'24) presented an algorithm for computing a Hamilton path on the skeleton of any 0/1-polytope $conv (X)$ , where $X\subseteq\{0,1\}^n…

math.CO2025

Matchings in hypercubes extend to long cycles

JiÅÃ Fink, Torsten MÃ¼tze

The $d$ -dimensional hypercube graph $Q_{d}$ has as vertices all subsets of ${1, \dots, d}$ , and an edge between any two sets that differ in a single element. The Ruskey-Savage conje…

math.CO2025

Minimum maximal matchings in permutahedra

Sofia Brenner, JiÅÃ Fink, Hung. P. Hoang +2

We prove that the minimal size $M (I ¨ _{n})$ of a maximal matching in the permutahedron $I ¨ _{n}$ is asymptotically $n! /3$ . On the one hand, we obtain a lower bound $M(Ï_n) \ge n! (n-1)…