Ryan R. Martin

Publication Activity (10 Years)

Years Active: 2002-2023
Publications (10 Years): 29

Top Topics

Series Parallel

Top Venues

SIAM J. Discret. Math.

J. Graph Theory

Electron. J. Comb.

Publications

Christopher Cox, Ryan R. Martin
The maximum number of 10- and 12-cycles in a planar graph. Discret. Math. 346 (2) (2023)
Christopher Cox, Ryan R. Martin
Counting paths, cycles, and blow-ups in planar graphs. J. Graph Theory 101 (3) (2022)
Adam Blumenthal, Bernard Lidický, Ryan R. Martin, Sergey Norin, Florian Pfender, Jan Volec
Counterexamples to a Conjecture of Harris on Hall Ratio. SIAM J. Discret. Math. 36 (3) (2022)
Debarun Ghosh, Ervin Györi, Ryan R. Martin, Addisu Paulos, Chuanqi Xiao
Planar Turán Number of the 6-Cycle. SIAM J. Discret. Math. 36 (3) (2022)
Maria Axenovich, Ryan R. Martin
Splits with forbidden subgraphs. Discret. Math. 345 (2) (2022)
András London, Ryan R. Martin, András Pluhár
Graph clustering via generalized colorings. Theor. Comput. Sci. 918 (2022)
Erik Carlson, Ryan R. Martin, Bo Peng, Miklós Ruszinkó
Large monochromatic components of small diameter. J. Graph Theory 99 (2) (2022)
Christopher Cox, Ryan R. Martin, Daniel McGinnis
Accumulation points of the edit distance function. Discret. Math. 345 (7) (2022)
Louis DeBiasio, Ryan R. Martin, Theodore Molla
Powers of Hamiltonian cycles in multipartite graphs. Discret. Math. 345 (4) (2022)
Ryan R. Martin, Alex W. N. Riasanovsky
On the edit distance function of the random graph. Comb. Probab. Comput. 31 (2) (2022)
József Balogh, Ryan R. Martin, Dániel T. Nagy, Balázs Patkós
On Generalized Turán Results in Height Two Posets. SIAM J. Discret. Math. 36 (2) (2022)
Debarun Ghosh, Ervin Györi, Ryan R. Martin, Addisu Paulos, Nika Salia, Chuanqi Xiao, Oscar Zamora
The maximum number of paths of length four in a planar graph. Discret. Math. 344 (5) (2021)
Balázs Keszegh, Nathan Lemons, Ryan R. Martin, Dömötör Pálvölgyi, Balázs Patkós
Induced and non-induced poset saturation problems. J. Comb. Theory, Ser. A 184 (2021)
Michael Dairyko, Michael Ferrara, Bernard Lidický, Ryan R. Martin, Florian Pfender, Andrew J. Uzzell
Ore and Chvátal-type degree conditions for bootstrap percolation from small sets. J. Graph Theory 94 (2) (2020)
Ryan R. Martin, Abhishek Methuku, Andrew J. Uzzell, Shanise Walker
A Simple Proof for a Forbidden Subposet Problem. Electron. J. Comb. 27 (1) (2020)
Anton Bernshteyn, Omid Khormali, Ryan R. Martin, Jonathan Rollin, Danny Rorabaugh, Songling Shan, Andrew J. Uzzell
Regular colorings in regular graphs. Discuss. Math. Graph Theory 40 (3) (2020)
Ryan R. Martin, Heather C. Smith, Shanise Walker
Improved Bounds for Induced Poset Saturation. Electron. J. Comb. 27 (2) (2020)
Jinha Kim, Ryan R. Martin, Tomás Masarík, Warren Shull, Heather C. Smith, Andrew J. Uzzell, Zhiyu Wang
On difference graphs and the local dimension of posets. Eur. J. Comb. 86 (2020)
Maria Axenovich, John L. Goldwasser, Bernard Lidický, Ryan R. Martin, David Offner, John M. Talbot, Michael Young
Polychromatic Colorings on the Integers. Integers 19 (2019)
Zhanar Berikkyzy, Ryan R. Martin, Chelsea Peck
On the edit distance of powers of cycles. Discret. Math. 342 (10) (2019)
Jinha Kim, Ryan R. Martin, Tomás Masarík, Warren Shull, Heather C. Smith, Andrew J. Uzzell, Zhiyu Wang
On difference graphs and the local dimension of posets. CoRR (2018)
Kirsten Hogenson, Ryan R. Martin, Yi Zhao
Tiling Tripartite Graphs with 3-Colorable Graphs: The Extreme Case. Graphs Comb. 34 (5) (2018)
Maria Axenovich, John L. Goldwasser, Ryan Hansen, Bernard Lidický, Ryan R. Martin, David Offner, John M. Talbot, Michael Young
Polychromatic colorings of complete graphs with respect to 1-, 2-factors and Hamiltonian cycles. J. Graph Theory 87 (4) (2018)
Catherine Erbes, Michael Ferrara, Ryan R. Martin, Paul S. Wenger
Stability of the Potential Function. SIAM J. Discret. Math. 32 (3) (2018)
Michael Ferrara, Bill Kay, Lucas Kramer, Ryan R. Martin, Benjamin Reiniger, Heather C. Smith, Eric Sullivan
The saturation number of induced subposets of the Boolean lattice. Discret. Math. 340 (10) (2017)
Ryan R. Martin, Richard Mycroft, Jozef Skokan
An Asymptotic Multipartite Kühn-Osthus Theorem. SIAM J. Discret. Math. 31 (3) (2017)
Ryan R. Martin, Jozef Skokan
Asymptotic multipartite version of the Alon-Yuster theorem. J. Comb. Theory, Ser. B 127 (2017)
József Balogh, Béla Csaba, Ryan R. Martin, András Pluhár
On the path separation number of graphs. Discret. Appl. Math. 213 (2016)
Ryan R. Martin
On the computation of edit distance functions. Discret. Math. 338 (2) (2015)
Ryan R. Martin, Tracy McKay
On the Edit Distance from K2, t-Free Graphs. J. Graph Theory 77 (2) (2014)
Maria Axenovich, Ryan R. Martin, Torsten Ueckerdt
Twins in graphs. Eur. J. Comb. 39 (2014)
Lucas Kramer, Ryan R. Martin, Michael Young
On diamond-free subposets of the Boolean lattice. J. Comb. Theory, Ser. A 120 (3) (2013)
Ryan R. Martin
The Edit Distance Function and Symmetrization. Electron. J. Comb. 20 (3) (2013)
Maria Axenovich, Jacob Manske, Ryan R. Martin
Q 2-free Families in the Boolean Lattice. Order 29 (1) (2012)
Ryan R. Martin, Jason J. Smith
Induced saturation number. Discret. Math. 312 (21) (2012)
András Csernenszky, Ryan R. Martin, András Pluhár
On the Complexity of Chooser-Picker Positional Games. Integers 11 (2011)
József Balogh, Ryan R. Martin, András Pluhár
The diameter game. Random Struct. Algorithms 35 (3) (2009)
Ryan R. Martin, Yi Zhao
Tiling Tripartite Graphs with 3-Colorable Graphs. Electron. J. Comb. 16 (1) (2009)
József Balogh, Ryan R. Martin
On Avoider-Enforcer Games. SIAM J. Discret. Math. 23 (2) (2009)
Maria Axenovich, André E. Kézdy, Ryan R. Martin
On the editing distance of graphs. J. Graph Theory 58 (2) (2008)
Maria Axenovich, Ryan R. Martin
Avoiding Rainbow Induced Subgraphs in Vertex-Colorings. Electron. J. Comb. 15 (1) (2008)
József Balogh, Ryan R. Martin
Edit Distance and its Computation. Electron. J. Comb. 15 (1) (2008)
Ryan R. Martin, Endre Szemerédi
Quadripartite version of the Hajnal-Szemerédi theorem. Discret. Math. 308 (19) (2008)
Tom Bohman, Alan M. Frieze, Ryan R. Martin, Miklós Ruszinkó, Clifford D. Smyth
Randomly generated intersecting hypergraphs II. Random Struct. Algorithms 30 (1-2) (2007)
Maria Axenovich, Ryan R. Martin
On weighted Ramsey numbers. Australas. J Comb. 38 (2007)
Alan M. Frieze, Ryan R. Martin, Julien Moncel, Miklós Ruszinkó, Clifford D. Smyth
Codes identifying sets of vertices in random networks. Discret. Math. 307 (9-10) (2007)
Ryan R. Martin
A note on a conjecture of Gyarfas. Ars Comb. 79 (2006)
Maria Axenovich, Ryan R. Martin
On the Strong Chromatic Number of Graphs. SIAM J. Discret. Math. 20 (3) (2006)
Maria Axenovich, Ryan R. Martin
Sub-Ramsey Numbers for Arithmetic Progressions. Graphs Comb. 22 (3) (2006)
Maria Axenovich, Ryan R. Martin
A note on short cycles in a hypercube. Discret. Math. 306 (18) (2006)
Alan M. Frieze, Ryan R. Martin, Julien Moncel, Miklós Ruszinkó, Clifford D. Smyth
Identifying codes in random networks. ISIT (2005)
Alan M. Frieze, Michael Krivelevich, Ryan R. Martin
The emergence of a giant component in random subgraphs of pseudo-random graphs. Random Struct. Algorithms 24 (1) (2004)
Tom Bohman, Alan M. Frieze, Michael Krivelevich, Ryan R. Martin
Adding random edges to dense graphs. Random Struct. Algorithms 24 (2) (2004)
Tom Bohman, Ryan R. Martin
A note on G-intersecting families. Discret. Math. 260 (1-3) (2003)
Tom Bohman, Alan M. Frieze, Ryan R. Martin
How many random edges make a dense graph hamiltonian? Random Struct. Algorithms 22 (1) (2003)
Tom Bohman, Colin Cooper, Alan M. Frieze, Ryan R. Martin, Miklós Ruszinkó
On Randomly Generated Intersecting Hypergraphs. Electron. J. Comb. 10 (2003)
Csaba Magyar, Ryan R. Martin
Tripartite version of the Corrádi-Hajnal theorem. Discret. Math. 254 (1-3) (2002)