Regular graphs whose subgraphs tend to be acyclic

DOI10.1002/rsa.20107zbMath1114.05092OpenAlexW4233611580MaRDI QIDQ3419597

Eitan Bachmat, Noga Alon

Publication date: 7 February 2007

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

Full work available at URL: https://doi.org/10.1002/rsa.20107

zbMATH Keywords

acyclic subgraphrandom regular graphRamanujan graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (1)

On the Probability that a Random Subgraph Contains a Circuit

Cites Work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Regular graphs whose subgraphs tend to be acyclic