Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Brace, Alan
and
Daykin, D.E.
1972.
A finite set covering theorem II.
Bulletin of the Australian Mathematical Society,
Vol. 6,
Issue. 1,
p.
19.
Brace, Alan
and
Daykin, D.E.
1972.
A finite set covering theorem III.
Bulletin of the Australian Mathematical Society,
Vol. 6,
Issue. 3,
p.
417.
Frankl, Peter
1979.
Families of finite sets satisfying a union condition.
Discrete Mathematics,
Vol. 26,
Issue. 2,
p.
111.
Frankl, Peter
1981.
Regularity conditions and intersecting hypergraphs.
Proceedings of the American Mathematical Society,
Vol. 82,
Issue. 2,
p.
309.
Daykin, David E.
and
Häggkvist, Roland
1981.
Degrees giving independent edges in a hypergraph.
Bulletin of the Australian Mathematical Society,
Vol. 23,
Issue. 1,
p.
103.
Daykin, David E.
and
Frankl, Peter
1982.
Sets of finite sets satisfying union conditions.
Mathematika,
Vol. 29,
Issue. 1,
p.
128.
West, Douglas B.
1982.
Ordered Sets.
p.
473.
Füredi, Z.
1986.
t-expansive andt-wise intersecting hypergraphs.
Graphs and Combinatorics,
Vol. 2,
Issue. 1,
p.
67.
Füredi, Zoltán
1988.
Matchings and covers in hypergraphs.
Graphs and Combinatorics,
Vol. 4,
Issue. 1,
p.
115.
Tzouvaras, Athanassios
1991.
A Note on Real Subsets of A Recursively Saturated Model.
Mathematical Logic Quarterly,
Vol. 37,
Issue. 13-16,
p.
207.
Frankl, P
1991.
Multiply-intersecting families.
Journal of Combinatorial Theory, Series B,
Vol. 53,
Issue. 2,
p.
195.
Tokushige, Norihide
2007.
Multiply-intersecting families revisited.
Journal of Combinatorial Theory, Series B,
Vol. 97,
Issue. 6,
p.
929.
Tokushige, Norihide
2007.
An extension of the Erdős–Ko–Rado Theorem.
Electronic Notes in Discrete Mathematics,
Vol. 28,
Issue. ,
p.
117.
Tokushige, Norihide
2008.
Horizons of Combinatorics.
Vol. 17,
Issue. ,
p.
215.
Tokushige, Norihide
2008.
Brace–Daykin type inequalities for intersecting families.
European Journal of Combinatorics,
Vol. 29,
Issue. 1,
p.
273.
Tokushige, Norihide
2010.
A multiply intersecting Erdős–Ko–Rado theorem — The principal case.
Discrete Mathematics,
Vol. 310,
Issue. 3,
p.
453.
Siggers, Mark
and
Tokushige, Norihide
2012.
The maximum size of intersecting and union families of sets.
European Journal of Combinatorics,
Vol. 33,
Issue. 2,
p.
128.
Frankl, Peter
and
Tokushige, Norihide
2016.
Invitation to intersection problems for finite sets.
Journal of Combinatorial Theory, Series A,
Vol. 144,
Issue. ,
p.
157.
Lángi, Zsolt
Naszódi, Márton
Pach, János
Tardos, Gábor
and
Tóth, Géza
2016.
Separation with restricted families of sets.
Journal of Combinatorial Theory, Series A,
Vol. 144,
Issue. ,
p.
292.
Frankl, Peter
2019.
Some exact results for multiply intersecting families.
Journal of Combinatorial Theory, Series B,
Vol. 136,
Issue. ,
p.
222.