Solution of the Cameron-Erdös problem for groups of prime order-Reference-Cited by-同舟云学术

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

Published:2009-08 Issue:8 Volume:49 Page:1435-1441
ISSN:0965-5425
Container-title:Computational Mathematics and Mathematical Physics
language:en
Short-container-title:Comput. Math. and Math. Phys.

Author:

Sapozhenko A. A.

Publisher

Pleiades Publishing Ltd

Subject

Computational Mathematics

Link

http://link.springer.com/content/pdf/10.1134/S0965542509080132.pdf

Reference16 articles.

1. P. J. Cameron and P. Erdös, On the Number of Sets of Integers with Various Properties, Number Theory (Banff, AB, 1988) (de Gruyter, Berlin, 1990), pp. 61–79.

2. N. Alon, “Independent Sets in Regular Graphs and Sum-Free Subsets of Abelian Groups,” Israel J. Math. 73, 247–256 (1991).

3. N. Calkin, “On the Number of Sum-Free Set,” Bull. London Math. Soc. 22, 141–144 (1990).

4. B. J. Green, “The Cameron-Erdös Conjecture,” Bull. London Math. Soc. 36, 769–778 (2004).

5. A. A. Sapozhenko, “The Cameron-Erdös Conjecture,” Dokl. Akad. Nauk 393, 749–752 (2003) [Dokl. Math. 68, 438–441 (2003)].

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Asymptotics for the logarithm of the number of k-solution-free collections in Abelian groups;PROCEEDINGS OF THE 1ST INTERNATIONAL CONFERENCE ON FRONTIER OF DIGITAL TECHNOLOGY TOWARDS A SUSTAINABLE SOCIETY;2023

2. Asymptotics for the logarithm of the number of k-solution-free sets in Abelian groups;Discrete Mathematics and Applications;2019-12-18

3. A refinement of the Cameron-Erdős conjecture;Proceedings of the London Mathematical Society;2013-07-09

4. Asymptotics for the logarithm of the number of (k, l)-sum-free sets in groups of prime order;Moscow University Computational Mathematics and Cybernetics;2012-04