16 citations · 33 across the 22 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017
On Existentially Complete Triangle-free Graphs
Shoham Letzter, Julian Sahasrabudhe
For a positive integer , we say that a graph is -existentially complete if for every , and every tuple of distinct vertices , $y_1,\ldots,y_{…
math.CO2017
Partitioning a graph into monochromatic connected subgraphs
António Girão, Shoham Letzter, Julian Sahasrabudhe
A well-known result by Haxell and Kohayakawa states that the vertices of an -coloured complete graph can be partitioned into monochromatic connected subgraphs of distinct co…