The Ramsey number of loose paths in 3-uniform hypergraphs (Q1953390): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Gholam Reza Omidi / rank | |||
| Property / author | |||
| Property / author: Gholam Reza Omidi / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1209.4159 / rank | |||
Normal rank | |||
Latest revision as of 23:04, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Ramsey number of loose paths in 3-uniform hypergraphs |
scientific article |
Statements
The Ramsey number of loose paths in 3-uniform hypergraphs (English)
0 references
7 June 2013
0 references
Summary: Recently, asymptotic values of 2-color Ramsey numbers for loose cycles and also loose paths were determined. Here we determine the 2-color Ramsey number of 3-uniform loose paths when one of the paths is significantly larger than the other: for every \(n\geq \Big\lfloor\frac{5m}{4}\Big\rfloor\), we show that \[ R(\mathcal{P}^3_n,\mathcal{P}^3_m)=2n+\Big\lfloor\frac{m+1}{2}\Big\rfloor. \]
0 references
Ramsey number
0 references
loose path
0 references
loose cycle
0 references
