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

Research output: Contribution to journalArticlepeer-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 languageEnglish
Pages (from-to)460-498
Number of pages39
JournalJournal of Graph Theory
Volume98
Issue number3
DOIs
Publication statusPublished - Nov 2021

Keywords

  • Ramsey number
  • Turán number
  • hypergraphs
  • paths

Fingerprint

Dive into the research topics of 'Turán and Ramsey numbers for 3-uniform minimal paths of length 4'. Together they form a unique fingerprint.

Cite this