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 条
  • [21] Ramsey numbers of 4-uniform loose cycles
    Omidi, G. R.
    Shahsiah, M.
    DISCRETE APPLIED MATHEMATICS, 2017, 230 : 112 - 120
  • [22] Asymptotic Turan number for linear 5-cycle in 3-uniform linear hypergraphs
    Gao, Guorong
    Chang, An
    Sun, Qi
    DISCRETE MATHEMATICS, 2023, 346 (01)
  • [23] Anti-Ramsey Numbers of Cycles of Length Three in Uniform Hypergraphs
    Tang, Yu-cong
    Li, Tong
    ACTA MATHEMATICAE APPLICATAE SINICA-ENGLISH SERIES, 2022,
  • [24] Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs
    Bazin, Alexandre
    Beaudou, Laurent
    Kahn, Giacomo
    Khoshkhah, Kaveh
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2021, 23 (02)
  • [25] Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs
    Bazin A.
    Beaudou L.
    Kahn G.
    Khoshkhah K.
    Discrete Mathematics and Theoretical Computer Science, 2023, 23 (02)
  • [26] On Decompositions of Complete 3-Uniform Hypergraphs into a Linear Forest with 4 Edges
    Bunge, Ryan C.
    Dawson, Erin
    Donovan, Mary
    Hatzer, Cody
    Maass, Jacquelyn
    COMBINATORICS, GRAPH THEORY AND COMPUTING, SEICCGTC 2021, 2024, 448 : 333 - 354
  • [27] THE RAMSEY NUMBERS OF LINEAR FOREST VERSUS 3K(3) boolean OR 2K(4)
    Sudarsana, I.
    Baskoro, E.
    Assiyatun, H.
    Uttunggadewa, S.
    JOURNAL OF THE INDONESIAN MATHEMATICAL SOCIETY, 2009, 15 (01) : 61 - 67
  • [28] The anti-Ramsey numbers of C3 and C4 in complete r-partite graphs
    Fang, Chunqiu
    Gyori, Ervin
    Li, Binlong
    Xiao, Jimeng
    DISCRETE MATHEMATICS, 2021, 344 (11)
  • [29] Ramsey Numbers of C4\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$C_4$$\end{document} versus Wheels and Stars
    Yali Wu
    Yongqi Sun
    Rui Zhang
    Stanisław P. Radziszowski
    Graphs and Combinatorics, 2015, 31 (6) : 2437 - 2446
  • [30] The equivalence of the Szemerédi and Petruska conjecture and the maximum order of 3-uniform τ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\tau $$\end{document}-critical hypergraphs
    André E. Kézdy
    Jenő Lehel
    European Journal of Mathematics, 2023, 9 (3)
1234