Solution of the Cameron-Erdös problem for groups of prime order

DOI10.1134/S0965542509080132zbMath1199.11060OpenAlexW1998511058MaRDI QIDQ3652378

Alexander A. Sapozhenko

Publication date: 17 December 2009

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: http://www.maik.ru/abstract/commat/9/commat1435_abstract.pdf

zbMATH Keywords

independent setsum-free set

Mathematics Subject Classification ID

Arithmetic and combinatorial problems involving abstract finite groups (20D60) Other combinatorial number theory (11B75) Ramsey theory (05D10)

Related Items (5)

Counting sumsets and differences in an abelian group ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Asymptotics for the logarithm of the number of \((k,l)\)-sum-free sets in groups of prime order ⋮ Asymptotics for the logarithm of the number of \(k\)-solution-free sets in abelian groups ⋮ Asymptotics for the Logarithm of the Number of (k, l)-Solution-Free Collections in an Interval of Naturals

This page was built for publication: Solution of the Cameron-Erdös problem for groups of prime order