Turán and Ramsey numbers for 3-uniform minimal paths of length 4

Jie Han; Joanna Polcyn; Andrzej Ruciński

doi:10.1002/jgt.22709

Turán and Ramsey numbers for 3-uniform minimal paths of length 4

Jie Han^*
, Joanna Polcyn
, Andrzej Ruciński

^*Corresponding author for this work

School of Mathematics and Statistics

Adam Mickiewicz University in Poznań

Research output: Contribution to journal › Article › peer-review

Abstract

We determine Turán numbers for the family of 3-uniform minimal paths of length four for all (Formula presented.). We also establish the second- and third-order Turán numbers and use them to compute the corresponding Ramsey numbers for up to four colors.

Original language	English
Pages (from-to)	460-498
Number of pages	39
Journal	Journal of Graph Theory
Volume	98
Issue number	3
DOIs	https://doi.org/10.1002/jgt.22709
Publication status	Published - Nov 2021

Keywords

Ramsey number
Turán number
hypergraphs
paths

Access to Document

10.1002/jgt.22709

Cite this

@article{7145173958d0498cb780b0a7f58812f8,

title = "Tur{\'a}n and Ramsey numbers for 3-uniform minimal paths of length 4",

abstract = "We determine Tur{\'a}n numbers for the family of 3-uniform minimal paths of length four for all (Formula presented.). We also establish the second- and third-order Tur{\'a}n numbers and use them to compute the corresponding Ramsey numbers for up to four colors.",

keywords = "Ramsey number, Tur{\'a}n number, hypergraphs, paths",

author = "Jie Han and Joanna Polcyn and Andrzej Ruci{\'n}ski",

note = "Publisher Copyright: {\textcopyright} 2021 Wiley Periodicals LLC",

year = "2021",

month = nov,

doi = "10.1002/jgt.22709",

language = "English",

volume = "98",

pages = "460--498",

journal = "Journal of Graph Theory",

issn = "0364-9024",

publisher = "Wiley-Liss Inc.",

number = "3",

}

TY - JOUR

T1 - Turán and Ramsey numbers for 3-uniform minimal paths of length 4

AU - Han, Jie

AU - Polcyn, Joanna

AU - Ruciński, Andrzej

PY - 2021/11

Y1 - 2021/11

N2 - We determine Turán numbers for the family of 3-uniform minimal paths of length four for all (Formula presented.). We also establish the second- and third-order Turán numbers and use them to compute the corresponding Ramsey numbers for up to four colors.

AB - We determine Turán numbers for the family of 3-uniform minimal paths of length four for all (Formula presented.). We also establish the second- and third-order Turán numbers and use them to compute the corresponding Ramsey numbers for up to four colors.

KW - Ramsey number

KW - Turán number

KW - hypergraphs

KW - paths

UR - https://www.scopus.com/pages/publications/85111549700

U2 - 10.1002/jgt.22709

DO - 10.1002/jgt.22709

M3 - Article

AN - SCOPUS:85111549700

SN - 0364-9024

VL - 98

SP - 460

EP - 498

JO - Journal of Graph Theory

JF - Journal of Graph Theory

IS - 3

ER -

Turán and Ramsey numbers for 3-uniform minimal paths of length 4

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this