Counting configuration-free sets in groups
From MaRDI portal
Publication:5920085
DOI10.1016/j.ejc.2017.06.027zbMath1369.05199arXiv1602.01992OpenAlexW2963636392WikidataQ105583641 ScholiaQ105583641MaRDI QIDQ5920085
Oriol Serra, Lluís Vena, Juanjo Rué
Publication date: 11 September 2017
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.01992
Related Items
Normal limiting distributions for systems of linear equations in random sets, Infinite Sidon Sets Contained in Sparse Random Sets of Integers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- Hypergraph containers
- On the removal lemma for linear systems over abelian groups
- On subsets of \(\mathbb F_q^n\) containing no \(k\)-term progressions
- A combinatorial proof of the removal lemma for groups
- Quantitative theorems for regular systems of equations
- An ergodic Szemerédi theorem for commuting transformations
- Davenport-Schinzel theory of matrices
- Norm-graphs: Variations and applications
- A removal lemma for systems of linear equations over finite fields
- On arithmetic structures in dense sets of integers
- A correlation inequality for bipartite graphs
- On the number of monochromatic solutions of integer linear systems on abelian groups
- A Szemerédi-type regularity lemma in abelian groups, with applications
- MIXING FOR PROGRESSIONS IN NONABELIAN GROUPS
- Ramsey properties of random discrete structures
- On Certain Sets of Positive Density
- A proof of Green's conjecture regarding the removal properties of sets of linear equations
- On sets of integers containing k elements in arithmetic progression
- Solving a linear equation in a set of integers I
- Rado Partition Theorem for Random Subsets of Integers
- Combinatorial theorems relative to a random set
- A Note on a Question of Erdős and Graham
- Arithmetic progressions of length three in subsets of a random set
- An Upper Bound on Zarankiewicz' Problem
- The symmetry preserving removal lemma
- Independent sets in hypergraphs
- The number of K s,t -free graphs
- Behrend-type constructions for sets of linear equations
- On Graphs that do not Contain a Thomsen Graph
- Polynomial extensions of van der Waerden’s and Szemerédi’s theorems
- On a problem of K. Zarankiewicz
