Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers
From MaRDI portal
Publication:5243173
DOI10.1137/18M1227007zbMath1425.05157arXiv1811.06178MaRDI QIDQ5243173
Elad Aigner-Horev, Yury Person
Publication date: 15 November 2019
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.06178
Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Ramsey theory (05D10) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (4)
Large Rainbow Cliques in Randomly Perturbed Dense Graphs ⋮ Small rainbow cliques in randomly perturbed dense graphs ⋮ Ramsey properties of randomly perturbed graphs: cliques and cycles ⋮ An asymmetric random Rado theorem: 1-statement
Cites Work
- Unnamed Item
- Unnamed Item
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- Ramsey properties of random graphs
- On Schur properties of random subsets of integers
- Hamilton \(\ell\)-cycles in randomly perturbed hypergraphs
- Embedding spanning bounded degree subgraphs in randomly perturbed graphs
- Bounded-Degree Spanning Trees in Randomly Perturbed Graphs
- Ramsey properties of random discrete structures
- On Certain Sets of Positive Density
- On smoothed analysis in dense graphs and formulas
- How many random edges make a dense hypergraph non-2-colorable?
- A Note on Sum-Free Sets of Integers
- Random graphs with monochromatic triangles in every edge coloring
- Adding random edges to dense graphs
- How many random edges make a dense graph hamiltonian?
- Threshold Functions for Ramsey Properties
- Arithmetic progressions of length three in subsets of a random set
- Ramsey properties of randomly perturbed graphs: cliques and cycles
- Powers of Hamiltonian cycles in randomly augmented graphs
- Powers of tight Hamilton cycles in randomly perturbed hypergraphs
- Universality for bounded degree spanning trees in randomly perturbed graphs
- Tilings in Randomly Perturbed Dense Graphs
- Cycles and Matchings in Randomly Perturbed Digraphs and Hypergraphs
This page was built for publication: Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers
