Showing math.COShow all
3 papers · 1 filter
math.CO2025
Geometric Littlewood-Offord problems via lattice point counting
Alexandr Grebennikov, Matthew Kwan
Consider nonzero vectors , independent Rademacher random variables , and a set . What upper bounds…
math.CO2025
On almost Gallai colourings in complete graphs
Alexandr Grebennikov, Letícia Mattos, Tibor Szabó
For , we say that a colouring of is - if no two rainbow -cliques share an edge. Motivated by a lemma of Berkowit…
math.CO2021
On the palindromic Hosoya polynomial of trees
Dmitry Badulin, Alexandr Grebennikov, Konstantin Vorob'ev
A graph on vertices of diameter is called -palindromic if for all , where is th…