Jędrzej Hodor

collaborators

3 papers

math.CO2026

Cops and robber in graphs with bounded vertex cover number

Prosenjit Bose, Louis Esperet, Jędrzej Hodor +3

Meyniel's conjecture states that $n$ -vertex connected graphs have cop number $O (n)$ . The current best known upper bound is $n / 2^{(1 - o (1)) l o g n}$ , proved independentl…

math.CO2026

Excluding an apex-forest or a fan as quickly as possible

Quentin Claus, Jędrzej Hodor, Gwenaël Joret +1

We show that every graph $G$ excluding an apex-forest $H$ as a minor has layered pathwidth at most $∣ V (H) ∣ - 2$ , and that every graph $G$ excluding an apex-linear forest (such as a f…

math.CO2022

Counting Unions of Schreier Sets

Kevin Beanland, Dmitriy Gorovoy, Jȩdrzej Hodor +1

A subset of positive integers $F$ is a Schreier set if it is non-empty and $∣ F ∣ ⩽ min F$ (here $∣ F ∣$ is the cardinality of $F$ ). For each positive integer $k$ , we define $k…