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 条

[41] The degree and codegree threshold for linear triangle covering in 3-graphs
Tang, Yuxuan
Ma, Yue
Hou, Xinmin
ELECTRONIC JOURNAL OF COMBINATORICS, 2023, 30 (04):
[42] A NOTE ON A TURAN-TYPE EXTREMAL QUESTION ON 3-GRAPHS
Szecsi, Vajk
STUDIA SCIENTIARUM MATHEMATICARUM HUNGARICA, 2014, 51 (01) : 24 - 26
[43] On the Largest Graph-Lagrangian of 3-Graphs with Fixed Number of Edges
Sun, Yanping
Tang, Qingsong
Zhao, Cheng
Peng, Yuejian
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2014, 163 (01) : 57 - 79
[44] On the Largest Graph-Lagrangian of 3-Graphs with Fixed Number of Edges
Yanping Sun
Qingsong Tang
Cheng Zhao
Yuejian Peng
Journal of Optimization Theory and Applications, 2014, 163 : 57 - 79
[45] TIGHT CODEGREE CONDITION FOR THE EXISTENCE OF LOOSE HAMILTON CYCLES IN 3-GRAPHS
Czygrinow, Andrzej
Molla, Theodore
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2014, 28 (01) : 67 - 76
[46] THE SEQUENTIAL GENERATION OF RANDOM F-GRAPHS - LINE MAXIMAL 2-GRAPHS, 3-GRAPHS AND 4-GRAPHS
BALINSKA, KT
QUINTAS, LV
COMPUTERS & CHEMISTRY, 1990, 14 (04): : 323 - 328
[47] On D. G. Higman's note on regular 3-graphs
Kalmanovich, Daniel
ARS MATHEMATICA CONTEMPORANEA, 2013, 6 (01) : 99 - 115
[48] Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
Han, Jie
Zang, Chuanyun
Zhao, Yi
JOURNAL OF COMBINATORIAL THEORY SERIES A, 2017, 149 : 115 - 147
[49] An expected polynomial time algorithm for coloring 2-colorable 3-graphs
Person, Yury
Schacht, Mathias
DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2011, 13 (02): : 1 - 18
[50] TIGHT MINIMUM DEGREE CONDITION FOR THE EXISTENCE OF LOOSE CYCLE TILINGS IN 3-GRAPHS
Oursler, Roy
Czygrinow, Andrzej
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2019, 33 (04) : 1912 - 1931

← 1 2 3 4 5 →