The minimum number of monochromatic 4-term progressions in Z_p
From MaRDI portal
(Redirected from Publication:989229)
The minimum number of monochromatic 4-term progressions in \(\mathbb Z p\)
The minimum number of monochromatic 4-term progressions in \(\mathbb Z p\)
Recommendations
Cited in
(16)- From discrete to continuous: monochromatic 3-term arithmetic progressions
- On some problems of Euclidean Ramsey theory
- Inducibility and universality for trees
- Counting patterns in colored orthogonal arrays
- Minimum Number of Monotone Subsequences of Length 4 in Permutations
- Monochromatic 4-term arithmetic progressions in 2-colorings of \(\mathbb Z_n\)
- Monochromatic progressions in random colorings
- scientific article; zbMATH DE number 7069711 (Why is no real title available?)
- Large values of the Gowers-Host-Kra seminorms
- On uncommon systems of equations
- A uniform set with fewer than expected arithmetic progressions of length 4
- Using Ramsey theory to measure unavoidable spurious correlations in big data
- A note on the inducibility of 4-vertex graphs
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- Linear configurations containing 4-term arithmetic progressions are uncommon
- On tripartite common graphs
This page was built for publication: The minimum number of monochromatic 4-term progressions in \(\mathbb Z_p\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989229)
