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

Jeff Kahn; Gil Kalai

doi:10.1016/0097-3165(94)90109-0

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

Jeff Kahn^*
, Gil Kalai

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

Abstract

We disprove the following conjecture of Füredi and Seymour:. Conjecture. If F is an intersecting hypergraph on n vertices, then there is a set of n pairs of vertices such that each member of F contains one of the pairs.

Original language	English
Pages (from-to)	317-339
Number of pages	23
Journal	Journal of Combinatorial Theory. Series A
Volume	68
Issue number	2
DOIs	https://doi.org/10.1016/0097-3165(94)90109-0
State	Published - Nov 1994

Access to Document

10.1016/0097-3165(94)90109-0

Cite this

@article{9fe039977f4a467891b6ab892d27e6f8,

title = "A problem of F{\"u}redi and Seymour on covering intersecting families by pairs",

abstract = "We disprove the following conjecture of F{\"u}redi and Seymour:. Conjecture. If F is an intersecting hypergraph on n vertices, then there is a set of n pairs of vertices such that each member of F contains one of the pairs.",

author = "Jeff Kahn and Gil Kalai",

year = "1994",

month = nov,

doi = "10.1016/0097-3165(94)90109-0",

language = "אנגלית",

volume = "68",

pages = "317--339",

journal = "Journal of Combinatorial Theory. Series A",

issn = "0097-3165",

publisher = "Academic Press Inc.",

number = "2",

}

TY - JOUR

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

AU - Kahn, Jeff

AU - Kalai, Gil

PY - 1994/11

Y1 - 1994/11

N2 - We disprove the following conjecture of Füredi and Seymour:. Conjecture. If F is an intersecting hypergraph on n vertices, then there is a set of n pairs of vertices such that each member of F contains one of the pairs.

AB - We disprove the following conjecture of Füredi and Seymour:. Conjecture. If F is an intersecting hypergraph on n vertices, then there is a set of n pairs of vertices such that each member of F contains one of the pairs.

UR - https://www.scopus.com/pages/publications/0010764904

U2 - 10.1016/0097-3165(94)90109-0

DO - 10.1016/0097-3165(94)90109-0

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0010764904

SN - 0097-3165

VL - 68

SP - 317

EP - 339

JO - Journal of Combinatorial Theory. Series A

JF - Journal of Combinatorial Theory. Series A

IS - 2

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this