Random Graphs, Geometry and Asymptotic Structure

Editors' introduction Part I. Long Paths and Hamiltonicity in Random Graphs: 1. Introduction 2. Tools 3. Long paths in random graphs 4. The appearance of Hamilton cycles in random graphs References for Part I Part II. Random Graphs from Restricted Classes: 1. Introduction 2. Random trees 3. Random graphs from block-stable classes References for Part II Part III. Lectures on Random Geometric Graphs: 1. Introduction 2. Edge counts 3. Edge counts: normal approximation 4. The maximum degree 5. A sufficient condition for connectivity 6. Connectivity and Hamiltonicity 7. Solutions to exercises References for Part III Part IV. On Random Graphs from a Minor-closed Class: 1. Introduction 2. Properties of graph classes 3. Bridge-addability, being connected and the fragment 4 Growth constants 5. Unlabelled graphs 6. Smoothness 7. Concluding remarks References for Part IV Index.

[1]  Marc Noy,et al.  Graph classes with given 3‐connected components: Asymptotic enumeration and random graphs , 2009, Random Struct. Algorithms.

[2]  Konstantinos Panagiotou,et al.  Maximal biconnected subgraphs of random planar graphs , 2009, TALG.

[3]  Marc Noy,et al.  Enumeration and limit laws for series-parallel graphs , 2007, Eur. J. Comb..

[4]  Guy Louchard,et al.  Boltzmann Samplers for the Random Generation of Combinatorial Structures , 2004, Combinatorics, Probability and Computing.

[5]  Manuel Bodirsky,et al.  Boltzmann Samplers, Pólya Theory, and Cycle Pointing , 2010, SIAM J. Comput..

[6]  Zdenek Dvorak,et al.  Small graph classes and bounded expansion , 2010, J. Comb. Theory, Ser. B.

[7]  Philippe Flajolet,et al.  Boltzmann Sampling of Unlabeled Structures , 2007, ANALCO.

[8]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[9]  M. Drmota.  Random Trees: An Interplay between Combinatorics and Probability , 2009 .

[10]  Colin McDiarmid,et al.  Random Graphs from a Minor-Closed Class , 2009, Combinatorics, Probability and Computing.

[11]  Marc Noy,et al.  Degree distribution in random planar graphs , 2009, J. Comb. Theory, Ser. A.

[12]  Marc Noy,et al.  Growth constants of minor-closed classes of graphs , 2010, J. Comb. Theory B.

[13]  Lajos Takács,et al.  A Generalization of the Ballot Problem and its Application in the Theory of Queues , 1962 .

[14]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

[15]  Colin McDiarmid.  On graphs with few disjoint t-star minors , 2011, Eur. J. Comb..

[16]  János Komlós,et al.  The longest path in a random graph , 1981, Comb..

[17]  Colin McDiarmid.  Connectivity for Random Graphs from a Weighted Bridge-Addable Class , 2012, Electron. J. Comb..

[18]  L. Pósa,et al.  Hamiltonian circuits in random graphs , 1976, Discret. Math..

[19]  Omer Giménez,et al.  Asymptotic enumeration and limit laws of planar graphs , 2005, math/0501269.

[20]  W. T. Tutte.  Connectivity in graphs , 1966 .

[21]  Konstantinos Panagiotou,et al.  3-Connected Cores In Random Planar Graphs , 2011, Comb. Probab. Comput..

[22]  Benny Sudakov,et al.  The phase transition in random graphs: A simple proof , 2012, Random Struct. Algorithms.

[23]  Béla Bollobás,et al.  Connectivity of addable graph classes , 2008, J. Comb. Theory, Ser. B.

[24]  Reinhard Diestel,et al.  Graph Theory , 1997 .

[25]  A. Thomason.  An extremal function for contractions of graphs , 1984, Mathematical Proceedings of the Cambridge Philosophical Society.

[26]  Colin McDiarmid,et al.  Random Graphs from a Weighted Minor-Closed Class , 2012, Electron. J. Comb..

[27]  Colin McDiarmid,et al.  Random graphs containing few disjoint excluded minors , 2014, Random Struct. Algorithms.

[28]  Eric Fusy.  Uniform random sampling of planar graphs in linear time , 2009 .

[29]  A. Joyal.  Une théorie combinatoire des séries formelles , 1981 .

[30]  Konstantinos Panagiotou,et al.  On the connectivity of random graphs from addable classes , 2013, J. Comb. Theory, Ser. B.

[31]  D. McDonald,et al.  An elementary proof of the local central limit theorem , 1995 .

[32]  W. Mader.  Homomorphiesätze für Graphen , 1968 .

[33]  A. Frieze,et al.  Introduction to Random Graphs , 2016 .

[34]  Mireille Bousquet-Mélou,et al.  Asymptotic Properties of Some Minor-Closed Classes of Graphs , 2013, Combinatorics, Probability and Computing.

[35]  Richard M. Karp,et al.  The Transitive Closure of a Random Digraph , 1990, Random Struct. Algorithms.

[36]  Konstantinos Panagiotou,et al.  The Degree Sequence of Random Graphs from Subcritical Classes† , 2009, Combinatorics, Probability and Computing.

[37]  Colin McDiarmid,et al.  Random graphs on surfaces , 2008, J. Comb. Theory, Ser. B.

[38]  Svante Janson,et al.  Simply generated trees, conditioned Galton–Watson trees, random allocations and condensation , 2011, 1112.0510.

[39]  Marc Noy,et al.  The Number of Graphs Not Containing K3, 3 as a Minor , 2008, Electron. J. Comb..

[40]  Robin Wilson,et al.  Graph theory and combinatorics , 1979 .

[41]  Edward A. Bender,et al.  The Number of Labeled 2-Connected Planar Graphs , 2002, Electron. J. Comb..

[42]  Kerstin B. Weller.  Connectivity and related properties for graph classes , 2014 .

[43]  Michael Drmota,et al.  Asymptotic Study of Subcritical Graph Classes , 2010, SIAM J. Discret. Math..

[44]  Colin McDiarmid,et al.  Random planar graphs , 2005, J. Comb. Theory B.

[45]  Edward A. Bender,et al.  Coefficients of Functional Compositions Often Grow Smoothly , 2008, Electron. J. Comb..

[46]  J. Thomas.  The four color theorem , 1977 .

[47]  Benny Sudakov,et al.  The size Ramsey number of a directed path , 2010, Journal of combinatorial theory. Series B (Print).

[48]  Louis H. Y. Chen,et al.  Normal approximation under local dependence , 2004, math/0410104.

[49]  Colin McDiarmid,et al.  Random unlabelled graphs containing few disjoint cycles , 2011, Random Struct. Algorithms.

[50]  Paul Wollan,et al.  Proper minor-closed families are small , 2006, J. Comb. Theory B.

[51]  Bruce A. Reed,et al.  Connectivity for Bridge-Addable Monotone Graph Classes , 2011, Combinatorics, Probability and Computing.

[52]  Philippe Flajolet,et al.  Analytic Combinatorics , 2009 .

[53]  E. A. Bender,et al.  Asymptotic enumeration of labelled graphs with a given genus , 2009, 0912.4670.

[54]  Marc Noy,et al.  Asymptotic enumeration and limit laws for graphs of fixed genus , 2010, J. Comb. Theory, Ser. A.

[55]  P. Valtr,et al.  Topics in Discrete Mathematics , 2006 .

[56]  B. Bollobás.  The evolution of random graphs , 1984 .

[57]  Colva M. Roney-Dougal,et al.  Surveys in combinatorics 2009 , 2009 .

[58]  Béla Bollobás,et al.  Random Graphs , 1985 .

[59]  Colin McDiarmid,et al.  Random Graphs with Few Disjoint Cycles , 2011, Comb. Probab. Comput..