3 citations · 5 across the 6 of their papers we have counts for
Showing 2003Show all
2 papers · 1 filter
math.CO2003★ 3 cited
Dense Edge-Magic Graphs and Thin Additive Bases
Oleg Pikhurko
We study s(k,n), the maximum size of A+A where A is a k-subset of [n]. A few known functions from additive number theory can be expressed via s(k,n). For example, our estimates of…
math.LO2003★ 1 cited
Descriptive Complexity of Finite Structures: Saving the Quantifier Rank
Oleg Pikhurko, Oleg Verbitsky
Given a relational structure M on n elements, let D(M) be the minimum quantifier rank of a first order formula identifying M up to isomorphism in the class of n-element structures.…