On a Correlation Inequality of Farr

DOI10.1017/S096354830000016XMaRDI QIDQ4291209zbMATH OpenFDO

Authors Colin McDiarmid

Publication date 5 May 1994

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S096354830000016X

zbMATH Keywords

associationinequalityprobabilistic dependencerandom setrandomly colored graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05)

Cites work

• An inequality for the weights of two families of sets, their unions and intersections
• Clutter percolation and random graphs
• General percolation and random graphs

Cited in

(10)

• A proof of one correlation inequality
• The Go polynomials of a graph.
• Goldberg's conjecture is true for random multigraphs
• On the correlation between f-ratios
• Small subgraphs in the trace of a random walk
• Bounds on the satisfiability threshold for power law distributed random SAT
• Correlation Inequality for Formal Series
• THE CORRELATIONS OF FAREY FRACTIONS
• Rigorous results for random (2+p)-SAT
• The number of distinct adjacent pairs in geometrically distributed words: a probabilistic and combinatorial analysis

This page was built for publication: On a Correlation Inequality of Farr

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