skip to content
A problem of Füredi and Seymour on covering intersecting families by pairs Preview this item
ClosePreview this item
Checking...

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

Author: Jeffrey A Kahn; Gil Kalai
Publisher: [S.l.] : DIMACS, Center for Discrete Mathematics and Theoretical Computer Science, [1992]
Series: DIMACS technical report, 92-59.
Edition/Format:   Book : English
Database:WorldCat
Summary:
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."
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Jeffrey A Kahn; Gil Kalai
OCLC Number: 33450666
Notes: "December, 1992."
Description: 23 p. ; 28 cm.
Series Title: DIMACS technical report, 92-59.
Responsibility: by Jeff Kahn and Gil Kalai.

Abstract:

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."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/33450666>
library:oclcnum"33450666"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/33450666>
rdf:typeschema:Book
rdfs:seeAlso
schema:about
schema:about
schema:author
schema:contributor
schema:datePublished"1992"
schema:description"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.""
schema:exampleOfWork<http://worldcat.org/entity/work/id/37431822>
schema:inLanguage"en"
schema:name"A problem of Füredi and Seymour on covering intersecting families by pairs"
schema:numberOfPages"23"
schema:publisher
rdf:typeschema:Organization
schema:name"DIMACS, Center for Discrete Mathematics and Theoretical Computer Science"

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.