27 citations · 32 across the 3 of their papers we have counts for
3 papers
math.CO2016★ 27 cited
Packing minor-closed families of graphs into complete graphs
Silvia Messuti, Vojtěch Rödl, Mathias Schacht
Motivated by a conjecture of Gyárfás, recently Böttcher, Hladký, Piguet, and Taraz showed that every collection of trees on vertices with $\sum_{i=1}^te(T_i)\le…
math.CO2016★ 5 cited
On the structure of graphs with given odd girth and large minimum degree
Silvia Messuti, Mathias Schacht
We study minimum degree conditions for which a graph with given odd girth has a simple structure. For example, the classical work of Andrásfai, Erd\H os, and Sós implies that every…
math.CO2011
Families of graph-different Hamilton paths
János Körner, Silvia Messuti, Gábor Simonyi
Let D be an arbitrary subset of the natural numbers. For every n, let M(n;D) be the maximum of the cardinality of a set of Hamiltonian paths in the complete graph K_n such that the…