Counting configuration-free sets in groups
From MaRDI portal
Publication:5890919
DOI10.1016/j.endm.2015.06.075zbMath1346.05204OpenAlexW2752696520MaRDI QIDQ5890919
Lluís Vena, Juanjo Rué, Oriol Serra
Publication date: 14 October 2016
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.075
Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Arithmetic progressions (11B25)
Related Items (1)
Cites Work
- 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
- A combinatorial proof of the removal lemma for groups
- An ergodic Szemerédi theorem for commuting transformations
- On the number of graphs without 4-cycles
- Davenport-Schinzel theory of matrices
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- A removal lemma for systems of linear equations over finite fields
- A Szemerédi-type regularity lemma in abelian groups, with applications
- MIXING FOR PROGRESSIONS IN NONABELIAN GROUPS
- 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
- Extremal problems on set systems
- 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
- The symmetry preserving removal lemma
- Independent sets in hypergraphs
- On Certain Sets of Integers
- On a problem of K. Zarankiewicz
- Counting configuration-free sets in groups
This page was built for publication: Counting configuration-free sets in groups
