On a Correlation Inequality of Farr

DOI10.1017/S096354830000016XzbMATH Open0798.60009MaRDI QIDQ4291209FDOQ4291209

Authors: Colin McDiarmid 

Publication date: 5 May 1994

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

zbMATH Keywords

associationinequalityrandom setprobabilistic dependencerandomly colored graph

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (10)

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

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)