A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
From MaRDI portal
Publication:1150630
DOI10.1016/S0195-6698(80)80030-8zbMath0457.05038OpenAlexW2091476183WikidataQ97309549 ScholiaQ97309549MaRDI QIDQ1150630
Publication date: 1980
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0195-6698(80)80030-8
Related Items
Mixing times of random walks on dynamic configuration models, Finding Hamilton cycles in sparse random graphs, The number of matchings in random regular graphs and bipartite graphs, List-colourings of graphs, Percolation with small clusters on random graphs, Quantum ergodicity for quantum graphs without back-scattering, Sandwiching random graphs: universality between random graph models, SIS epidemic propagation on hypergraphs, Adjacency matrices of random digraphs: singularity and anti-concentration, Random 4-regular graphs have 3-star decompositions asymptotically almost surely, Maximal paths in random dynamic graphs, Generating simple random graphs with prescribed degree distribution, Poisson-Dirichlet distribution for random Belyi surfaces, Eigenvalues and expanders, Typical distances in the directed configuration model, Approximate counting, uniform generation and rapidly mixing Markov chains, Weighted sampling without replacement, The isoperimetric number of random regular graphs, A sequential algorithm for generating random graphs, Small subgraphs of random regular graphs, The cover times of random walks on random uniform hypergraphs, The number of Euler tours of random directed graphs, Packing chromatic number of cubic graphs, Structural transition in random mappings, On the number of spanning trees in random regular graphs, Threshold functions for small subgraphs: an analytic approach, On star decompositions of random regular graphs, Enumeration of graphs with a heavy-tailed degree sequence, A transition of limiting distributions of large matchings in random graphs, On the chromatic number of random regular graphs, Evaluation of vaccination strategies for SIR epidemics on random networks incorporating household structure, The Specker-Blatter theorem does not hold for quaternary relations, On limit behavior of maximum vertex degree in a conditional configuration graph near critical points, A probabilistic analysis of randomly generated binary constraint satisfaction problems., On a surface formed by randomly gluing together polygonal discs, Generation of arbitrary two-point correlated directed networks with given modularity, Fighting constrained fires in graphs, The genus of curve, pants and flip graphs, Beyond clustering: mean-field dynamics on networks with arbitrary subgraph composition, The switch Markov chain for sampling irregular graphs and digraphs, Fast uniform generation of regular graphs, Araneola: a scalable reliable multicast system for dynamic environments, Even cycle decompositions of 4-regular graphs and line graphs, Cover time of a random graph with given degree sequence, Dynamic monopolies with randomized starting configuration, The cook-book approach to the differential equation method, Majority dynamics on trees and the dynamic cavity method, The component sizes of a critical random graph with given degree sequence, Random toric surfaces and a threshold for smoothness, Cleaning random \(d\)-regular graphs with brooms, On realizations of a joint degree matrix, An equation-free approach to coarse-graining the dynamics of networks, Cubic graphs with small independence ratio, Rejection sampling of bipartite graphs with given degree sequence, Central limit theorems in the configuration model, Edge percolation on a random regular graph of low degree, On the independence and chromatic numbers of random regular graphs, A stochastic SIR network epidemic model with preventive dropping of edges, \(k\)-regular subgraphs near the \(k\)-core threshold of a random graph, PageRank on inhomogeneous random digraphs, Critical random graphs and the differential equations technique, Continuum limit of critical inhomogeneous random graphs, Size-Ramsey numbers of cycles versus a path, Finite size scaling for the core of large random hypergraphs, On the connectivity of configuration graphs, On the Hamiltonicity of the \(k\)-regular graph game, A scaling limit for the length of the longest cycle in a sparse random graph, Weighted distances in scale-free configuration models, On cycle lengths in claw-free graphs with complete closure, Generation of networks with prescribed degree-dependent clustering, Clumsy packings of graphs, Edge intersection graphs of systems of paths on a grid with a bounded number of bends, Ising models on locally tree-like graphs, Counting connected graphs inside-out, Uniform generation of \(d\)-factors in dense host graphs, Cutoff phenomena for random walks on random regular graphs, Gibbs measures and phase transitions on sparse random graphs, Equation-free multiscale computational analysis of individual-based epidemic dynamics on networks, On the robustness of random \(k\)-cores, Graphs with average degree smaller than \(\frac{30}{11}\) burn slowly, The \(t\)-tone chromatic number of random graphs, The set of solutions of random XORSAT formulae, Large deviations of empirical neighborhood distribution in sparse random graphs, Asymptotic enumeration by degree sequence of graphs of high degree, Degree multiplicities and independent sets in \(K_ 4\)-free graphs, A note on coloring sparse random graphs, Large induced trees in sparse random graphs, Enumeration of cubic graphs by inclusion-exclusion, The diameter of random regular graphs, On the chromatic number of random \(d\)-regular graphs, Random regular graphs of non-constant degree: concentration of the chromatic number, The evolution of the min-min random graph process, Counting triangles in power-law uniform random graphs, Almost all regular graphs are Hamiltonian, Euler circuits and DNA sequencing by hybridization, Graph imperfection. II, Regular honest graphs, isoperimetric numbers, and bisection of weighted graphs, Metric structure of random networks, Asymptotic enumeration of sparse graphs with a minimum degree constraint, The densest subgraph problem in sparse random graphs, Nearly-Regular Hypergraphs and Saturation of Berge Stars, Moments of Uniform Random Multigraphs with Fixed Degree Sequences, The birth of the giant component, Strong couplings for static locally tree-like random graphs, Rainbow Connection of Random Regular Graphs, Scale-free network clustering in hyperbolic and other random graphs, Domination in Cubic Graphs of Large Girth, The phase transition in inhomogeneous random graphs, Mixing of the Glauber dynamics for the ferromagnetic Potts model, Almost all regular graphs are hamiltonian, Analyzing local and global properties of multigraphs, The cover time of a biased random walk on a random cubic graph, Conditional configuration graphs with discrete power-law distribution of vertex degrees, Glauber dynamics for Ising models on random regular graphs: cut-off and metastability, On the Cover Time of the Emerging Giant, Analysis of a Simple Greedy Matching Algorithm on Random Cubic Graphs, Perfect matchings in random s‐uniform hypergraphs, On the independence number of random cubic graphs, On some Multicolor Ramsey Properties of Random Graphs, Finite length spectra of random surfaces and their dependence on genus, Generating Maximally Disassortative Graphs with Given Degree Distribution, The cover time of the giant component of a random graph, Sparse Graphs Using Exchangeable Random Measures, Loose Hamilton Cycles in Regular Hypergraphs, The Construction and Properties of Assortative Configuration Graphs, Unnamed Item, The Interpolation Method for Random Graphs with Prescribed Degrees, The Multiple-Orientability Thresholds for Random Hypergraphs, Random Regular Graphs: Asymptotic Distributions and Contiguity, Random graphs with given vertex degrees and switchings, Network-Ensemble Comparisons with Stochastic Rewiring and Von Neumann Entropy, The evolution of the mixing rate of a simple random walk on the giant component of a random graph, The distribution of sandpile groups of random regular graphs, Asymptotic normality in random graphs with given vertex degrees, Perfect Matchings in Random r-regular, s-uniform Hypergraphs, Constructing and sampling directed graphs with given degree sequences, KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation, Moments of the inverse participation ratio for the Laplacian on finite regular graphs, Induced Forests in Regular Graphs with Large Girth, Exact sampling of graphs with prescribed degree correlations, The Probability That a Random Multigraph is Simple, Randomized Greedy Algorithms for Independent Sets and Matchings in Regular Graphs: Exact Results and Finite Girth Corrections, Configuring Random Graph Models with Fixed Degree Sequences, On Edge-Disjoint Spanning Trees in a Randomly Weighted Complete Graph, Component structure of the vacant set induced by a random walk on a random graph, Characterizing optimal sampling of binary contingency tables via the configuration model, Diameters in Supercritical Random Graphs Via First Passage Percolation, Network comparison and the within-ensemble graph distance, Limit Distributions of the Number of Vertices of a Given Degree in a Configuration Graph with Bounded Number of Edges, Asymptotics of trees with a prescribed degree sequence and applications, Hamilton cycles in the union of random permutations, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Nonuniversality of weighted random graphs with infinite variance degree, On the Chromatic Number of Random Graphs with a Fixed Degree Sequence, Short cycle distribution in random regular graphs recursively generated by pegging, The spread of fire on a random multigraph, Subgraphs in preferential attachment models, Majorization and the number of bipartite graphs for given vertex degrees, Random Graphs with a Fixed Maximum Degree, Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm, Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method, A phase transition for avoiding a giant component, Generating Random Networks Without Short Cycles, The satisfiability threshold for randomly generated binary constraint satisfaction problems, Hamilton cycles in random graphs with minimum degree at least 3: An improved analysis, Unbiased sampling of network ensembles, Birds of a feather or opposites attract - effects in network modelling, Construction of Directed Assortative Configuration Graphs, First passage percolation on sparse random graphs with boundary weights, Uniform Generation of Random Regular Graphs, Competing first passage percolation on random regular graphs, Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees, Regular subgraphs of random graphs, Why Do Simple Algorithms for Triangle Enumeration Work in the Real World?, Degree correlations in scale-free random graph models, The bisection width of cubic graphs, On the chromatic number of a random 5-regular graph, Small maximal matchings of random cubic graphs, Edge Correlations in Random Regular Hypergraphs and Applications to Subgraph Testing, Dirac’s theorem for random regular graphs, Optimal Construction of Edge-Disjoint Paths in Random Graphs, Directed random graphs with given degree distributions, The probability that a random multigraph is simple. II, Regular graphs whose subgraphs tend to be acyclic, Randomly coloring sparse random graphs with fewer colors than the maximum degree, Bootstrap percolation on the random regular graph, The generalized acyclic edge chromatic number of random regular graphs, CONNECTIVITY PROPERTIES IN RANDOM REGULAR GRAPHS WITH EDGE FAULTS, Limit theorems for assortativity and clustering in null models for scale-free networks, Cover time of a random graph with a degree sequence II: Allowing vertices of degree two, Unnamed Item, Discrete Graphs – A Paradigm Model for Quantum Chaos, Hitting times for Shamir’s problem, Percolation on Random Graphs with a Fixed Degree Sequence, Sofic homological invariants and the Weak Pinsker Property, The diameter of sparse random graphs, Critical percolation on random regular graphs, Not all interventions are equal for the height of the second peak, Partition expanders, High-girth near-Ramanujan graphs with localized eigenvectors, Sharp load thresholds for cuckoo hashing, Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables, Sizes of trees in a random forest and configuration graphs, Rare event asymptotics for exploration processes for random graphs, Depth first exploration of a configuration model, On the number of circuits in random graphs, The scaling window for a random graph with a given degree sequence, Majority vote model with ancillary noise in complex networks, The structure of typical clusters in large sparse random configurations, An almost linear time algorithm for finding Hamilton cycles in sparse random graphs with minimum degree at least three, Sandwiching a densest subgraph by consecutive cores, On a greedy 2-matching algorithm and Hamilton cycles in random graphs with minimum degree at least three, On the simultaneous edge coloring of graphs, Large deviation for uniform graphs with given degrees, Asymptotic bounds on total domination in regular graphs, Making multigraphs simple by a sequence of double edge swaps, Proof of the satisfiability conjecture for large \(k\), Critical percolation on scale-free random graphs: new universality class for the configuration model, Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs, \(1/n\) expansion for the number of matchings on regular graphs and Monomer-Dimer entropy, On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \), On the discrepancies of graphs, Universality for critical heavy-tailed network models: metric structure of maximal components, Discrepancy properties for random regular digraphs, SIR epidemics and vaccination on random graphs with clustering, Push is Fast on Sparse Random Graphs, Threshold functions for small subgraphs in simple graphs and multigraphs, Cycle Factors and Renewal Theory, The diameter of the directed configuration model, The average distance and the diameter of dense random regular graphs, Ensemble nonequivalence in random graphs with modular structure, The replica symmetric solution for orthogonally constrained Heisenberg model on Bethe lattice, On the structure of random graphs with constant \(r\)-balls, A model for random three-manifolds, The cover time of a biased random walk on a random regular graph of odd degree, ON THE STRUCTURE OF GRAPHS WHICH ARE LOCALLY INDISTINGUISHABLE FROM A LATTICE, A random growth model with any real or theoretical degree distribution, Approximate counting of regular hypergraphs, Limit distributions of the number of loops in a random configuration graph, Isomorphism for random \(k\)-uniform hypergraphs, Heavy-tailed configuration models at criticality, Modular Orientations of Random and Quasi-Random Regular Graphs, Percolation on complex networks: theory and application, Optimal subgraph structures in scale-free configuration models, PageRank's behavior under degree correlations, Central limit theorems for SIR epidemics and percolation on configuration model random graphs, Random regular graphs of high degree, Hamilton cycles containing randomly selected edges in random regular graphs, Exchangeable pairs, switchings, and random regular graphs, Modified logarithmic Sobolev inequalities for some models of random walk, Minors in random regular graphs, Critical percolation on random regular graphs, Random graphs with forbidden vertex degrees, Resolvent of large random graphs, A system of grabbing particles related to Galton-Watson trees, Cutoff for random walk on dynamical Erdős-Rényi graph, On the unbalanced cut problem and the generalized Sherrington-Kirkpatrick model, Anatomy of the giant component: the strictly supercritical regime, Injective edge-coloring of graphs with given maximum degree, The largest strongly connected component in the cyclical pedigree model of Wakeley et al., Random-cluster dynamics on random regular graphs in tree uniqueness, Rainbow matchings and Hamilton cycles in random graphs, Geodesics and almost geodesic cycles in random regular graphs, Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs, Spectra of large diluted but bushy random graphs, The diameter of random Belyĭ surfaces, Ordered size Ramsey number of paths, Anatomy of a young giant component in the random graph, Duality in inhomogeneous random graphs, and the cut metric, On the computational tractability of statistical estimation on amenable graphs, Karp–Sipser on Random Graphs with a Fixed Degree Sequence, Limits of sparse configuration models and beyond: graphexes and multigraphexes, Estimating graph parameters with random walks, Invertibility of adjacency matrices for random \(d\)-regular graphs, Scaling limit of random forests with prescribed degree sequences, Sampling \(k\)-partite graphs with a given degree sequence, Linking the mixing times of random walks on static and dynamic random graphs, Counting strongly-connected, moderately sparse directed graphs, Universality for random surfaces in unconstrained genus, Logarithmic Sobolev inequalities for finite Markov chains, Global lower mass-bound for critical configuration models in the heavy-tailed regime, On the asymptotics of degree structure of configuration graphs with bounded number of edges, Rumor spreading on random regular graphs and expanders, Sandwiching dense random regular graphs between binomial random graphs, Joint Distribution of Distances in Large Random Regular Networks, Uniform generation of spanning regular subgraphs of a dense graph, Minimum 2-dominating sets in regular graphs, Limit laws for self-loops and multiple edges in the configuration model, The diameter of weighted random graphs, The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees, Analytic description of the phase transition of inhomogeneous multigraphs, An old approach to the giant component problem, Distance evolutions in growing preferential attachment graphs, On compactness of logics that can express properties of symmetry or connectivity, Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs, Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs, The average number of spanning trees in sparse graphs with given degrees, The Threshold of Symmetry in Random Graphs with Specified Degree Sequences, Spanning trees in random regular uniform hypergraphs, Spectral gap in random bipartite biregular graphs and applications, Counting colorings of triangle-free graphs, A probabilistic approach to the leader problem in random graphs, Finding maximum matchings in random regular graphs in linear expected time, Limit theorems for the maximal tree size of a Galton-Watson forest in the critical case, Combinatorics. Abstracts from the workshop held January 1--7, 2023, Cycle lengths in sparse random graphs, The Euler characteristic of the moduli space of graphs, Fast uniform generation of random graphs with given degree sequences, Hamiltonicity of graphs perturbed by a random regular graph, Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity, The number of perfect matchings, and the nesting properties, of random regular graphs, Epidemics on networks with preventive rewiring, Sharp Poincaré and log-Sobolev inequalities for the switch chain on regular bipartite graphs, Subgraph distributions in dense random regular graphs, Cutoff for rewiring dynamics on perfect matchings, Local weak convergence for sparse networks of interacting processes, On the minimum bisection of random 3-regular graphs, The probability of unusually large components for critical percolation on random \(d\)-regular graphs, Random amenable C*-algebras, Locality of random digraphs on expanders, Triangles and subgraph probabilities in random regular graphs, The birth of the strong components, Statistics of Feynman amplitudes in \(\phi^4\)-theory, Asymptotic enumeration of graphs by degree sequence, and the degree sequence of a random graph, Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs, On connectivity of conditional configuration graphs under destruction, Stable graphs: distributions and line-breaking construction, On the Number of Trees of a Given Size in a Galton--Watson Forest in the Critical Case, Largest component of subcritical random graphs with given degree sequence, Dense multigraphon-valued stochastic processes and edge-changing dynamics in the configuration model, Percolation of arbitrary uncorrelated nested subgraphs, Sampling from Potts on random graphs of unbounded degree via random-cluster dynamics, Stochastic recursions on directed random graphs, Statistics of finite degree covers of torus knot complements, Rainbow Spanning Trees in Randomly Colored \(\boldsymbol{G}_{\boldsymbol{k}-\boldsymbol{out}}\), Simple versus nonsimple loops on random regular graphs, Optimal linear‐Vizing relationships for (total) domination in graphs, Unnamed Item, Vacant Sets and Vacant Nets: Component Structures Induced by a Random Walk, Between 2- and 3-colorability, The Stripping Process Can be Slow: Part II, Combinatorial approach to the interpolation method and scaling limits in sparse random graphs, Lower bounds for random 3-SAT via differential equations, Explicit Near-Ramanujan Graphs of Every Degree, Large deviation and anomalous fluctuations scaling in degree assortativity on configuration networks, Imaginary replica analysis of loopy regular random graphs
Cites Work
