8 citations · 8 across the 3 of their papers we have counts for
3 papers
math.CO2023
On the rainbow planar Turán number of paths
Ervin Győri, Ryan R. Martin, Addisu Paulos +2
An edge-colored graph is said to contain a rainbow- if it contains as a subgraph and every edge of is a distinct color. The problem of maximizing edges among -vertex…
math.ST2021★ 8 cited
An imprecise-probabilistic characterization of frequentist statistical inference
Ryan Martin
Between the two dominant schools of thought in statistics, namely, Bayesian and classical/frequentist, a main difference is that the former is grounded in the mathematically rigoro…
math.CO2010
Lower bounds for identifying codes in some infinite grids
Ryan Martin, Brendon Stanton
An -identifying code on a graph is a set such that for every vertex in , the intersection of the radius- closed neighborhood with is nonempty an…