Now showing items 1-4 of 4

    • Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture 

      Chapuy, G.; Perarnau Llobet, Guillem (2018-09-17)
      Article
      Open Access
      A class of graphs is bridge-addable if given a graph G in the class, any graph obtained by adding an edge between two connected components of G is also in the class. We prove a conjecture of McDiarmid, Steger, and Welsh, ...
    • Local convergence and stability of tight bridge-addable classes 

      Chapuy, G.; Perarnau Llobet, Guillem (Canadian Mathematical Society, 2020-06-01)
      Article
      Restricted access - publisher's policy
      A class of graphs is bridge-addable if given a graph G in the class, any graph obtained by adding an edge between two connected components of G is also in the class. The authors recently proved a conjecture of McDiarmid, ...
    • On the diameter of random planar graphs 

      Chapuy, G.; Fusy, Éric; Giménez Llach, Omer; Noy Serrano, Marcos (2015)
      Article
      Open Access
      We show that the diameter diam(Gn) of a random labelled connected planar graph with n vertices is equal to n1/4+o(1) , in probability. More precisely, there exists a constant c > 0 such that {equation presented} for ˜ small ...
    • On the number of coloured triangulations of d-manifolds 

      Chapuy, G.; Perarnau Llobet, Guillem (2020-03-11)
      Article
      Open Access
      We give superexponential lower and upper bounds on the number of coloured d-dimensional triangulations whose underlying space is an oriented manifold, when the number of simplices goes to infinity and d=3 is fixed. In the ...