On a common-extendable, non-Sidorenko linear system
From MaRDI portal
Publication:6204677
DOI10.5070/c63362788OpenAlexW4390103707MaRDI QIDQ6204677
No author found.
Publication date: 2 April 2024
Published in: Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5070/c63362788
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On monochromatic solutions of equations in groups
- Multiplicities of subgraphs
- Common and Sidorenko equations in abelian groups
- A correlation inequality for bipartite graphs
- Sum-free sets in abelian groups
- A Szemerédi-type regularity lemma in abelian groups, with applications
- 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
- On the Ramsey multiplicities of graphs—problems and recent results
- Common and Sidorenko Linear Equations
- Linear configurations containing 4-term arithmetic progressions are uncommon
- Towards a characterization of Sidorenko systems
This page was built for publication: On a common-extendable, non-Sidorenko linear system