Number of \(A + B \neq C\) solutions in abelian groups and application to counting independent sets in hypergraphs

DOI10.1016/j.ejc.2021.103453zbMath1480.05129arXiv2012.13433OpenAlexW3207992364MaRDI QIDQ2065127

Aliaksei Semchankau, Dmitriy A. Shabanov, Ilya D. Shkredov

Publication date: 7 January 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2012.13433

Mathematics Subject Classification ID

Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Ramsey theory (05D10)

Related Items (1)

On the number of sum-free triplets of sets

Cites Work

• Unnamed Item
• Hypergraph containers
• Maximal subsets free of arithmetic progressions in arbitrary sets
• On the number of graphs without 4-cycles
• Independent sets in regular graphs and sum-free subsets of finite groups
• On the number of independent sets in simple hypergraphs
• On the number of independent sets in uniform, regular, linear hypergraphs
• Sum-free sets in abelian groups
• An inverse theorem for an inequality of Kneser
• An Entropy Approach to the Hard-Core Model on Bipartite Graphs
• The Number of Independent Sets in a Regular Graph
• A Generalisation of the Theorem of Cauchy and Davenport
• Independent Sets in Regular Hypergraphs and Multidimensional Runlength-Limited Constraints
• Arithmetic Progressions in Sumsets and L^p-Almost-Periodicity
• Independent sets in hypergraphs
• Independent sets, matchings, and occupancy fractions
• Arithmetic progressions in sumsets

This page was built for publication: Number of \(A + B \neq C\) solutions in abelian groups and application to counting independent sets in hypergraphs