Multicolor Ramsey numbers for triple systems
From MaRDI portal
Publication:2436825
DOI10.1016/j.disc.2014.01.004zbMath1283.05038arXiv1302.5304OpenAlexW1989462063MaRDI QIDQ2436825
Dhruv Mubayi, Hong Liu, András Gyárfás, Maria A. Axenovich
Publication date: 27 February 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.5304
Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Triple systems (05B07)
Related Items (11)
Off-diagonal hypergraph Ramsey numbers ⋮ Boolean lattices: Ramsey properties and embeddings ⋮ On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs ⋮ List Ramsey numbers ⋮ Turán and Ramsey numbers for 3‐uniform minimal paths of length 4 ⋮ On Multicolor Ramsey Numbers of Triple System Paths of Length 3 ⋮ \(k\)-centric Turán numbers and multi-color Ramsey numbers for a loose 3-uniform path of length 3 ⋮ The Boolean rainbow Ramsey number of antichains, Boolean posets and chains ⋮ On multicolor Ramsey numbers for loose \(k\)-paths of length three ⋮ Gallai-colorings of triples and 2-factors of \(\mathcal{B}_3\) ⋮ The Ramsey number of 3-uniform loose path versus star
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved bound for the stepping-up lemma
- The Ramsey number of loose triangles and quadrangles in hypergraphs
- New lower bounds for Ramsey numbers of graphs and hypergraphs
- Kneser's conjecture, chromatic number, and homotopy
- On large sets of disjoint Steiner triple systems. IV
- Asymptotic behavior of the chromatic index for hypergraphs
- Exact solution of some Turán-type problems
- A completion of Lu's determination of the spectrum for large sets of disjoint Steiner triple systems
- Partitioning the planes of \(AG_{2m}(2)\) into 2-designs
- Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\)
- On extremal problems of graphs and generalized graphs
- The Existence and Construction of Balanced Incomplete Block Designs
- Hypergraph Ramsey numbers
- The Chromatic Number of Kneser Hypergraphs
- Extremal problems for triple systems
- A Balanced Incomplete Block Design
- On t-Designs and Groups
- Resolvable Steiner Quadruple Systems for the Last 23 Orders
- Partition relations for cardinal numbers
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- Lower bounds for some Ramsey numbers
- A construction for infinite families of Steiner 3-designs
This page was built for publication: Multicolor Ramsey numbers for triple systems
