Guillem Perarnau

Publication Activity (10 Years)

Years Active: 2011-2024
Publications (10 Years): 40

Top Topics

Graph Structures

Top Venues

SIAM J. Discret. Math.

Random Struct. Algorithms

Publications

Lyuben Lichev, Dieter Mitsche, Guillem Perarnau
Percolation on dense random graphs with given degrees. J. Comb. Theory B 167 (2024)
Jaroslav Nesetril, Guillem Perarnau, Juanjo Rué, Oriol Serra
Preface. Eur. J. Comb. 121 (2024)
Alberto Larrauri, Guillem Perarnau
First Order Logic of Sparse Graphs with Given Degree Sequences. CoRR (2024)
Guillaume Chapuy, Guillem Perarnau
Short Synchronizing Words for Random Automata. SODA (2023)
Guillaume Chapuy, Guillem Perarnau
Short Synchronizing Words for Random Automata. CoRR (2022)
Nikolaos Fountoulakis, Felix Joos, Guillem Perarnau
Percolation on Random Graphs with a Fixed Degree Sequence. SIAM J. Discret. Math. 36 (1) (2022)
Alberto Espuny Díaz, Patrick Morris, Guillem Perarnau, Oriol Serra
Speeding up random walk mixing by starting from a uniform vertex. CoRR (2022)
Xing Shi Cai, Pietro Caputo, Guillem Perarnau, Matteo Quattropani
Rankings in directed configuration models with heavy tailed in-degrees. CoRR (2021)
Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau
Frozen (Δ + 1)-colourings of bounded degree graphs. Comb. Probab. Comput. 30 (3) (2021)
Guillaume Chapuy, Guillem Perarnau
On the Number of Coloured Triangulations of d-Manifolds. Discret. Comput. Geom. 65 (3) (2021)
Loïc Dubois, Gwenaël Joret, Guillem Perarnau, Marcin Pilipczuk, François Pitois
Two lower bounds for $p$-centered colorings. Discret. Math. Theor. Comput. Sci. 22 (4) (2020)
Michelle Delcourt, Marc Heinrich, Guillem Perarnau
The Glauber dynamics for edge-colorings of trees. Random Struct. Algorithms 57 (4) (2020)
Louigi Addario-Berry, Borja Balle, Guillem Perarnau
Diameter and Stationary Distribution of Random $r$-Out Digraphs. Electron. J. Comb. 27 (3) (2020)
Loïc Dubois, Gwenaël Joret, Guillem Perarnau, Marcin Pilipczuk, François Pitois
Two lower bounds for $p$-centered colorings. CoRR (2020)
Xing Shi Cai, Guillem Perarnau
The giant component of the directed configuration model revisited. CoRR (2020)
Matthew Coulson, Guillem Perarnau
A Rainbow Dirac's Theorem. SIAM J. Discret. Math. 34 (3) (2020)
Matthew Coulson, Peter Keevash, Guillem Perarnau, Liana Yepremyan
Rainbow factors in hypergraphs. J. Comb. Theory, Ser. A 172 (2020)
Xing Shi Cai, Guillem Perarnau
Minimum stationary values of sparse random directed graphs. CoRR (2020)
Xing Shi Cai, Guillem Perarnau
The diameter of the directed configuration model. CoRR (2020)
Allan Lo, Richard Mycroft, Guillem Perarnau, Andrew Treglown
Preface. BCC (2019)
Guillaume Chapuy, Guillem Perarnau
Connectivity in bridge-addable graph classes: The McDiarmid-Steger-Welsh conjecture. J. Comb. Theory, Ser. B 136 (2019)
Matthew Coulson, Guillem Perarnau
Rainbow matchings in Dirac bipartite graphs. Random Struct. Algorithms 55 (2) (2019)
Sitan Chen, Michelle Delcourt, Ankur Moitra, Guillem Perarnau, Luke Postle
Improved Bounds for Randomly Sampling Colorings via Linear Programming. SODA (2019)
Michelle Delcourt, Marc Heinrich, Guillem Perarnau
The Glauber dynamics for edges colourings of trees. CoRR (2018)
Guillem Perarnau, Will Perkins
Counting independent sets in cubic graphs of given girth. J. Comb. Theory, Ser. B 133 (2018)
Sitan Chen, Michelle Delcourt, Ankur Moitra, Guillem Perarnau, Luke Postle
Improved Bounds for Randomly Sampling Colorings via Linear Programming. CoRR (2018)
Michelle Delcourt, Guillem Perarnau, Luke Postle
Rapid mixing of Glauber dynamics for colorings below Vigoda's 11/6 threshold. CoRR (2018)
Marthe Bonamy, Nicolas Bousquet, Guillem Perarnau
Frozen colourings of bounded degree graphs. Electron. Notes Discret. Math. 68 (2018)
Guillem Perarnau, Bruce A. Reed
Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree. Comb. Probab. Comput. 26 (3) (2017)
Pilar Cano, Guillem Perarnau, Oriol Serra
Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree. Electron. Notes Discret. Math. 61 (2017)
Xing Shi Cai, Guillem Perarnau, Bruce A. Reed, Adam Bene Watts
Acyclic edge colourings of graphs with large girth. Random Struct. Algorithms 50 (4) (2017)
Dieter Mitsche, Guillem Perarnau
On Treewidth and Related Parameters of Random Geometric Graphs. SIAM J. Discret. Math. 31 (2) (2017)
Guillaume Chapuy, Guillem Perarnau
Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture. SODA (2016)
Felix Joos, Guillem Perarnau, Dieter Rautenbach, Bruce A. Reed
How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component. FOCS (2016)
Nicolas Bousquet, Guillem Perarnau
Fast recoloring of sparse graphs. Eur. J. Comb. 52 (2016)
Felix Joos, Guillem Perarnau, Dieter Rautenbach, Bruce A. Reed
How to determine if a random graph with a fixed degree sequence has a giant component. CoRR (2016)
Pilar Cano, Guillem Perarnau, Oriol Serra
Rainbow perfect matchings in r-partite graph structures. Electron. Notes Discret. Math. 54 (2016)
Guillem Perarnau, Oriol Serra
Correlation Among Runners and Some Results on the Lonely Runner Conjecture. Electron. J. Comb. 23 (1) (2016)
Guillaume Chapuy, Guillem Perarnau
Local Convergence and Stability of Tight Bridge-Addable Graph Classes. APPROX-RANDOM (2016)
Nikolaos Fountoulakis, Felix Joos, Guillem Perarnau
Percolation on random graphs with a fixed degree sequence. CoRR (2016)
Florent Foucaud, Michael Krivelevich, Guillem Perarnau
Large Subgraphs without Short Cycles. SIAM J. Discret. Math. 29 (1) (2015)
Louigi Addario-Berry, Borja Balle, Guillem Perarnau
Diameter and Stationary Distribution of Random $r$-out Digraphs. CoRR (2015)
Ross J. Kang, Guillem Perarnau
-free subgraphs. Eur. J. Comb. 44 (2015)
Nicolas Bousquet, Guillem Perarnau
Fast Recoloring of Sparse Graphs. CoRR (2014)
Guillem Perarnau, Oriol Serra
On the tree-depth of random graphs. Discret. Appl. Math. 168 (2014)
Josep Díaz, Dieter Mitsche, Guillem Perarnau, Xavier Pérez-Giménez
On the relation between graph distance and Euclidean distance in random geometric graphs. CoRR (2014)
Xing Shi Cai, Guillem Perarnau, Bruce A. Reed, Adam Bene Watts
Acyclic edge colourings of graphs with large girth. CoRR (2014)
Florent Foucaud, Guillem Perarnau, Oriol Serra
Random subgraphs make identification affordable. CoRR (2013)
Guillem Perarnau, Giorgis Petridis
Matchings in Random Biregular Bipartite Graphs. Electron. J. Comb. 20 (1) (2013)
Guillem Perarnau, Oriol Serra
Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting. Comb. Probab. Comput. 22 (5) (2013)
Guillem Perarnau
A probabilistic approach to consecutive pattern avoiding in permutations. J. Comb. Theory, Ser. A 120 (5) (2013)
Florent Foucaud, Guillem Perarnau
Bounds for Identifying Codes in Terms of Degree Parameters. Electron. J. Comb. 19 (1) (2012)
Dieter Mitsche, Guillem Perarnau
On the treewidth and related parameters of random geometric graphs. STACS (2012)
Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau
Locally identifying colourings for graphs with given maximum degree. Discret. Math. 312 (10) (2012)
Guillem Perarnau, Oriol Serra
Rainbow Matchings: existence and counting CoRR (2011)
Florent Foucaud, Guillem Perarnau
Bounds for identifying codes in terms of degree parameters CoRR (2011)
Florent Foucaud, Iiro S. Honkala, Tero Laihonen, Aline Parreau, Guillem Perarnau
Locally identifying colourings for graphs with given maximum degree CoRR (2011)
Guillem Perarnau, Oriol Serra
Rainbow Matchings: existence and counting. Electron. Notes Discret. Math. 38 (2011)
Guillem Perarnau, Oriol Serra
On the tree-depth of Random Graphs CoRR (2011)