Monochromatic loose paths in multicolored k-uniform cliques

  title={Monochromatic loose paths in multicolored k-uniform cliques},
  author={Andrzej Dudek and Andrzej Rucinski},
  journal={Discret. Math. Theor. Comput. Sci.},
For positive integers $k$ and $\ell$, a $k$-uniform hypergraph is called a \emph{loose path of length~$\ell$}, and denoted by $P_\ell^{(k)}$, if it consists of $\ell $ edges $e_1,\dots,e_\ell$ such that $|e_i\cap e_j|=1$ if $|i-j|=1$ and $e_i\cap e_j=\emptyset$ if $|i-j|\ge2$. In other words, each pair of consecutive edges intersects on a single vertex, while all other pairs are disjoint. Let $R(P_\ell^{(k)};r)$ be the minimum integer $n$ such that every $r$-edge-coloring of the complete $k… 

Figures from this paper


Diagonal Ramsey Numbers of Loose Cycles in Uniform Hypergraphs
This paper investigates to determining the exact value of diagonal Ramsey number of $\mathcal{C}^k_n$ and shows that for $n\geq 2$ and $k \geq 8$ the Ramsey number is R(k-1)n+\lfloor\frac{n-1}{2}\rfloor.
On some Multicolor Ramsey Properties of Random Graphs
It is shown that $5n/2-15/2 \le \hat{R}(P_n) \le 74n$ for $n$ sufficiently large, which improves the previous lower bound and improves the upper bound.
Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three
Constructive Ramsey Numbers for Loose Hyperpaths
For positive integers k and \(\ell \), a k-uniform hypergraph is called a loose path of length \(\ell \), and denoted by \(P_\ell ^{(k)}\), if its vertex set is \(\{v_1, v_2, \ldots , v_{(k-1)\ell
The Ramsey Number of Loose Triangles and Quadrangles in Hypergraphs
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.
On the Multi-Colored Ramsey Numbers of Paths and Even Cycles
The upper bound on the multi-color Ramsey numbers of paths and even cycles is improved and a stability version of the Erdős-Gallai theorem is introduced that may be of independent interest.
Turán Numbers for 3-Uniform Linear Paths of Length 3
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.
Exact solution of the hypergraph Turán problem for k-uniform linear paths
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.
Three-Color Ramsey Numbers For Paths
It is proved that for sufficiently large n, for the three-color Ramsey numbers of paths on n vertices, the following conjecture of Faudree and Schelp is proved.
An Alternative Proof of the Linearity of the Size-Ramsey Number of Paths
This note provides another proof of this fact that actually gives a better bound, namely, $\^{r} $(Pn) < 137n for n sufficiently large.