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 | |
Publication status | Published - Nov 2021 |
Keywords
- Ramsey number
- Turán number
- hypergraphs
- paths