44 citations · 327 across the 39 of their papers we have counts for
4 papers · 2 filters
Proof of a local antimagic conjecture
John Haslegrave
An antimagic labelling of a graph is a bijection such that the sums distinguish all vertices. A well-known conjecture of Ha…
Locating a robber with multiple probes
John Haslegrave, Richard A. B. Johnson, Sebastian Koch
We consider a game in which a cop searches for a moving robber on a connected graph using distance probes, which is a slight variation on one introduced by Seager. Carragher, Choi,…
An evasion game on a graph
John Haslegrave
This paper introduced a pursuit and evasion game to be played on a connected graph. One player moves invisibly around the graph, and the other player must guess his position. At ea…
Judicious partitions of uniform hypergraphs
John Haslegrave
The vertices of any graph with edges may be partitioned into two parts so that each part meets at least edges. Bollobás and Thomason conjectured that the vertice…