7 citations · 33 across the 19 of their papers we have counts for
4 papers · 1 filter
Ramsey equivalence of and
Thomas F. Bloom, Anita Liebenau
We prove that, for , the graphs and are Ramsey equivalent. That is, if is such that any red-blue colouring of its edges creates a monochromatic $K_…
Excluding hooks and their complements
Krzysztof Choromanski, Dvir Falik, Anita Liebenau +2
The celebrated Erdos-Hajnal conjecture states that for every -vertex undirected graph there exists $\eps(H)>0$ such that every graph that does not contain as an indu…
On the minimum degree of minimal Ramsey graphs for multiple colours
Jacob Fox, Andrey Grinshpun, Anita Liebenau +2
A graph G is r-Ramsey for a graph H, denoted by G\rightarrow (H)_r, if every r-colouring of the edges of G contains a monochromatic copy of H. The graph G is called r-Ramsey-minima…
First order convergence of matroids
Frantisek Kardos, Daniel Kral, Anita Liebenau +1
The model theory based notion of the first order convergence unifies the notions of the left-convergence for dense structures and the Benjamini-Schramm convergence for sparse struc…