One more Turán number and Ramsey number for the loose 3-uniform path of length three
From MaRDI portal
Publication:521762
DOI10.7151/dmgt.1940zbMath1359.05079arXiv1511.09073OpenAlexW2963038163MaRDI QIDQ521762
Publication date: 12 April 2017
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1511.09073
Related Items (8)
Constrained Ramsey numbers for the loose path, cycle and star ⋮ 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 ⋮ Unnamed Item ⋮ On the multicolor Ramsey number for 3-paths of length three ⋮ On multicolor Ramsey numbers for loose \(k\)-paths of length three
Cites Work
- Unnamed Item
- Turán numbers for 3-uniform linear paths of length 3
- Ramsey numbers of 3-uniform loose paths and loose cycles
- Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths
- The Ramsey number of loose triangles and quadrangles in hypergraphs
- 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
- The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton–Milner family
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A hierarchy of maximal intersecting triple systems
- SOME INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
This page was built for publication: One more Turán number and Ramsey number for the loose 3-uniform path of length three