3 citations · 3 across the 1 of their papers we have counts for
2 papers
math.CO2016
Minimising the number of triangular edges
Vytautas Gruslys, Shoham Letzter
We consider the problem of minimising the number of edges that are contained in triangles, among -vertex graphs with a given number of edges. We prove a conjecture of Füredi and…
math.CO2015★ 3 cited
Catching a mouse on a tree
Vytautas Gruslys, Arès Méroueh
In this paper we consider a pursuit-evasion game on a graph. A team of cats, which may choose any vertex of the graph at any turn, tries to catch an invisible mouse, which is const…