Triangles and subgraph probabilities in random regular graphs

DOI10.37236/10281arXiv2012.01492OpenAlexW4391258573WikidataQ129303544 ScholiaQ129303544MaRDI QIDQ6117404

Pu Gao

Publication date: 19 February 2024

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.01492

zbMATH Keywords

number of subgraphsdistributional result for the number of triangles

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A transition of limiting distributions of large matchings in random graphs
• When are small subgraphs of a random graph normally distributed?
• The asymptotic distribution of short cycles in random regular graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Asymptotic normality determined by high moments, and submap counts of random maps
• Short cycles in random regular graphs
• Distribution of the number of spanning regular subgraphs in random graphs
• The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• Sandwiching random regular graphs between binomial random graphs
• Distributions of Sparse Spanning Subgraphs in Random Graphs
• Distribution of subgraphs of random regular graphs
• Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity

This page was built for publication: Triangles and subgraph probabilities in random regular graphs