Turán numbers for 3-uniform linear paths of length 3
From MaRDI portal
Publication:286115
zbMath1336.05142arXiv1506.03759MaRDI QIDQ286115
Andrzej Ruciński, Joanna Polcyn, Eliza Jackowska
Publication date: 20 May 2016
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.03759
Hypergraphs (05C65) Paths and cycles (05C38) Extremal set theory (05D05) Distance in graphs (05C12) Triple systems (05B07)
Related Items (10)
Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three ⋮ Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three ⋮ Turán and Ramsey numbers for 3‐uniform minimal paths of length 4 ⋮ On Multicolor Ramsey Numbers of Triple System Paths of Length 3 ⋮ The multipartite Ramsey number for the 3-path of length three ⋮ \(k\)-centric Turán numbers and multi-color Ramsey numbers for a loose 3-uniform path of length 3 ⋮ On the multicolor Ramsey number for 3-paths of length three ⋮ One more Turán number and Ramsey number for the loose 3-uniform path of length three ⋮ Anti-Ramsey Numbers of Paths and Cycles in Hypergraphs ⋮ Paths in Hypergraphs: A Rescaling Phenomenon
Cites Work
- Unnamed Item
- Unnamed Item
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
- Turán problems and shadows. I: Paths and cycles
- Non-trivial intersecting families
- Exact solution of some Turán-type problems
- A homological approach to two problems on finite sets
- Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three
- Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three
- On the non-(p-1)-partite K_{p}-free graphs
- Turán Numbers for Forests of Paths in Hypergraphs
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
This page was built for publication: Turán numbers for 3-uniform linear paths of length 3
