3 papers
math.CO2023
On triangle-free graphs maximizing embeddings of bipartite graphs
Dmitriy Gorovoy, Andrzej Grzesik, Justyna Jaworska
In 1991 Gy\H ori, Pach, and Simonovits proved that for any bipartite graph containing a matching avoiding at most 1 vertex, the maximum number of copies of in any large eno…
math.CO2022
Counting Unions of Schreier Sets
Kevin Beanland, Dmitriy Gorovoy, Jȩdrzej Hodor +1
A subset of positive integers is a Schreier set if it is non-empty and (here is the cardinality of ). For each positive integer , we define $k…
math.CO2021
On graphs with unique geoodesics and antipodes
Dmitriy Gorovoy, David Zmiaikou
In 1962, Oystein Ore asked in which graphs there is exactly one geodesic between any two vertices. He called such graphs geodetic. In this paper, we systematically study properties…