On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs
From MaRDI portal
Publication:5096590
DOI10.1137/21M1462003zbMath1495.05187arXiv2103.12627OpenAlexW4291011623MaRDI QIDQ5096590
Bruno Jartoux, Chaya Keller, Yelena Yuditsky, Shakhar Smorodinsky
Publication date: 18 August 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2103.12627
Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55) Ramsey theory (05D10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved bound for the stepping-up lemma
- Combinatorial set theory: Partition relations for cardinals
- Heawood inequalities
- On coloring manifolds
- Shift graphs and lower bounds on Ramsey numbers \(r_ k(l;r)\)
- Small Ramsey numbers
- Symmetric sum-free partitions and lower bounds for Schur numbers
- Multicolor Ramsey numbers for triple systems
- On Neighbourly Triangulations
- A survey of bounds for classical Ramsey numbers
- Constructive Methods in Gallai-Ramsey Theory for Hypergraphs
- Partition relations for cardinal numbers
- Combinatorial Theorems on Classifications of Subsets of a Given Set
- On the structure of linear graphs
This page was built for publication: On Multicolor Ramsey Numbers and Subset Coloring of Hypergraphs