The Ramsey Number of Loose Triangles and Quadrangles in Hypergraphs

  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.},
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
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
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
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
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.
Cover k-Uniform Hypergraphs by Monochromatic Loose Paths
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
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$.


The Ramsey Number of Diamond-Matchings and Loose Cycles in Hypergraphs
It is proved that for $r\ge 2$, the corresponding Ramsey number is asymptotic to ${(2r-1)n\over 2r-2}$.
The Ramsey number for hypergraph cycles I
All Ramsey numbers for cycles in graphs
Ramsey Numbers Involving Cycles
Graham, Rothschild and Spencer in their book, Ramsey Theory [GRS] and Soifer in the 2009 The Mathematical Coloring Book, Mathematics of Coloring and the Colorful Life of Its Creators [Soi] present exciting developments in the history, results and people of Ramsey theory.
The Ramsey number for stripes
If G1,…,Gc are graphs without loops or multiple edges there is a smallest integer r(G1,…,Gc) such that if the edges of a complete graph Kn, with n ≧ r(G1,…,Gc), are painted arbitrarily with c colours
Path-cycle Ramsey numbers
On Ramsey-Type Problems
In this paper, we give a brief survey on four problems of Ramsey-type. The first and second problems are concerned about a sequence of numbers. The third one appears in discrete geometry and the
A Homological Approach to Two Problems on Finite Sets
We propose a homological approach to two conjectures descended from the Erdös-Ko-Rado Theorem, one due to Chvátal and the other to Frankl and Füredi. We apply the method to reprove, and in one case
Some Ramsey numbers for loose cycles and paths in 3-uniform hypergraphs, in preparation
  • Some Ramsey numbers for loose cycles and paths in 3-uniform hypergraphs, in preparation
Some Ramsey numbers for loose cycles and paths in 3uniform hypergraphs , in preparation