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

共 50 条

[1] AN EXACT RESULT FOR 3-GRAPHS
FRANKL, P
FUREDI, Z
DISCRETE MATHEMATICS, 1984, 50 (2-3) : 323 - 328
[2] An exact Turan result for tripartite 3-graphs
Sanitt, Adam
Talbot, John
ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (04):
[3] Cycles in Oriented 3-Graphs
Leader, Imre
Tan, Ta Sheng
DISCRETE & COMPUTATIONAL GEOMETRY, 2015, 54 (02) : 432 - 443
[4] Spanning surfaces in 3-graphs
Georgakopoulos, Agelos
Haslegrave, John
Montgomery, Richard
Narayanan, Bhargav
JOURNAL OF THE EUROPEAN MATHEMATICAL SOCIETY, 2022, 24 (01) : 303 - 339
[5] WQO dichotomy for 3-graphs
Lasota, Slawomir
Piorkowski, Radoslaw
INFORMATION AND COMPUTATION, 2020, 275
[6] EXTREMAL PROBLEM FOR 3-GRAPHS
FRANKL, P
ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE, 1978, 32 (1-2): : 157 - 160
[7] On partition functions for 3-graphs
Regts, Guus
Schrijver, Alexander
Sevenster, Bart
JOURNAL OF COMBINATORIAL THEORY SERIES B, 2016, 121 : 421 - 431
[8] WQO Dichotomy for 3-Graphs
Lasota, Slawomir
Piorkowski, Radoslaw
FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES, FOSSACS 2018, 2018, 10803 : 548 - 564
[9] Cycles in Oriented 3-Graphs
Imre Leader
Ta Sheng Tan
Discrete & Computational Geometry, 2015, 54 : 432 - 443
[10] UNAVOIDABLE STARS IN 3-GRAPHS
CHUNG, FRK
JOURNAL OF COMBINATORIAL THEORY SERIES A, 1983, 35 (03) : 252 - 262

← 1 2 3 4 5 →