A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph

DOI10.1002/RSA.3240010210zbMATH Open0747.05082OpenAlexW1980948271MaRDI QIDQ3977079FDOQ3977079

Authors: W. C. Stephen Suen 

Publication date: 25 June 1992

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

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

Recommendations

• scientific article; zbMATH DE number 747034
• Solitary subgraphs of random graphs
• scientific article
• scientific article; zbMATH DE number 4041966
• The distributions of the numbers of finite subgraphs in random nonhomogeneous hypergraphs

zbMATH Keywords

random graphPoisson limit theoremstrongly balanced graphnon-overlapping subgraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Limit theorems in probability theory (60F99)

Cited In (22)

• Identifying and locating-dominating codes in (random) geometric networks
• An approximate version of the tree packing conjecture
• Compound Poisson approximation: A user's guide
• Codes identifying sets of vertices in random networks
• Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere
• The lower tail: Poisson approximation revisited
• Transforming a graph into a 1-balanced graph
• Block sensitivity of minterm-transitive functions
• Packing of partial designs
• Splits with forbidden subgraphs
• The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma
• De Bruijn covering codes with arbitrary alphabets
• The set chromatic number of random graphs
• Moment inequalities for functions of independent random variables
• Attacks and alignments: rooks, set partitions, and permutations
• On the probability of nonexistence in binomial subsets
• The number of k‐SAT functions
• A useful elementary correlation inequality. II
• Extremal independence in discrete random systems
• A probabilistic approach to consecutive pattern avoiding in permutations
• Sequential metric dimension for random graphs
• When do random subsets decompose a finite group?

This page was built for publication: A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3977079)