Abstract
AbstractA famous result of Rado characterizes those integer matrices A which are partition regular, that is, for which any finite coloring of the positive integers gives rise to a monochromatic solution to the equation . Aigner‐Horev and Person recently stated a conjecture on the probability threshold for the binomial random set having the asymmetric random Rado property: given partition regular matrices (for a fixed ), however one r‐colors , there is always a color such that there is an i‐colored solution to . This generalizes the symmetric case, which was resolved by Rödl and Ruciński, and Friedgut, Rödl and Schacht. Aigner‐Horev and Person proved the 1‐statement of their asymmetric conjecture. In this paper, we resolve the 0‐statement in the case where the correspond to single linear equations. Additionally we close a gap in the original proof of the 0‐statement of the (symmetric) random Rado theorem.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
