B. Novick

collaborators

2 papers

math.CO2017

Reconfiguration graphs of shortest paths

John Asplund, Kossi Edoh, Ruth Haas +3

For a graph $G$ and $a, b \in V (G)$ , the shortest path reconfiguration graph of $G$ with respect to $a$ and $b$ is denoted by $S (G, a, b)$ . The vertex set of $S (G, a, b)$ is the set of a…

math.CO2015

What Moser Could Have Asked: Counting Hamilton Cycles in Tournaments

Neil J. Calkin, Beth Novick, Hayato Ushijima-Mwesigwa

Moser asked for a construction of explicit tournaments on $n$ vertices having at least $(\frac{n}{3 e})^{n}$ Hamilton cycles. We show that he could have asked for rather more.