345 citations · 400 across the 16 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017★ 7 cited
Extremal problems on the hypercube and the codegree Turán density of complete -graphs
Alexander Sidorenko
Let be a finite abelian group, and be a multiple of its exponent. The generalized Erdős-Ginzburg-Ziv constant is the smallest integer such that every sequence…
math.CO2017★ 1 cited
An Erdős-Gallai-type theorem for keyrings
Alexander Sidorenko
A keyring is a graph obtained by appending leaves to one of the vertices of a cycle. We prove that for every , any graph with average degree more than $k…