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: [Place of publication not identified] : DIMACS, Center for Discrete Mathematics and Theoretical Computer Science, [1992]
Series: DIMACS technical report, 92-59.
Edition/Format:   Print 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 pages ; 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


Primary Entity

<http://www.worldcat.org/oclc/33450666> # A problem of Füredi and Seymour on covering intersecting families by pairs
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "33450666" ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/37431822#Place/place_of_publication_not_identified> ; # Place of publication not identified
   schema:about <http://id.worldcat.org/fast/965761> ; # Hypergraphs
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://viaf.org/viaf/19856707> ; # Gil Kalai
   schema:creator <http://viaf.org/viaf/6521393> ; # Jeffrey A. Kahn
   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.""@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/37431822> ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://experiment.worldcat.org/entity/work/data/37431822#Series/dimacs_technical_report> ; # DIMACS technical report ;
   schema:name "A problem of Füredi and Seymour on covering intersecting families by pairs"@en ;
   schema:productID "33450666" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/33450666#PublicationEvent/place_of_publication_not_identified_dimacs_center_for_discrete_mathematics_and_theoretical_computer_science_1992> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/37431822#Agent/dimacs_center_for_discrete_mathematics_and_theoretical_computer_science> ; # DIMACS, Center for Discrete Mathematics and Theoretical Computer Science
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/33450666> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/37431822#Agent/dimacs_center_for_discrete_mathematics_and_theoretical_computer_science> # DIMACS, Center for Discrete Mathematics and Theoretical Computer Science
    a bgn:Agent ;
   schema:name "DIMACS, Center for Discrete Mathematics and Theoretical Computer Science" ;
    .

<http://experiment.worldcat.org/entity/work/data/37431822#Place/place_of_publication_not_identified> # Place of publication not identified
    a schema:Place ;
   schema:name "Place of publication not identified" ;
    .

<http://experiment.worldcat.org/entity/work/data/37431822#Series/dimacs_technical_report> # DIMACS technical report ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/33450666> ; # A problem of Füredi and Seymour on covering intersecting families by pairs
   schema:name "DIMACS technical report ;" ;
    .

<http://id.worldcat.org/fast/965761> # Hypergraphs
    a schema:Intangible ;
   schema:name "Hypergraphs"@en ;
    .

<http://viaf.org/viaf/19856707> # Gil Kalai
    a schema:Person ;
   schema:birthDate "1955" ;
   schema:familyName "Kalai" ;
   schema:givenName "Gil" ;
   schema:name "Gil Kalai" ;
    .

<http://viaf.org/viaf/6521393> # Jeffrey A. Kahn
    a schema:Person ;
   schema:familyName "Kahn" ;
   schema:givenName "Jeffrey A." ;
   schema:name "Jeffrey A. Kahn" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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