Guillem Perarnau

J. Comb. Theory B, 2024

Preface.

[BibT_eX]

[DOI]

Eur. J. Comb., 2024

First Order Logic of Sparse Graphs with Given Degree Sequences.

[BibT_eX]

[DOI]

Alberto Larrauri

CoRR, 2024

2023

Short Synchronizing Words for Random Automata.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Percolation on Random Graphs with a Fixed Degree Sequence.

[BibT_eX]

[DOI]

Nikolaos Fountoulakis

Felix Joos

SIAM J. Discret. Math., 2022

Speeding up random walk mixing by starting from a uniform vertex.

[BibT_eX]

[DOI]

CoRR, 2022

2021

On the Number of Coloured Triangulations of d-Manifolds.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2021

Frozen (Δ + 1)-colourings of bounded degree graphs.

[BibT_eX]

[DOI]

Marthe Bonamy

Nicolas Bousquet

Comb. Probab. Comput., 2021

Rankings in directed configuration models with heavy tailed in-degrees.

[BibT_eX]

[DOI]

CoRR, 2021

2020

A Rainbow Dirac's Theorem.

[BibT_eX]

[DOI]

Matthew Coulson

SIAM J. Discret. Math., 2020

The Glauber dynamics for edge-colorings of trees.

[BibT_eX]

[DOI]

Michelle Delcourt

Marc Heinrich

Random Struct. Algorithms, 2020

Rainbow factors in hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2020

Two lower bounds for $p$-centered colorings.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2020

Minimum stationary values of sparse random directed graphs.

[BibT_eX]

[DOI]

Xing Shi Cai

CoRR, 2020

The giant component of the directed configuration model revisited.

[BibT_eX]

[DOI]

Xing Shi Cai

CoRR, 2020

The diameter of the directed configuration model.

[BibT_eX]

[DOI]

Xing Shi Cai

CoRR, 2020

Diameter and Stationary Distribution of Random $r$-Out Digraphs.

[BibT_eX]

[DOI]

Louigi Addario-Berry

Borja Balle

Electron. J. Comb., 2020

2019

Rainbow matchings in Dirac bipartite graphs.

[BibT_eX]

[DOI]

Matthew Coulson

Random Struct. Algorithms, 2019

Connectivity in bridge-addable graph classes: The McDiarmid-Steger-Welsh conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Improved Bounds for Randomly Sampling Colorings via Linear Programming.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

Preface.

[BibT_eX]

[DOI]

Proceedings of the Surveys in Combinatorics, 2019: Invited lectures from the 27th British Combinatorial Conference, Birmingham, UK, July 29, 2019

2018

Counting independent sets in cubic graphs of given girth.

[BibT_eX]

[DOI]

Will Perkins

J. Comb. Theory B, 2018

Frozen colourings of bounded degree graphs.

[BibT_eX]

[DOI]

Marthe Bonamy

Nicolas Bousquet

Electron. Notes Discret. Math., 2018

The Glauber dynamics for edges colourings of trees.

[BibT_eX]

[DOI]

Michelle Delcourt

Marc Heinrich

CoRR, 2018

Rapid mixing of Glauber dynamics for colorings below Vigoda's 11/6 threshold.

[BibT_eX]

[DOI]

Michelle Delcourt

Luke Postle

CoRR, 2018

2017

On Treewidth and Related Parameters of Random Geometric Graphs.

[BibT_eX]

[DOI]

Dieter Mitsche

SIAM J. Discret. Math., 2017

Acyclic edge colourings of graphs with large girth.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2017

Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree.

[BibT_eX]

[DOI]

Pilar Cano

Electron. Notes Discret. Math., 2017

Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree.

[BibT_eX]

[DOI]

Bruce A. Reed

Comb. Probab. Comput., 2017

2016

Rainbow perfect matchings in r-partite graph structures.

[BibT_eX]

[DOI]

Pilar Cano

Electron. Notes Discret. Math., 2016

Fast recoloring of sparse graphs.

[BibT_eX]

[DOI]

Nicolas Bousquet

Eur. J. Comb., 2016

Correlation Among Runners and Some Results on the Lonely Runner Conjecture.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component.

[BibT_eX]

[DOI]

Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016

Local Convergence and Stability of Tight Bridge-Addable Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2016

2015

Large Subgraphs without Short Cycles.

[BibT_eX]

[DOI]

Florent Foucaud

Michael Krivelevich

SIAM J. Discret. Math., 2015

Decomposition of bounded degree graphs into C<sub>4</sub>-free subgraphs.

[BibT_eX]

[DOI]

Ross J. Kang

Eur. J. Comb., 2015

2014

On the tree-depth of random graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

On the relation between graph distance and Euclidean distance in random geometric graphs.

[BibT_eX]

[DOI]

CoRR, 2014

2013

A probabilistic approach to consecutive pattern avoiding in permutations.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2013

Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2013

Random subgraphs make identification affordable.

[BibT_eX]

[DOI]

Florent Foucaud

CoRR, 2013

Matchings in Random Biregular Bipartite Graphs.

[BibT_eX]

[DOI]

Giorgis Petridis

Electron. J. Comb., 2013

2012

Locally identifying colourings for graphs with given maximum degree.

[BibT_eX]

[DOI]

Discret. Math., 2012

Bounds for Identifying Codes in Terms of Degree Parameters.

[BibT_eX]

[DOI]

Florent Foucaud

Electron. J. Comb., 2012

2011

Rainbow Matchings: existence and counting.

[BibT_eX]

[DOI]