Upper Tails of Subgraph Counts in Sparse Regular Graphs

2020/10/01 by Benjamin Gunby, Gunby, Benjamin · 1 citation
Computer Science · Mathematics · #05C35 #05C80 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory

paper · pdf · doi:10.48550/arxiv.2010.00658

openalex publication_date 2020/10/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

What is the probability that a sparse n-vertex random d-regular graph G_n^d, n^1-c

Cited by

• Upper tails for homomorphism counts in sparse random hypergraphs

Related

• Upper tails of subgraph counts in directed random graphs
• Upper Tail For Homomorphism Counts In Constrained Sparse Random Graphs
• Induced subgraphs in sparse random graphs with given degree sequence
• Random Subgraphs in Sparse Graphs
• On the upper tail problem for random hypergraphs