4 papers
Line-of-Sight Pursuit in Monotone and Scallop Polygons
Lindsay Berry, Andrew Beveridge, Jane Butterfield +4
We study a turn-based game in a simply connected polygonal environment between a pursuer and an adversarial evader . Both players can move in a straight line to any poin…
Mantel's Theorem for Random Hypergraphs
József Balogh, Jane Butterfield, Ping Hu +1
A classical result in extremal graph theory is Mantel's Theorem, which states that every maximum triangle-free subgraph of is bipartite. A sparse version of Mantel's Theorem…
Revolutionaries and spies: Spy-good and spy-bad graphs
Jane V. Butterfield, Daniel W. Cranston, Gregory J. Puleo +2
We study a game on a graph played by {\it revolutionaries} and {\it spies}. Initially, revolutionaries and then spies occupy vertices. In each subsequent round, each re…
On the Chromatic Thresholds of Hypergraphs
József Balogh, Jane Butterfield, Ping Hu +2
Let F be a family of r-uniform hypergraphs. The chromatic threshold of F is the infimum of all non-negative reals c such that the subfamily of F comprising hypergraphs H with minim…