ORCID as entered in ROS

Select Publications
2018, Lower bounds on the chromatic number of random graphs, http://arxiv.org/abs/1812.09691v4
,2018, Counting independent sets in graphs with bounded bipartite pathwidth, http://arxiv.org/abs/1812.03195v4
,2018, Rigid colourings of hypergraphs and contiguity, http://arxiv.org/abs/1808.04060v2
,2018, Uniform generation of spanning regular subgraphs of a dense graph, http://arxiv.org/abs/1807.00964v2
,2018, Enumerating sparse uniform hypergraphs with given degree sequence and forbidden edges, http://arxiv.org/abs/1805.04991v4
,2018, Threshold functions for substructures in random subsets of finite vector spaces, http://arxiv.org/abs/1805.03778v3
,2018, Subgraph counts for dense random graphs with specified degrees, http://dx.doi.org/10.1017/S0963548320000498
,2017, The flip Markov chain for connected regular graphs, http://arxiv.org/abs/1701.03856v2
,2016, A threshold result for loose Hamiltonicity in random regular uniform hypergraphs, http://arxiv.org/abs/1611.09423v6
,2016, The average number of spanning trees in sparse graphs with given degrees, http://arxiv.org/abs/1606.01586v3
,2015, Hypergraph coloring up to condensation, http://arxiv.org/abs/1508.01841v4
,2014, The switch Markov chain for sampling irregular graphs, http://arxiv.org/abs/1412.5249v1
,2014, Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees, http://arxiv.org/abs/1409.1314v3
,2013, Asymptotic enumeration of sparse uniform hypergraphs with given degrees, http://dx.doi.org/10.48550/arxiv.1306.2012
,2012, Corrigendum: Sampling regular graphs and a peer-to-peer network, http://arxiv.org/abs/1203.6111v1
,