Constructive Methods in Gallai-Ramsey Theory for Hypergraphs
From MaRDI portal
Publication:5109420
zbMath1439.05149arXiv1902.01301MaRDI QIDQ5109420
Mark R. Budden, Josh Hiller, Andrew Penland
Publication date: 12 May 2020
Full work available at URL: https://arxiv.org/abs/1902.01301
Related Items (5)
Algebraic Properties of a Hypergraph Lifting Map ⋮ Multicolor star-critical Ramsey numbers and Ramsey-good graphs ⋮ On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs ⋮ Unnamed Item ⋮ Unnamed Item
Cites Work
- The lifting of graphs to 3-uniform hypergraphs and some applications to hypergraph Ramsey theory
- Ramsey numbers of 3-uniform loose paths and loose cycles
- The Ramsey number of loose triangles and quadrangles in hypergraphs
- Rainbow generalizations of Ramsey theory: A survey
- Edge-colored complete graphs with precisely colored subgraphs
- A note on embedding hypertrees
- The multipartite Ramsey number for the 3-path of length three
- On multicolor Ramsey numbers for loose \(k\)-paths of length three
- New lower bounds for Ramsey number \(R(p,q;4)\)
- The Erdős-Hajnal conjecture for rainbow triangles
- Ramsey Numbers Involving Graphs with Long Suspended Paths
- Edge colorings of complete graphs without tricolored triangles
- Trees and $n$-Good Hypergraphs
- A class of Ramsey-extremal hypergraphs
- Colored complete hypergraphs containing no rainbow Berge triangles
- Transitiv orientierbare Graphen
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Constructive Methods in Gallai-Ramsey Theory for Hypergraphs