Probabilities for Intersecting Systems and Random Subsets of Finite Sets

DOI10.1137/0607009zbMath0582.60014OpenAlexW2089178370MaRDI QIDQ3704664

Peter Frankl, Daniel S. Freed, Jeffrey C. Lagarias, Peter C. Fishburn, Andrew M. Odlyzko

Publication date: 1986

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0607009

zbMATH Keywords

intersecting familiesprobabilistic dimensiontheory of intersecting systems

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial probability (60C05)

Related Items

Application of hypergraph Hoffman's bound to intersecting families, On Chvàtal's conjecture and a conjecture on families of signed sets, A semidefinite programming approach to a cross-intersection problem with measures, KKL's influence on me, Unnamed Item, Erdős-Ko-Rado theorems for permutations and set partitions, On the measure of intersecting families, uniqueness and stability, Stability versions of Erdős-Ko-Rado type theorems via isoperimetry, Invitation to intersection problems for finite sets, A Katona-type proof of an Erdős-Ko-Rado-type theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Contributions to the geometry of Hamming spaces
• A simple proof of the Erdős-Chao Ko-Rado theorem
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• The Erdös-Ko-Rado Theorem for Integer Sequences
• Intersection theorems for systems of finite sets
• On a combinatorial conjecture of Erdös