Abstract
The paper deals with a problem of Additive Combinatorics. Let G be a finite abelian group of order N. We prove that the number of subset triples A,B,C⊂G such that for any x∈A, y∈B and z∈C one has x+y≠z equals 3⋅4N+N3N+1+O((3−c∗)N) for some absolute constant c∗>0. This provides a tight estimate for the number of independent sets in a special 3-uniform linear hypergraph and disproves the conjecture of Cohen et al. (0000). concerning the maximal possible number of independent sets in such hypergraphs on n vertices.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
