A rainbow Ramsey analogue of Rado's theorem
From MaRDI portal
Publication:2629294
Abstract: We present a Rainbow Ramsey version of the well-known Ramsey-type theorem of Richard Rado. We use techniques from the Geometry of Numbers. We also disprove two conjectures proposed in the literature.
Recommendations
Cites work
- A linear algebraic view of partition regular matrices
- Computing the Continuous Discretely
- scientific article; zbMATH DE number 5014483 (Why is no real title available?)
- scientific article; zbMATH DE number 2033289 (Why is no real title available?)
- scientific article; zbMATH DE number 1405493 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- Nowhere-zero 6-flows
- Rainbow Arithmetic Progressions and Anti-Ramsey Results
- Rainbow solutions to the Sidon equation
- Rainbow-free 3-colorings of abelian groups
- Rainbow-free colorings for x+y=cz in Z_p
- Studien zur Kombinatorik
Cited in
(8)- An extension of the rainbow Erdős-Rothschild problem
- An infinite color analogue of Rado's theorem
- Rainbow Ramsey simple structures
- Rainbow Ramsey theorem for triples is strictly weaker than the arithmetical comprehension axiom
- A general framework for studying finite rainbow configurations
- scientific article; zbMATH DE number 5014483 (Why is no real title available?)
- Rainbow Ramsey theorems for colorings establishing negative partition relations
- Rainbow numbers for the generalized Schur equation \(x_1+x_2+\cdots+x_{m-1}=x_m\)
This page was built for publication: A rainbow Ramsey analogue of Rado's theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629294)