Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three

@article{Polcyn2017RefinedTN,
  title={Refined Tur{\'a}n numbers and Ramsey numbers for the loose 3-uniform path of length three},
  author={Joanna Polcyn and Andrzej Rucinski},
  journal={Discret. Math.},
  year={2017},
  volume={340},
  pages={107-118}
}

Figures from this paper

Turán Numbers for 3-Uniform Linear Paths of Length 3
TLDR
A `conditional' Tur\'an number is determined, defined as the maximum number of edges in a $P^3_3$-free 3-uniform hypergraph on $n$ vertices which is \emph{not} $C^3-3 $-free.
One More Turán Number and Ramsey Number for the Loose 3-Uniform Path of Length Three
TLDR
This paper refined this analysis further and compute the fifth order Turán number for P, for all n, and confirms the formula R(P; 10) = 16.
On multicolor Ramsey numbers of triple system paths of length 3
Let $\mathcal{H}$ be a 3-uniform hypergraph. The multicolor Ramsey number $ r_k(\mathcal{H})$ is the smallest integer $n$ such that every coloring of $ \binom{[n]}{3}$ with $k$ colors has a
Monochromatic loose paths in multicolored k-uniform cliques
TLDR
There is an algorithm such that for every $r$-edge-coloring of the edges of the complete $k$-uniform hypergraph, it finds a monochromatic copy of P_\ell^{(k)}$ in time at most $cn^k$.
A survey of quantitative bounds for hypergraph Ramsey problems
The classical hypergraph Ramsey number $r_k(s,n)$ is the minimum $N$ such that for every red-blue coloring of the $k$-tuples of $\{1,\ldots, N\}$, there are $s$ integers such that every $k$-tuple
A Survey of Hypergraph Ramsey Problems
The classical hypergraph Ramsey number $r_k(s,n)$ is the minimum $N$ such that for every red-blue coloring of the $k$-tuples of $\{1,\ldots, N\}$, there are $s$ integers such that every $k$-tuple
The multipartite Ramsey number for the 3-path of length three
On the Multicolor Ramsey Number for 3-Paths of Length Three
We show that if we color the hyperedges of the complete $3$-uniform complete graph on $2n+\sqrt{18n+1}+2$ vertices with $n$ colors, then one of the color classes contains a loose path of length three.
Turán and Ramsey numbers for 3‐uniform minimal paths of length 4
TLDR
The second and third order Turan numbers are established and used to compute the corresponding Ramsey numbers for up to four colors.
...
...

References

SHOWING 1-10 OF 17 REFERENCES
Multicolor Ramsey Numbers and Restricted Turán Numbers for the Loose 3-Uniform Path of Length Three
TLDR
The largest number of edges in an $n$-vertex $P$-free 3-graph which is not a star is determined, which allows us to confirm the Tur\'an type formula, R(P;r) + 6 for r in 4,5,6,7.
The Ramsey Number of Loose Triangles and Quadrangles in Hypergraphs
TLDR
The 2-color hypergraph Ramsey number of a $k$-uniform loose 3-cycle or 4-cycleHypergraph Ramsey numbers for loose cycles (and paths) were determined recently.
Exact solution of the hypergraph Turán problem for k-uniform linear paths
TLDR
The intensive use of the delta-system method is used to determine exk(n, Pℓ(k) exactly for all fixed ℓ ≥1, k≥4, and sufficiently large n, and describe the unique extremal family.
The 3-colored Ramsey number for a 3-uniform loose path of length 3
The values of hypergraph 2-color Ramsey numbers for loose cycles and paths have already been determined. The only known value for more than 2 colors is R(C 3 ; 3) = 8, where C 3 3 is a 3-uniform
Turán problems and shadows I: Paths and cycles
The maximum size of a non-trivial intersecting uniform family that is not a subfamily of the Hilton--Milner family
The celebrated Erdős-Ko-Rado theorem determines the maximum size of a $k$-uniform intersecting family. The Hilton-Milner theorem determines the maximum size of a $k$-uniform intersecting family that
INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
2. Notation The letters a, b, c, d, x, y, z denote finite sets of non-negative integers, all other lower-case letters denote non-negative integers. If fc I, then [k, I) denotes the set
Ramsey numbers of 3-uniform loose paths and loose cycles
Exact solution of some Turán-type problems
Intersection Theorems for Systems of Sets
A version of Dirichlet's box argument asserts that given a positive integer a and any a2 +1 objects x0 , x1 , . . ., xa 2, there are always a+1 distinct indices v (0 < v < a 2) such that the
...
...