The asymptotic distribution of short cycles in random regular graphs
From MaRDI portal
Publication:1143412
DOI10.1016/S0095-8956(81)80022-6zbMath0442.05042OpenAlexW2052603920MaRDI QIDQ1143412
Publication date: 1981
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0095-8956(81)80022-6
Related Items
Local maxima of the systole function, Total domination in regular graphs, Almost all cubic graphs are Hamiltonian, Small eigenvalues of closed Riemann surfaces for large genus, Almost all regular graphs are hamiltonian, Random Graph Processes with Degree Restrictions, Asymptotic bounds on total domination in regular graphs, Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs, Small subgraphs of random regular graphs, On the modularity of 3‐regular random graphs and random graphs with given degree sequences, Cycle lengths in sparse random graphs, The number of perfect matchings, and the nesting properties, of random regular graphs, Threshold functions for small subgraphs: an analytic approach, Subgraph distributions in dense random regular graphs, A transition of limiting distributions of large matchings in random graphs, The asymptotic connectivity of labelled regular graphs, Triangles and subgraph probabilities in random regular graphs, Cycle Factors and Renewal Theory, Statistics of Feynman amplitudes in \(\phi^4\)-theory, Finite-size scaling, phase coexistence, and algorithms for the random cluster model on random graphs, The genus of curve, pants and flip graphs, Random Regular Graphs: Asymptotic Distributions and Contiguity, Random graphs with given vertex degrees and switchings, The asymptotic number of claw-free cubic graphs., Asymptotic normality in random graphs with given vertex degrees, Approximate counting of regular hypergraphs, Dynamic monopolies with randomized starting configuration, Random-link matching problems on random regular graphs, Induced Forests in Regular Graphs with Large Girth, Constructing concrete hard instances of the maximum independent set problem, The Probability That a Random Multigraph is Simple, Limiting distribution of short cycles in inhomogeneous random uniform hypergraph, On cycle lengths in claw-free graphs with complete closure, Exchangeable pairs, switchings, and random regular graphs, Lower bound of cyclic edge connectivity for \(n\)-extendability of regular graphs, Random graphs with forbidden vertex degrees, ``Immunetworks, intersecting circuits and dynamics, Short cycle distribution in random regular graphs recursively generated by pegging, The spread of fire on a random multigraph, The set of solutions of random XORSAT formulae, Asymptotic enumeration by degree sequence of graphs of high degree, The probability that a random multigraph is simple. II, Counting triangles in power-law uniform random graphs, CONNECTIVITY PROPERTIES IN RANDOM REGULAR GRAPHS WITH EDGE FAULTS, Minimum 2-dominating sets in regular graphs, Limit laws for self-loops and multiple edges in the configuration model, Unnamed Item, Discrete Graphs – A Paradigm Model for Quantum Chaos, On compactness of logics that can express properties of symmetry or connectivity, Imaginary replica analysis of loopy regular random graphs, 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
Cites Work
