Intersecting Families of Finite Sets and Fixed-point-Free 2-Elements

P. J. Cameron; P. Frankl; W. M. Kantor

doi:10.1016/S0195-6698(89)80042-3

Intersecting Families of Finite Sets and Fixed-point-Free 2-Elements

P. J. Cameron^*, P. Frankl, W. M. Kantor

^*Corresponding author for this work

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

Abstract

We study the maximum cardinality of a pairwise-intersecting family of subsets of an n-set, or the size of the smallest set in such a family, under either of the assumptions that it is regular (as a hypergraph) or that it admits a transitive permutation group. Not surprisingly, results under the second assumption are stronger. We also give some results for 4-wise intersecting families under the same assumptions.

Original language	English
Pages (from-to)	149-160
Number of pages	12
Journal	European Journal of Combinatorics
Volume	10
Issue number	2
DOIs	https://doi.org/10.1016/S0195-6698(89)80042-3
Publication status	Published - 1 Jan 1989

Access to Document

10.1016/S0195-6698(89)80042-3

Cite this

@article{186d681ec2624c138426ab232d35137d,

title = "Intersecting Families of Finite Sets and Fixed-point-Free 2-Elements",

abstract = "We study the maximum cardinality of a pairwise-intersecting family of subsets of an n-set, or the size of the smallest set in such a family, under either of the assumptions that it is regular (as a hypergraph) or that it admits a transitive permutation group. Not surprisingly, results under the second assumption are stronger. We also give some results for 4-wise intersecting families under the same assumptions.",

author = "Cameron, \{P. J.\} and P. Frankl and Kantor, \{W. M.\}",

year = "1989",

month = jan,

day = "1",

doi = "10.1016/S0195-6698(89)80042-3",

language = "English",

volume = "10",

pages = "149--160",

journal = "European Journal of Combinatorics",

issn = "0195-6698",

publisher = "Academic Press/Elsevier ",

number = "2",

}

TY - JOUR

T1 - Intersecting Families of Finite Sets and Fixed-point-Free 2-Elements

AU - Cameron, P. J.

AU - Frankl, P.

AU - Kantor, W. M.

PY - 1989/1/1

Y1 - 1989/1/1

N2 - We study the maximum cardinality of a pairwise-intersecting family of subsets of an n-set, or the size of the smallest set in such a family, under either of the assumptions that it is regular (as a hypergraph) or that it admits a transitive permutation group. Not surprisingly, results under the second assumption are stronger. We also give some results for 4-wise intersecting families under the same assumptions.

AB - We study the maximum cardinality of a pairwise-intersecting family of subsets of an n-set, or the size of the smallest set in such a family, under either of the assumptions that it is regular (as a hypergraph) or that it admits a transitive permutation group. Not surprisingly, results under the second assumption are stronger. We also give some results for 4-wise intersecting families under the same assumptions.

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

U2 - 10.1016/S0195-6698(89)80042-3

DO - 10.1016/S0195-6698(89)80042-3

M3 - Article

AN - SCOPUS:0001081224

SN - 0195-6698

VL - 10

SP - 149

EP - 160

JO - European Journal of Combinatorics

JF - European Journal of Combinatorics

IS - 2

ER -

Intersecting Families of Finite Sets and Fixed-point-Free 2-Elements

Abstract

Access to Document

Other files and links

Fingerprint

Cite this