Ian M. Wanless

activity

20032026

most citedAcyclic Digraphs and Eigenvalues of (0,1)-Matrices

22 citations · 214 across the 59 of their papers we have counts for

collaborators

Showing 2018Show all

3 papers · 1 filter

math.CO2018★ 4 cited

Covering radius in the Hamming permutation space

Kevin Hendrey, Ian M. Wanless

Let $S_{n}$ denote the set of permutations of ${1, 2, \dots, n}$ . The function $f (n, s)$ is defined to be the minimum size of a subset $S \subseteq S_{n}$ with the pro…

math.CO2018★ 2 cited

Induced path factors of regular graphs

Saieed Akbari, Daniel Horsley, Ian M. Wanless

An induced path factor of a graph $G$ is a set of induced paths in $G$ with the property that every vertex of $G$ is in exactly one of the paths. The induced path number $ρ (G)$ of…

math.CO2018★ 4 cited

What did Ryser Conjecture?

Darcy Best, Ian M. Wanless

Two prominent conjectures by Herbert J. Ryser have been falsely attributed to a somewhat obscure conference proceedings that he wrote in German. Here we provide a translation of th…