Pat Devlin

activity

20112021

most citedSets with High Volume and Low Perimeter

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

collaborators

Showing 2019 · math.COShow all

2 papers · 2 filters

math.CO2019

Perfect matchings and derangements on graphs

Matija Bucic, Pat Devlin, Mo Hendon +2

We show that each perfect matching in a bipartite graph $G$ intersects at least half of the perfect matchings in $G$ . This result has equivalent formulations in terms of the perman…

math.CO2019

Connected-Intersecting Families of Graphs

Aaron Berger, Ross Berkowitz, Pat Devlin +4

For a graph property $P$ and a common vertex set $V = {1, 2, \dots, n}$ , a family of graphs on $V$ is \emph{ $P$ -intersecting} iff $G \cap H$ satisfies $\math…