Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by Crossref.
Sapozhenko, Alexander
2005.
Stochastic Algorithms: Foundations and Applications.
Vol. 3777,
Issue. ,
p.
1.
Omelyanov, K. G.
2005.
On the number of independent sets in damaged Cayley graphs.
Discrete Mathematics and Applications,
Vol. 15,
Issue. 4,
Green, Ben
and
Ruzsa, Imre Z.
2005.
Sum-free sets in abelian groups.
Israel Journal of Mathematics,
Vol. 147,
Issue. 1,
p.
157.
Омельянов, К Г
and
Omel'yanov, K G
2005.
О числе независимых множеств в поврежденных графах Кэли.
Дискретная математика,
Vol. 17,
Issue. 3,
p.
105.
Омельянов, К Г
and
Omel'yanov, K G
2006.
Оценки констант Камерона - Эрдеша.
Дискретная математика,
Vol. 18,
Issue. 2,
p.
55.
Omelyanov, K. G.
2006.
Estimates of the Cameron–Erdős constants.
Discrete Mathematics and Applications,
Vol. 16,
Issue. 3,
Lev, Vsevolod F.
2006.
Large sum-free sets in ℤ/ p ℤ.
Israel Journal of Mathematics,
Vol. 154,
Issue. 1,
p.
221.
Wolfovitz, Guy
2007.
Bounds on the Number of Maximal Sum-Free Sets.
Electronic Notes in Discrete Mathematics,
Vol. 29,
Issue. ,
p.
321.
Sapozhenko, Alexander A.
2008.
The Cameron–Erdős conjecture.
Discrete Mathematics,
Vol. 308,
Issue. 19,
p.
4361.
Vu, Van
2008.
Building Bridges.
Vol. 19,
Issue. ,
p.
525.
Sapozhenko, A. A.
2009.
Asymptotics of the number of sum-free sets in groups of prime order.
Doklady Mathematics,
Vol. 79,
Issue. 1,
p.
79.
Sapozhenko, A. A.
2009.
Solution of the Cameron-Erdös problem for groups of prime order.
Computational Mathematics and Mathematical Physics,
Vol. 49,
Issue. 8,
p.
1435.
Wolfovitz, Guy
2009.
Bounds on the number of maximal sum-free sets.
European Journal of Combinatorics,
Vol. 30,
Issue. 7,
p.
1718.
Huczynska, Sophie
Mullen, Gary L.
and
Yucas, Joseph L.
2009.
The extent to which subsets are additively closed.
Journal of Combinatorial Theory, Series A,
Vol. 116,
Issue. 4,
p.
831.
ZHAO, YUFEI
2010.
The Number of Independent Sets in a Regular Graph.
Combinatorics, Probability and Computing,
Vol. 19,
Issue. 2,
p.
315.
Valyuzhenich, A. A.
2011.
Some properties of well-based sequences.
Journal of Applied and Industrial Mathematics,
Vol. 5,
Issue. 4,
p.
612.
Sargsyan, V. G.
2012.
Asymptotics for the logarithm of the number of (k, l)-sum-free sets in groups of prime order.
Moscow University Computational Mathematics and Cybernetics,
Vol. 36,
Issue. 2,
p.
101.
Affif Chaouche, Fatima
Rutherford, Carrie
and
Whitty, Robin
2013.
Objective functions with redundant domains.
Journal of Combinatorial Optimization,
Vol. 26,
Issue. 2,
p.
372.
Balogh, József
Morris, Robert
and
Samotij, Wojciech
2014.
Random sum-free subsets of abelian groups.
Israel Journal of Mathematics,
Vol. 199,
Issue. 2,
p.
651.
Саргсян, Ваге Гнелович
and
Sargsyan, Vahe Gnelovich
2014.
Асимптотика логарифма числа множеств, $(k,l)$-свободных от сумм, в абелевой группе.
Дискретная математика,
Vol. 26,
Issue. 4,
p.
91.