Finding Patterns Avoiding Many Monochromatic Constellations
From MaRDI portal
Recommendations
- Avoiding monochromatic configurations in the multi-colored plane
- Finding unavoidable colorful patterns in multicolored graphs
- Large sets avoiding patterns
- scientific article; zbMATH DE number 7613143
- Monotone triangles and 312 pattern avoidance
- Large sets avoiding linear patterns
- Pattern avoidance and dominating compositions
- Pattern avoidance in coloured permutations
- Avoiding patterns in the abelian sense
- Avoiding Monochromatic Sequences With Special Gaps
Cites work
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- Finite field models in arithmetic combinatorics -- ten years on
- On the asymptotic minimum number of monochromatic 3-term arithmetic progressions
- On the number of monochromatic Schur triples.
- Quantitative theorems for regular systems of equations
- The number of monochromatic Schur triples
Cited in
(5)- Monochromatic 4-term arithmetic progressions in 2-colorings of Z_n
- Optimization tools for computing colorings of \([1, \dots, n]\) with few monochromatic solutions on 3-variable linear equations
- From discrete to continuous: monochromatic 3-term arithmetic progressions
- Exact Lower Bounds for Monochromatic Schur Triples and Generalizations
- On the minimum number of monochromatic generalized Schur triples
This page was built for publication: Finding Patterns Avoiding Many Monochromatic Constellations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2911514)
