A problem of Füredi and Seymour on covering intersecting families by pairs

DOI10.1016/0097-3165(94)90109-0zbMath0810.05051OpenAlexW1980522771MaRDI QIDQ1337172

Gil Kalai, Jeffry Kahn

Publication date: 2 April 1995

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(94)90109-0

zbMATH Keywords

Borsuk's conjectureintersecting hypergraph

Mathematics Subject Classification ID

Partitions of sets (05A18) Hypergraphs (05C65) Combinatorial probability (60C05) Combinatorial aspects of packing and covering (05B40)

Related Items (2)

Blocking \(s\)-dimensional subspaces by lines in \(PG(2s,q)\) ⋮ A counterexample to Borsuk’s conjecture

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• On the combinatorial problems which I would most like to see solved
• A fractional version of the Erdős-Faber-Lovász conjecture
• Asymptotically good list-colorings
• Weighted sums of certain dependent random variables
• A counterexample to Borsuk’s conjecture
• Illuminating sets of constant width
• Probability Inequalities for Sums of Bounded Random Variables
• Families of Non-disjoint subsets
• The Solution of a Timetabling Problem
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A problem of Füredi and Seymour on covering intersecting families by pairs