The Ramsey number of loose triangles and quadrangles in hypergraphs
From MaRDI portal
Publication:426909
zbMATH Open1243.05161MaRDI QIDQ426909FDOQ426909
Authors: András Gyárfás, Ghaffar Raeisi
Publication date: 12 June 2012
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/EJC/ojs/index.php/eljc/article/view/v19i2p30
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cited In (29)
- Ramsey numbers of 3-uniform loose paths and loose cycles
- One more Turán number and Ramsey number for the loose 3-uniform path of length three
- The multipartite Ramsey number for the 3-path of length three
- The Ramsey number for hypergraph cycles. I.
- The Ramsey number of diamond-matchings and loose cycles in hypergraphs
- The Ramsey number of generalized loose paths in hypergraphs
- On Multicolor Ramsey Numbers of Triple System Paths of Length 3
- Hypergraph Ramsey numbers involving trees, stars, and complete hypergraphs
- Multicolor Ramsey numbers for triple systems
- On multicolor Ramsey numbers for loose \(k\)-paths of length three
- The Ramsey number of loose paths in 3-uniform hypergraphs
- The Ramsey number of loose cycles versus cliques
- Constrained Ramsey numbers for the loose path, cycle and star
- Turán and Ramsey numbers for 3‐uniform minimal paths of length 4
- Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three
- Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three
- Diagonal Ramsey numbers of loose cycles in uniform hypergraphs
- Ramsey numbers of 5-uniform loose cycles
- Ramsey numbers for multiple copies of hypergraphs
- Ramsey numbers of 4-uniform loose cycles
- Ramsey numbers of uniform loose paths and cycles
- The Ramsey number of 3-uniform loose path versus star
- Cover \(k\)-uniform hypergraphs by monochromatic loose paths
- On the multicolor Ramsey number for 3-paths of length three
- \(k\)-centric Turán numbers and multi-color Ramsey numbers for a loose 3-uniform path of length 3
- Hypergraph Ramsey numbers: triangles versus cliques
- The Ramsey number for 3-uniform tight hypergraph cycles
- Constructive Methods in Gallai-Ramsey Theory for Hypergraphs
- Corrections to ``The Ramsey numbers for a quadrilateral vs. all graphs on six vertices
This page was built for publication: The Ramsey number of loose triangles and quadrangles in hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q426909)