Ryan R. Martin

activity

20102021

most citedA simple discharging method for forbidden subposet problems

3 citations · 5 across the 8 of their papers we have counts for

collaborators

30 papers

math.CO2021★ 1 cited

Large Monochromatic Components of Small Diameter

Erik Carlson, Ryan R. Martin, Bo Peng +1

Gyárfás conjectured in 2011 that every $r$ -edge-colored $K_{n}$ contains a monochromatic component of bounded ("perhaps three") diameter on at least $n / (r - 1)$ vertices. Letzter prove…

math.CO2021

The maximum number of 10- and 12-cycles in a planar graph

Christopher Cox, Ryan R. Martin

For a fixed planar graph $H$ , let $N_{P} (n, H)$ denote the maximum number of copies of $H$ in an $n$ -vertex planar graph. In the case when $H$ is a…

math.CO2021

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…

math.CO2020

On the edit distance function of the random graph

Ryan R. Martin, Alexander W. N. Riasanovsky

Given a hereditary property of graphs $H$ and a $p \in [0, 1]$ , the edit distance function $ed_{H} (p)$ is asymptotically the maximum proportion of edge-addi…

math.CO2020★ 1 cited

Planar Turán number of the 6-cycle

Debarun Ghosh, Ervin Győri, Ryan R. Martin +2

Let $ex_{P} (n, T, H)$ denote the maximum number of copies of $T$ in an $n$ -vertex planar graph which does not contain $H$ as a subgraph. When $T = K_{2}$ , ${\rm ex}_{\mat…

math.CO2019

Improved bounds for induced poset saturation

Ryan R. Martin, Heather C. Smith, Shanise Walker

Given a finite poset $P$ , a family $F$ of elements in the Boolean lattice is induced- $P$ -saturated if $F$ contains no copy of $P$ …