On Multicolor Ramsey Numbers of Triple System Paths of Length 3
From MaRDI portal
Publication:6170440
DOI10.1137/22m1518402zbMath1519.05168arXiv1907.05236MaRDI QIDQ6170440
Publication date: 10 August 2023
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.05236
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Turán numbers for 3-uniform linear paths of length 3
- The Ramsey number of loose triangles and quadrangles in hypergraphs
- On the multicolor Ramsey number for 3-paths of length three
- One more Turán number and Ramsey number for the loose 3-uniform path of length three
- Unavoidable subhypergraphs: \(\mathbf a\)-clusters
- Improved bounds on the multicolor Ramsey numbers of paths and even cycles
- On the multi-colored Ramsey numbers of paths and even cycles
- The multipartite Ramsey number for the 3-path of length three
- Generalised Ramsey numbers for small graphs
- Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 2
- Multicolour Ramsey numbers of paths and even cycles
- Multicolor Ramsey numbers and restricted Turán numbers for the loose 3-uniform path of length three
- Proof of a conjecture of Erdős on triangles in set-systems
- Erdős--Ko--Rado for three sets
- Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three
- Multicolor Ramsey numbers for triple systems
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
- A hierarchy of maximal intersecting triple systems
- Paths in Hypergraphs: A Rescaling Phenomenon
- Counting flags in triangle-free digraphs
- A new generalization of the Erdős-Ko-Rado theorem
- Testing subgraphs in directed graphs
This page was built for publication: On Multicolor Ramsey Numbers of Triple System Paths of Length 3
