17 citations · 57 across the 36 of their papers we have counts for
Showing 2019 · math.COShow all
3 papers · 2 filters
math.CO2019
Distinct degrees in induced subgraphs
Matthew Jenssen, Peter Keevash, Eoin Long +1
An important theme of recent research in Ramsey theory has been establishing pseudorandomness properties of Ramsey graphs. An -vertex graph is called -Ramsey if it has no hom…
math.CO2019★ 3 cited
Independence number in triangle-free graphs avoiding a minor
Zdeněk Dvořák, Liana Yepremyan
The celebrated Hadwiger's conjecture states that if a graph contains no minor then it is -colourable. If true, it would in particular imply that every -vertex $K_{t…
math.CO2019
The size Ramsey number of graphs with bounded treewidth
Nina Kamcev, Anita Liebenau, David R. Wood +1
A graph is Ramsey for a graph if every 2-colouring of the edges of contains a monochromatic copy of . We consider the following question: if has bounded treewidt…