6 citations · 6 across the 2 of their papers we have counts for
5 papers
A study of cops and robbers in oriented graphs
Devvrit Khatri, Natasha Komarov, Aaron Krim-Yee +4
We consider the well-studied cops and robbers game in the context of oriented graphs, which has received surprisingly little attention to date. We examine the relationship between…
On the number of 5-cycles in a tournament
Natasha Komarov, John Mackey
We find an exact formula for the number of directed 5-cycles in a tournament in terms of its edge score sequence. We use this formula to find both upper and lower bounds on the num…
Containment: A Variation of Cops and Robbers
Danny Crytser, Natasha Komarov, John Mackey
We consider "Containment": a variation of the graph pursuit game of Cops and Robber in which cops move from edge to adjacent edge, the robber moves from vertex to adjacent vertex (…
Cops vs. Gambler
Natasha Komarov, Peter Winkler
We consider a variation of cop vs.\ robber on graph in which the robber is not restricted by the graph edges; instead, he picks a time-independent probability distribution on $V(G)…
Capturing the Drunk Robber on a Graph
Natasha Komarov, Peter Winkler
We show that the expected time for a smart "cop" to catch a drunk "robber" on an -vertex graph is at most . More precisely, let be a simple, connected, undir…