Pages that link to "Item:Q3977079"
From MaRDI portal
The following pages link to A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph (Q3977079):
Displayed 21 items.
- An approximate version of the tree packing conjecture (Q273108) (← links)
- Growth rates of groups associated with face 2-coloured triangulations and directed Eulerian digraphs on the sphere (Q278890) (← links)
- The set chromatic number of random graphs (Q323038) (← links)
- A probabilistic approach to consecutive pattern avoiding in permutations (Q385031) (← links)
- Block sensitivity of minterm-transitive functions (Q719324) (← links)
- Codes identifying sets of vertices in random networks (Q870971) (← links)
- Transforming a graph into a 1-balanced graph (Q1003673) (← links)
- A useful elementary correlation inequality. II (Q1268732) (← links)
- Packing of partial designs (Q1323485) (← links)
- Moment inequalities for functions of independent random variables (Q1775439) (← links)
- De Bruijn covering codes with arbitrary alphabets (Q1775727) (← links)
- Compound Poisson approximation: A user's guide (Q1872438) (← links)
- On the probability of nonexistence in binomial subsets (Q2184826) (← links)
- The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma (Q2487791) (← links)
- When do random subsets decompose a finite group? (Q2655780) (← links)
- Splits with forbidden subgraphs (Q2666586) (← links)
- The lower tail: Poisson approximation revisited (Q2795741) (← links)
- Identifying and Locating–Dominating Codes in (Random) Geometric Networks (Q3557518) (← links)
- The number of k‐SAT functions (Q4805218) (← links)
- Sequential metric dimension for random graphs (Q5014301) (← links)
- Attacks and alignments: rooks, set partitions, and permutations (Q5026963) (← links)