Turan and Ramsey numbers for 3-uniform minimal paths of length 4

被引：0
|
作者：
Han, Jie [1 ]
Polcyn, Joanna [2 ]
Rucinski, Andrzej [2 ]
机构：
[1] Beijing Inst Technol, Sch Math & Stat, 5 South Zhongguancun St, Beijing, Peoples R China
[2] Adam Mickiewicz Univ, Fac Math & Comp Sci, Ul Uniwersytetu Poznanskiego 4, Poznan, Poland
来源：
JOURNAL OF GRAPH THEORY | 2021年 / 98卷 / 03期
关键词：
hypergraphs; paths; Ramsey number; Turan number; INTERSECTION-THEOREMS; SYSTEMS;
D O I：
10.1002/jgt.22709
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We determine Turan numbers for the family of 3-uniform minimal paths of length four for all n. We also establish the second- and third-order Turan numbers and use them to compute the corresponding Ramsey numbers for up to four colors.
引用
收藏
页码：460 / 498
页数：39
相关论文
共 31 条
1234