53 citations · 365 across the 52 of their papers we have counts for
7 papers · 1 filter
Large Monochromatic Components of Small Diameter
Erik Carlson, Ryan R. Martin, Bo Peng +1
Gyárfás conjectured in 2011 that every -edge-colored contains a monochromatic component of bounded ("perhaps three") diameter on at least vertices. Letzter prove…
On generalized Turán results in height two posets
József Balogh, Ryan R. Martin, Dániel T. Nagy +1
For given posets and and an integer , the generalized Turán problem for posets, asks for the maximum number of copies of in a -free subset of the -dimensional…
Accumulation points of the edit distance function
Christopher Cox, Ryan R. Martin, Daniel McGinnis
Given a hereditary property of graphs and some , the edit distance function is (asymptotically) the maximum proportion o…
The maximum number of 10- and 12-cycles in a planar graph
Christopher Cox, Ryan R. Martin
For a fixed planar graph , let denote the maximum number of copies of in an -vertex planar graph. In the case when is a…
Powers of Hamiltonian cycles in multipartite graphs
Louis DeBiasio, Ryan Martin, Theodore Molla
We prove that if is a -partite graph on vertices in which all of the parts have order at most and every vertex is adjacent to at least a proportion of…
Graph clustering via generalized colorings
András London, Ryan R. Martin, András Pluhár
We propose a new approach for defining and searching clusters in graphs that represent real technological or transaction networks. In contrast to the standard way of finding dense…
Counting paths, cycles and blow-ups in planar graphs
Christopher Cox, Ryan R. Martin
For a planar graph , let denote the maximum number of copies of in an -vertex planar graph. In this paper, we prove that $\o…