Uniform intersecting families with covering number four

Peter Frankl; Katsuhiro Ota; Norihide Tokushige

doi:10.1016/0097-3165(95)90020-9

Uniform intersecting families with covering number four

Peter Frankl, Katsuhiro Ota, Norihide Tokushige

Department of Mathematics

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

10 Citations (Scopus)

Abstract

We determine the maximum size of uniform intersecting families with covering number at least four. The unique extremal configuration turns out to be different from the one that was conjectured 12 years ago. At the same time it permits us to give a counterexample to a conjecture of Lovász.

Original language	English
Pages (from-to)	127-145
Number of pages	19
Journal	Journal of Combinatorial Theory, Series A
Volume	71
Issue number	1
DOIs	https://doi.org/10.1016/0097-3165(95)90020-9
Publication status	Published - 1995 Jul

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics

Access to Document

10.1016/0097-3165(95)90020-9

Cite this

@article{8e9e42e7cab44b2c8f296027fd5220a1,

title = "Uniform intersecting families with covering number four",

abstract = "We determine the maximum size of uniform intersecting families with covering number at least four. The unique extremal configuration turns out to be different from the one that was conjectured 12 years ago. At the same time it permits us to give a counterexample to a conjecture of Lov{\'a}sz.",

author = "Peter Frankl and Katsuhiro Ota and Norihide Tokushige",

year = "1995",

month = jul,

doi = "10.1016/0097-3165(95)90020-9",

language = "English",

volume = "71",

pages = "127--145",

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

issn = "0097-3165",

publisher = "Academic Press Inc.",

number = "1",

}

TY - JOUR

T1 - Uniform intersecting families with covering number four

AU - Frankl, Peter

AU - Ota, Katsuhiro

AU - Tokushige, Norihide

PY - 1995/7

Y1 - 1995/7

N2 - We determine the maximum size of uniform intersecting families with covering number at least four. The unique extremal configuration turns out to be different from the one that was conjectured 12 years ago. At the same time it permits us to give a counterexample to a conjecture of Lovász.

AB - We determine the maximum size of uniform intersecting families with covering number at least four. The unique extremal configuration turns out to be different from the one that was conjectured 12 years ago. At the same time it permits us to give a counterexample to a conjecture of Lovász.

UR - http://www.scopus.com/inward/record.url?scp=0011455406&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0011455406&partnerID=8YFLogxK

U2 - 10.1016/0097-3165(95)90020-9

DO - 10.1016/0097-3165(95)90020-9

M3 - Article

AN - SCOPUS:0011455406

SN - 0097-3165

VL - 71

SP - 127

EP - 145

JO - Journal of Combinatorial Theory, Series A

JF - Journal of Combinatorial Theory, Series A

IS - 1

ER -

Uniform intersecting families with covering number four

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this