A problem of Füredi and Seymour on covering intersecting families by pairs
- 30 November 1994
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 68 (2) , 317-339
- https://doi.org/10.1016/0097-3165(94)90109-0
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Kneser's conjecture, chromatic number, and homotopyPublished by Elsevier ,2004
- A counterexample to Borsuk’s conjectureBulletin of the American Mathematical Society, 1993
- A fractional version of the Erdős-Faber-Lovász conjectureCombinatorica, 1992
- Illuminating sets of constant widthMathematika, 1988
- On the combinatorial problems which I would most like to see solvedCombinatorica, 1981
- Weighted sums of certain dependent random variablesTohoku Mathematical Journal, 1967
- Families of Non-disjoint subsetsJournal of Combinatorial Theory, 1966
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952
- Drei Sätze über die n-dimensionale euklidische SphäreFundamenta Mathematicae, 1933