Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Aleksandr A. Sapozhenko"'
Publikováno v:
Discrete Mathematics and Applications. 30:339-345
Asymptotic upper and lower bounds for the numbers of distinct subsets A + B in Abelian group of order n are derived, where |A|, |B| ≥ n(log n)−1/8.
Publikováno v:
Discrete Mathematics and Applications. 29:401-407
A family (A1, …, Ak) of subsets of a group G is called k-solution-free family if the equation x1 + … + xk = 0 has no solution in (A1, …, Ak) such that x1 ∈ A1, …, xk ∈ Ak. We find the asymptotic behavior for the logarithm of the number of
Publikováno v:
Diskretnaya Matematika. 30:117-126
Publikováno v:
Diskretnaya Matematika. 30:96-105
Publikováno v:
Diskretnaya Matematika. 28:44-77
Autor:
Aleksandr A. Sapozhenko, A. B. Dainyak
Publikováno v:
Discrete Mathematics and Applications. 26
We give a survey of the enumeration of independent sets in graphs and of some related problems.
Publikováno v:
Diskretnaya Matematika. 15:141-147
Publikováno v:
Diskretnaya Matematika. 14:3-7
Publikováno v:
Diskretnaya Matematika. 13:56-62