Rainbow factors in hypergraphs.
J. Comb. Theory, Ser. A, 2020
Minimum stationary values of sparse random directed graphs.
Two lower bounds for $p$-centered colorings.
The giant component of the directed configuration model revisited.
The diameter of the directed configuration model.
Diameter and Stationary Distribution of Random $r$-Out Digraphs.
Electron. J. Comb., 2020
Rainbow matchings in Dirac bipartite graphs.
Random Struct. Algorithms, 2019
Connectivity in bridge-addable graph classes: The McDiarmid-Steger-Welsh conjecture.
J. Comb. Theory, Ser. B, 2019
Improved Bounds for Randomly Sampling Colorings via Linear Programming.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019
Counting independent sets in cubic graphs of given girth.
J. Comb. Theory, Ser. B, 2018
Frozen colourings of bounded degree graphs.
Electron. Notes Discret. Math., 2018
The Glauber dynamics for edges colourings of trees.
Rapid mixing of Glauber dynamics for colorings below Vigoda's 11/6 threshold.
On Treewidth and Related Parameters of Random Geometric Graphs.
SIAM J. Discret. Math., 2017
Acyclic edge colourings of graphs with large girth.
Random Struct. Algorithms, 2017
Rainbow spanning subgraphs in bounded edge-colourings of graphs with large minimum degree.
Electron. Notes Discret. Math., 2017
Existence of Spanning ℱ-Free Subgraphs with Large Minimum Degree.
Comb. Probab. Comput., 2017
Rainbow perfect matchings in r-partite graph structures.
Electron. Notes Discret. Math., 2016
Fast recoloring of sparse graphs.
Eur. J. Comb., 2016
Percolation on random graphs with a fixed degree sequence.
Correlation Among Runners and Some Results on the Lonely Runner Conjecture.
Electron. J. Comb., 2016
How to Determine if a Random Graph with a Fixed Degree Sequence Has a Giant Component.
Proceedings of the IEEE 57th Annual Symposium on Foundations of Computer Science, 2016
Local Convergence and Stability of Tight Bridge-Addable Graph Classes.
Proceedings of the Approximation, 2016
Large Subgraphs without Short Cycles.
SIAM J. Discret. Math., 2015
Decomposition of bounded degree graphs into C<sub>4</sub>-free subgraphs.
Eur. J. Comb., 2015
On the tree-depth of random graphs.
Discret. Appl. Math., 2014
On the relation between graph distance and Euclidean distance in random geometric graphs.
A probabilistic approach to consecutive pattern avoiding in permutations.
J. Comb. Theory, Ser. A, 2013
Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting.
Comb. Probab. Comput., 2013
Random subgraphs make identification affordable.
Matchings in Random Biregular Bipartite Graphs.
Electron. J. Comb., 2013
Locally identifying colourings for graphs with given maximum degree.
Discret. Math., 2012
Bounds for Identifying Codes in Terms of Degree Parameters.
Electron. J. Comb., 2012
Rainbow Matchings: existence and counting.
Electron. Notes Discret. Math., 2011