G. Perarnau

activity

20112026

most citedLarge subgraphs without short cycles

22 citations · 112 across the 37 of their papers we have counts for

collaborators

Showing 2017 · math.COShow all

2 papers · 2 filters

math.CO2017

Rainbow matchings in Dirac bipartite graphs

Matthew Coulson, Guillem Perarnau

We show the existence of rainbow perfect matchings in $μ n$ -bounded edge colourings of Dirac bipartite graphs, for a sufficiently small $μ > 0$ . As an application of our results, we o…

math.CO2017

Critical percolation on random regular graphs

Felix Joos, Guillem Perarnau

We show that for all $d \in {3, \dots, n - 1}$ the size of the largest component of a random $d$ -regular graph on $n$ vertices around the percolation threshold $p = 1/ (d - 1)$ is $Θ(n^{2…