Tom Johnston

activity

20182025

most citedExact hyperplane covers for subsets of the hypercube

5 citations · 24 across the 18 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

math.CO2021★ 1 cited

The lengths for which bicrucial square-free permutations exist

Carla Groenland, Tom Johnston

A square is a factor $S = (S_{1}; S_{2})$ where $S_{1}$ and $S_{2}$ have the same pattern, and a permutation is said to be square-free if it contains no non-trivial squares. The permutatio…

math.CO2021

Reconstruction from smaller cards

Carla Groenland, Tom Johnston, Alex Scott +1

The $ℓ$ -deck of a graph $G$ is the multiset of all induced subgraphs of $G$ on $ℓ$ vertices. We say that a graph is reconstructible from its $ℓ$ -deck if no other graph has…

math.CO2021

Reconstructing the degree sequence of a sparse graph from a partial deck

Carla Groenland, Tom Johnston, Andrey Kupavskii +3

The deck of a graph $G$ is the multiset of cards ${G - v : v \in V (G)}$ . Myrvold (1992) showed that the degree sequence of a graph on $n \geq 7$ vertices can be reconstructed from any d…