Rado Partition Theorem for Random Subsets of Integers

DOI10.1112/S0024611597000178MaRDI QIDQ4344037zbMATH OpenOpenAlexWikidataFDO

Authors Vojtěch Rödl, Andrzej Ruciński

Publication date 7 July 1997

Published in Proceedings of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1112/s0024611597000178

zbMATH Keywords

linear equationsRado partitionRamsey theory

Mathematics Subject Classification ID

Ramsey theory (05D10) Arithmetic progressions (11B25) Combinatorial probability (60C05)

Recommendations

• An Erdős-Ko-Rado theorem for subset partitions
• Part sizes of random integer partitions
• The Structure of Random Partitions of Large Integers
• Random set partitions: Asymptotics of subset counts
• Random Set Partitions
• Asymptotics of random partitions of a set
• Asymptotics of random partitions of a set

Cited in

(31)

• Independent Deuber sets in graphs on the natural numbers
• Random strategies are nearly optimal for generalized van der Waerden games
• Threshold functions and Poisson convergence for systems of equations in random sets
• Counting sum-free sets in abelian groups
• Random sum-free subsets of abelian groups
• Random Van der Waerden theorem
• An asymmetric random Rado theorem: 1-statement
• A note on sparse supersaturation and extremal results for linear homogeneous systems
• Upper tails for counting objects in randomly induced subhypergraphs and rooted random graphs
• The typical structure of sparse \(K_{r+1}\)-free graphs
• A sharp threshold for van der Waerden's theorem in random subsets
• Ramsey properties of random discrete structures
• Online containers for hypergraphs, with applications to linear equations
• Transference for the Erdős-Ko-Rado theorem
• Extremal results for random discrete structures
• Combinatorial theorems in sparse random sets
• Regular pairs in sparse random graphs I
• Independent sets in hypergraphs and Ramsey properties of graphs and the integers
• The Maker-Breaker Rado game on a random set of integers
• The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups
• Counting configuration-free sets in groups
• Contributions to the problem of Zrankiewicz
• Deviation probabilities for arithmetic progressions and other regular discrete structures
• An asymmetric random Rado theorem for single equations: The 0‐statement
• Schur properties of randomly perturbed sets
• On uncommon systems of equations
• Sharp thresholds for Ramsey properties
• The list-Ramsey threshold for families of graphs
• On the stability of the Erdős-Ko-Rado theorem
• A probabilistic threshold for monochromatic arithmetic progressions
• A Rademacher type formula for partitions and overpartitions

This page was built for publication: Rado Partition Theorem for Random Subsets of Integers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4344037)