scientific article; zbMATH DE number 568785
zbMATH Open0792.05122MaRDI QIDQ4294576FDOQ4294576
Authors: Béla Bollobás, John C. Wierman 
Publication date: 24 July 1994
Title of this publication is not available (Why is that?)
Recommendations
thresholdasymptotic distributionrandom graphbalanced graphslimiting distributionPoisson random variablessubgraph countasymptotic probabilitiesasymptotic containment probabilitygrading decomposition methodlimiting containment probability
Probability distributions: general theory (60E05) Applications of graph theory (05C90) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)
Cited In (13)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Variance of the subgraph count for sparse Erdős-Rényi graphs
- Anti-concentration for subgraph counts in random graphs
- On the upper tail of counts of strictly balanced subgraphs
- Asymptotic normality in random graphs with given vertex degrees
- Transforming a graph into a 1-balanced graph
- On the \(\mathrm{AC}^0\) complexity of subgraph isomorphism
- Short monadic second order sentences about sparse random graphs
- Large cycles in random generalized Johnson graphs
- Title not available (Why is that?)
- Connected balanced subgraphs in random regular multigraphs under the configuration model
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4294576)
