Law of the iterated logarithm for random graphs

DOI10.1002/rsa.20784zbMath1405.05159arXiv1607.08865OpenAlexW2964154734WikidataQ115150357 ScholiaQ115150357MaRDI QIDQ4625027

Daniel Montealegre, Van H. Vu, Asaf Ferber

Publication date: 20 February 2019

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

distributioncentral limit theoremperfect matchingsHamilton cyclessmall subgraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items

Unions of random trees and applications ⋮ Hamiltonian cycles above expectation in \(r\)-graphs and quasi-random \(r\)-graphs

Cites Work

• Loose Hamilton cycles in random uniform hypergraphs
• When are small subgraphs of a random graph normally distributed?
• On normal approximation rates for certain sums of dependent random variables
• The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph
• Tight Hamilton cycles in random uniform hypergraphs
• Distributions of Sparse Spanning Subgraphs in Random Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item