Linear configurations containing 4-term arithmetic progressions are uncommon
From MaRDI portal
Publication:6133633
DOI10.1016/J.JCTA.2023.105792zbMath1519.05244arXiv2106.06846OpenAlexW3169631338MaRDI QIDQ6133633
Publication date: 21 August 2023
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.06846
Related Items (3)
Linear configurations containing 4-term arithmetic progressions are uncommon ⋮ Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 ⋮ On a common-extendable, non-Sidorenko linear system
Cites Work
- Unnamed Item
- Counting odd cycles in locally dense graphs
- Monochromatic 4-term arithmetic progressions in 2-colorings of \(\mathbb Z_n\)
- On the Ramsey multiplicity of complete graphs
- The minimum number of monochromatic 4-term progressions in \(\mathbb Z_p\)
- On monochromatic solutions of equations in groups
- Graph products and monochromatic multiplicities
- Multiplicities of subgraphs
- Common and Sidorenko equations in abelian groups
- A uniform set with fewer than expected arithmetic progressions of length 4
- Ramsey multiplicity of linear patterns in certain finite abelian groups
- On Sets of Acquaintances and Strangers at any Party
- A Disproof of a Conjecture of Erdős in Ramsey Theory
- Common and Sidorenko Linear Equations
- Linear configurations containing 4-term arithmetic progressions are uncommon
This page was built for publication: Linear configurations containing 4-term arithmetic progressions are uncommon