A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph
From MaRDI portal
Publication:3977079
DOI10.1002/rsa.3240010210zbMath0747.05082OpenAlexW1980948271MaRDI QIDQ3977079
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
Related Items
Compound Poisson approximation: A user's guide, An approximate version of the tree packing conjecture, Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere, The number of k‐SAT functions, The set chromatic number of random graphs, When do random subsets decompose a finite group?, Codes identifying sets of vertices in random networks, Splits with forbidden subgraphs, A probabilistic approach to consecutive pattern avoiding in permutations, On the probability of nonexistence in binomial subsets, Attacks and alignments: rooks, set partitions, and permutations, Identifying and Locating–Dominating Codes in (Random) Geometric Networks, The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma, Moment inequalities for functions of independent random variables, De Bruijn covering codes with arbitrary alphabets, Block sensitivity of minterm-transitive functions, The lower tail: Poisson approximation revisited, Transforming a graph into a 1-balanced graph, A useful elementary correlation inequality. II, Sequential metric dimension for random graphs, Packing of partial designs
