Ryan Hansen

activity

20162022

most citedPolychromatic colorings of complete graphs with respect to 1-,2-factors and Hamiltonian cycles

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

collaborators

4 papers

math.CO2022

Inducibility in the hypercube

John Goldwasser, Ryan Hansen

Let $Q_{d}$ be the hypercube of dimension $d$ and let $H$ and $K$ be subsets of the vertex set $V (Q_{d})$ , called configurations in $Q_{d}$ . We say that $K$ is an \emph{exact copy} of $H…

math.CO2020

Maximum density of vertex-induced perfect cycles and paths in the hypercube

John Goldwasser, Ryan Hansen

Let $H$ and $K$ be subsets of the vertex set $V (Q_{d})$ of the $d$ -cube $Q_{d}$ (we call $H$ and $K$ configurations in $Q_{d}$ ). We say $K$ is an \emph{exact copy} of $H$ if there is an…

math.CO2020

Polychromatic colorings of 1-regular and 2-regular subgraphs of complete graphs

John Goldwasser, Ryan Hansen

If $G$ is a graph and $H$ is a set of subgraphs of $G$ , we say that an edge-coloring of $G$ is $H$ -polychromatic if every graph from $H$ gets all colo…

math.CO2016★ 5 cited

Polychromatic colorings of complete graphs with respect to 1-,2-factors and Hamiltonian cycles

Maria Axenovich, John Goldwasser, Ryan Hansen +5

If G is a graph and H is a set of subgraphs of G, then an edge-coloring of G is called H-polychromatic if every graph from H gets all colors present in G on its edges. The H-polych…