Isaak H. Wolf

activity

20212025

most citedPairwise disjoint perfect matchings in

r

-edge-connected

r

-regular graphs

5 citations · 9 across the 11 of their papers we have counts for

collaborators

Showing 2023Show all

3 papers · 1 filter

math.CO2023

Fractional factors and component factors in graphs with isolated toughness smaller than 1

Isaak H. Wolf

Let $G$ be a simple graph and let $n, m$ be two integers with $0 < m < n$ . We prove that $i so (G - S) \leq \frac{n}{m} ∣ S ∣$ for every $S \subset V (G)$ if and only if $G$ has a $\{C_{2i+1},T…

math.CO2023

Sets of $r$ -graphs that color all $r$ -graphs

Yulai Ma, Davide Mattiolo, Eckhard Steffen +1

An $r$ -regular graph is an $r$ -graph, if every odd set of vertices is connected to its complement by at least $r$ edges. Let $G$ and $H$ be $r$ -graphs. An $H$ -coloring of $G$ is a…

math.CO2023

Rotation $r$ -graphs

Eckhard Steffen, Isaak H. Wolf

We study rotation $r$ -graphs and show that for every $r$ -graph $G$ of odd regularity there is a simple rotation $r$ -graph $G^{'}$ such that $G$ can be obtained form $G^{'}$ by a finite n…

Fractional factors and component factors in graphs with isolated toughness smaller than 1

Sets of r-graphs that color all r-graphs

Rotation r-graphs

Sets of $r$ -graphs that color all $r$ -graphs

Rotation $r$ -graphs