7 citations · 33 across the 19 of their papers we have counts for
Showing 2018 · math.COShow all
2 papers · 2 filters
math.CO2018
Caterpillars in Erdős-Hajnal
Anita Liebenau, Marcin Pilipczuk, Paul Seymour +1
Let be a tree such that all its vertices of degree more than two lie on one path, that is, is a caterpillar subdivision. We prove that there exists such that for ever…
math.CO2018★ 4 cited
On minimal Ramsey graphs and Ramsey equivalence in multiple colours
Dennis Clemens, Anita Liebenau, Damian Reding
For an integer , a graph is called -Ramsey for a graph if every -colouring of the edges of contains a monochromatic copy of . If is -Ramsey for…