# The Ramsey Number of Loose Triangles and Quadrangles in Hypergraphs

@article{Gyrfs2012TheRN,
title={The Ramsey Number of Loose Triangles and Quadrangles in Hypergraphs},
author={Andr{\'a}s Gy{\'a}rf{\'a}s and Ghaffar Raeisi},
journal={Electron. J. Comb.},
year={2012},
volume={19},
pages={30}
}
• Published 6 June 2012
• Mathematics
• Electron. J. Comb.
Asymptotic values of hypergraph Ramsey numbers for loose cycles (and paths) were determined recently. Here we determine some of them exactly, for example the 2-color hypergraph Ramsey number of a $k$-uniform loose 3-cycle or 4-cycle: $R(\mathcal{C}^k_3,\mathcal{C}^k_3)=3k-2$ and $R(\mathcal{C}_4^k,\mathcal{C}_4^k)=4k-3$ (for $k\geq 3$). For more than 3-colors we could prove only that $R(\mathcal{C}^3_3,\mathcal{C}^3_3,\mathcal{C}^3_3)=8$. Nevertheless, the $r$-color Ramsey number of triangles…
On multicolor Ramsey numbers of triple system paths of length 3
• Mathematics
• 2019
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
The Ramsey Number of Loose Paths in 3-Uniform Hypergraphs
• Mathematics
Electron. J. Comb.
• 2013
The 2-color Ramsey number of $3$-uniform loose paths when one of the paths is significantly larger than the other is determined.
Multicolor Ramsey Numbers and Restricted Turán Numbers for the Loose 3-Uniform Path of Length Three
• Mathematics
Electron. J. Comb.
• 2017
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.
Ramsey numbers of 4-uniform loose cycles
• Mathematics
Discret. Appl. Math.
• 2017
Diagonal Ramsey Numbers of Loose Cycles in Uniform Hypergraphs
• Mathematics
SIAM J. Discret. Math.
• 2017
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.
Cover k-Uniform Hypergraphs by Monochromatic Loose Paths
• Mathematics
Electron. J. Comb.
• 2017
It is shown that for every $2$-coloring of the edges of the complete $k-uniform hypergraph, one can find two monochromatic paths of distinct colors to cover all vertices of$\mathcal{K}_n^k$such that they share at most$ k-2$vertices. The Ramsey number of generalized loose paths in uniform Hypergrpahs Let$H=(V,E)$be an$r$-uniform hypergraph. For each$1 \leq s \leq r-1$, an$s$-path${\mathcal P}^{r,s}_n$of length$n$in$H$is a sequence of distinct vertices$v_1,v_2,\ldots,v_{s+n(r-s)}$such Monochromatic loose paths in multicolored k-uniform cliques • Mathematics Discret. Math. Theor. Comput. Sci. • 2019 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$.