J. Goldwasser

activity

20122024

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

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

collaborators

Showing 2020Show all

3 papers · 1 filter

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.CO2020

The Polychromatic Number of Small Subsets of the Integers Modulo $n$

Emelie Curl, John Goldwasser, Joe Sampson +1

If $S$ is a subset of an abelian group $G$ , the polychromatic number of $S$ in $G$ is the largest integer $k$ so that there is a $k -$ coloring of the elements of $G$ such that every…

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

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

The Polychromatic Number of Small Subsets of the Integers Modulo n

The Polychromatic Number of Small Subsets of the Integers Modulo $n$