Exact Lower Bounds for Monochromatic Schur Triples and Generalizations
From MaRDI portal
Publication:3387113
Cites work
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 2033289 (Why is no real title available?)
- A 2-coloring of \([1, N]\) can have \((1/22) N^2+O(N)\) monochromatic Schur triples, but not less
- Finding Patterns Avoiding Many Monochromatic Constellations
- On Schur properties of random subsets of integers
- On Sets of Acquaintances and Strangers at any Party
- On the minimum number of monochromatic generalized Schur triples
- On the monochromatic Schur triples type problem
- On the number of monochromatic Schur triples.
- The number of monochromatic Schur triples
Cited in
(9)- Lower bounds on the length of monotone paths in arrangements
- Exact values and lower bounds on the \(n\)-color weak Schur numbers for \(n=2,3\)
- The minimal number of monochromatic Schur tuples in a cyclic group
- The Mondrian Puzzle: A Bound Concerning the $M(n) = 0$ Case
- A lower bound for weak Schur numbers with a deterministic algorithm
- Exact Lower Bounds for Monochromatic Schur Triples and Generalizations
- A Unified Approach to Unimodality of Gaussian Polynomials
- Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers
- On the minimum number of monochromatic generalized Schur triples
This page was built for publication: Exact Lower Bounds for Monochromatic Schur Triples and Generalizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3387113)