A structural result for 3-graphs

被引：1

作者：

Frankl, P. ^{[1
]}

机构：

[1] Renyi Inst, Budapest, Hungary

来源：

DISCRETE MATHEMATICS | 2017年 / 340卷 / 05期

关键词：

Hypergraphs; Forbidden configurations; Extremal problems; ERDOS-KO-RADO; THEOREM; SETS;

D O I：

10.1016/j.disc.2016.09.036

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Suppose that F subset of (([n])(3)) contains no three sets whose intersection is empty and their union has size at most 6. We prove a structure theorem for such families which easily implies the best possible bound, |F| <= ((n-1)(2)). (C) 2016 Elsevier B.V. All rights reserved.

引用

页码：1039 / 1041

页数：3

共 7 条

[1] ON GENERALIZED GRAPHS
BOLLOBAS, B
[J]. ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE, 1965, 16 (3-4): : 447 - &
[2] SPERNER FAMILIES SATISFYING AN ADDITIONAL CONDITION
FRANKL, P
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 1976, 20 (01) : 1 - 11
[3] A NEW GENERALIZATION OF THE ERDOS-KO-RADO THEOREM
FRANKL, P
FUREDI, Z
[J]. COMBINATORICA, 1983, 3 (3-4) : 341 - 349
[4] Frankl P., 1987, Surveys in combinatorics 1987 (New Cross, 1987), V123, P81
[5] Erdos-Ko-Rado for three sets
Mubayi, D
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES A, 2006, 113 (03) : 547 - 550
[6] An intersection theorem for four sets
Mubayi, Dhruv
[J]. ADVANCES IN MATHEMATICS, 2007, 215 (02) : 601 - 615
[7] Set systems with union and intersection constraints
Mubayi, Dhruv
Ramadurai, Reshma
[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2009, 99 (03) : 639 - 642

← 1 →