Patrick Bennett

activity

20122017

most citedAdding random edges to create the square of a Hamilton cycle

12 citations · 12 across the 2 of their papers we have counts for

collaborators

Showing 2016Show all

2 papers · 1 filter

math.CO2016

On the number of alternating paths in bipartite complete graphs

Patrick Bennett, Andrzej Dudek, Elliot Laforge

Let $C \subseteq [r]^{m}$ be a code such that any two words of $C$ have Hamming distance at least $t$ . It is not difficult to see that determining a code $C$ with the maximum number…

math.CO2016

Rainbow perfect matchings and Hamilton cycles in the random geometric graph

Deepak Bal, Patrick Bennett, Xavier Pérez-Giménez +1

Given a graph on $n$ vertices and an assignment of colours to the edges, a rainbow Hamilton cycle is a cycle of length $n$ visiting each vertex once and with pairwise different col…