On the finiteness of some \(n\)-color Rado numbers
From MaRDI portal
Publication:2374156
DOI10.1016/j.disc.2016.07.010zbMath1351.05069OpenAlexW2511723084MaRDI QIDQ2374156
Publication date: 14 December 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.07.010
sum-free setsSAT problemextremal problemhypergraph coloringSchur numbersRado numberspartition-regular equation
Related Items (3)
On the n-Color Weak Rado Numbers for the Equation x1+x2+⋯+xk+c=xk+1 ⋮ Unnamed Item ⋮ Two-color Rado number of \(x + y + c = kz\) for odd \(c\) and \(k\) with \(k \geq c + 6\)
Cites Work
- On Rado's boundedness conjecture
- Rado numbers for the equation \(\sum_{i=1}^{m-1} x_i + c = x_m\), for negative values of \(c\)
- Studien zur Kombinatorik
- Determination of the two-color Rado number for \(a_{1}x_{1}+\cdots +a_m x_m=x_{0}\)
- On the $n$-color Rado number for the equation $x_{1}+x_{2}+ \dots +x_{k}+c =x_{k+1}$
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the finiteness of some \(n\)-color Rado numbers