Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers

DOI10.1137/18M1227007zbMATH Open1425.05157arXiv1811.06178MaRDI QIDQ5243173FDOQ5243173

Authors: Elad Aigner-Horev, Yury Person 

Publication date: 15 November 2019

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Abstract: Given a dense subset $A$ of the first $n$ positive integers, we provide a short proof showing that for $p=omega(n^{-2/3})$ the so-called {sl randomly perturbed} set $Acup[n{]}_p$ a.a.s. has the property that any $2$-colouring of it has a monochromatic Schur triple, i.e. a triple of the form $(a,b,a+b)$. This result is optimal since there are dense sets $A$, for which $Acup[n{]}_p$ does not possess this property for $p=o(n^{-2/3})$.

Full work available at URL: https://arxiv.org/abs/1811.06178

Recommendations

• The number of monochromatic Schur triples
• On the monochromatic Schur triples type problem
• Exact Lower Bounds for Monochromatic Schur Triples and Generalizations
• On the number of monochromatic Schur triples.
• On the minimum number of monochromatic generalized Schur triples
• On Schur properties of random subsets of integers
• scientific article; zbMATH DE number 2061965
• Proper permutations, Schubert geometry, and randomness
• Monotone subsets in lattices and the Schensted shape of a Sós permutation
• The minimal number of monochromatic Schur tuples in a cyclic group

zbMATH Keywords

Ramsey theoryrandom setsSchur triples

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Extremal problems in graph theory (05C35) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Title not available (Why is that?)
• On Certain Sets of Positive Density
• Extremal results for random discrete structures
• Combinatorial theorems in sparse random sets
• Arithmetic progressions of length three in subsets of a random set
• On smoothed analysis in dense graphs and formulas
• Adding random edges to dense graphs
• How many random edges make a dense graph hamiltonian?
• Threshold Functions for Ramsey Properties
• Universality for bounded degree spanning trees in randomly perturbed graphs
• On Schur properties of random subsets of integers
• Ramsey properties of random discrete structures
• Title not available (Why is that?)
• Random graphs with monochromatic triangles in every edge coloring
• Ramsey properties of random graphs
• Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
• Tilings in randomly perturbed dense graphs
• Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs
• Embedding spanning bounded degree subgraphs in randomly perturbed graphs
• Powers of tight Hamilton cycles in randomly perturbed hypergraphs
• Cycles and matchings in randomly perturbed digraphs and hypergraphs
• A Note on Sum-Free Sets of Integers
• Ramsey properties of randomly perturbed graphs: cliques and cycles
• Powers of Hamiltonian cycles in randomly augmented graphs
• How many random edges make a dense hypergraph non-2-colorable?

Cited In (7)

• The minimal number of monochromatic Schur tuples in a cyclic group
• Schur properties of randomly perturbed sets
• Small rainbow cliques in randomly perturbed dense graphs
• Large Rainbow Cliques in Randomly Perturbed Dense Graphs
• An asymmetric random Rado theorem: 1-statement
• Ramsey properties of randomly perturbed graphs: cliques and cycles
• On the minimum number of monochromatic generalized Schur triples

This page was built for publication: Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers

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