The asymptotic connectivity of labelled regular graphs
From MaRDI portal
Publication:1143413
DOI10.1016/S0095-8956(81)80021-4zbMath0442.05043WikidataQ56621908 ScholiaQ56621908MaRDI QIDQ1143413
Publication date: 1981
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Related Items
Spectral gap in random bipartite biregular graphs and applications, Sandwiching random graphs: universality between random graph models, 3-manifolds represented by 4-regular graphs with three Eulerian cycles, Analyzing local and global properties of multigraphs, Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity, Statistics of Feynman amplitudes in \(\phi^4\)-theory, On a surface formed by randomly gluing together polygonal discs, Percolation of arbitrary uncorrelated nested subgraphs, Critical Window for Connectivity in the Configuration Model, Unnamed Item, Dynamic monopolies with randomized starting configuration, Rank and Bollobás-Riordan polynomials: Coefficient measures and zeros, A Random Graph Model for Power Law Graphs, Random regular graphs of high degree, On cycle lengths in claw-free graphs with complete closure, Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs, Counting connected graphs inside-out, The spread of fire on a random multigraph, Connectivity of random regular graphs generated by the pegging algorithm, Graph structural properties of non-Yutsis graphs allowing fast recognition, FORBIDDEN TRIPLES GENERATING A FINITE SET OF GRAPHS WITH HIGH CONNECTIVITY, Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm, Poisson approximation of the length spectrum of random surfaces, Geodesics and almost geodesic cycles in random regular graphs, Local Resilience and Hamiltonicity Maker–Breaker Games in Random Regular Graphs, Expanders with respect to Hadamard spaces and random graphs, Asymptotic enumeration by degree sequence of graphs of high degree, Why Do Simple Algorithms for Triangle Enumeration Work in the Real World?, Small maximal matchings of random cubic graphs, Metric structure of random networks, On compactness of logics that can express properties of symmetry or connectivity
Cites Work
- The asymptotic distribution of short cycles in random regular graphs
- The asymptotic number of labeled graphs with given degree sequences
- A non-Hamiltonian planar graph
- On the strength of connectedness of a random graph
- Enumeration of Labelled Graphs II: Cubic Graphs with a given Connectivity
- Asymptotic Relations Between Enumerative Functions in Graph Theory
- Unnamed Item
- Unnamed Item
