An asymmetric random Rado theorem for single equations: The 0‐statement
From MaRDI portal
Publication:6074694
DOI10.1002/rsa.21039zbMath1522.05488arXiv2004.14076OpenAlexW3165127360MaRDI QIDQ6074694
Andrew Treglown, Robert Hancock
Publication date: 12 October 2023
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.14076
Partitions of sets (05A18) Combinatorial aspects of partitions of integers (05A17) Ramsey theory (05D10)
Cites Work
- Combinatorial theorems in sparse random sets
- Quantitative theorems for regular systems of equations
- On Schur properties of random subsets of integers
- Threshold functions and Poisson convergence for systems of equations in random sets
- Studien zur Kombinatorik
- An asymmetric random Rado theorem: 1-statement
- A note on sparse supersaturation and extremal results for linear homogeneous systems
- A sharp threshold for van der Waerden's theorem in random subsets
- Ramsey properties of random discrete structures
- Solving a linear equation in a set of integers I
- Rado Partition Theorem for Random Subsets of Integers
- Combinatorial theorems relative to a random set
- Independent Sets in Hypergraphs and Ramsey Properties of Graphs and the Integers
- The Maker--Breaker Rado Game on a Random Set of Integers
- Threshold Functions for Ramsey Properties
- Towards the Kohayakawa–Kreuter conjecture on asymmetric Ramsey properties
- On the optimality of the uniform random strategy
This page was built for publication: An asymmetric random Rado theorem for single equations: The 0‐statement