Ryan R. Martin

Orcid: 0000-0003-0683-1414

Affiliations:
  • Iowa State University, Ames, IA, USA


According to our database1, Ryan R. Martin authored at least 56 papers between 2002 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
The maximum number of 10- and 12-cycles in a planar graph.
Discret. Math., 2023

2022
Planar Turán Number of the 6-Cycle.
SIAM J. Discret. Math., September, 2022

On Generalized Turán Results in Height Two Posets.
SIAM J. Discret. Math., June, 2022

Graph clustering via generalized colorings.
Theor. Comput. Sci., 2022

Counterexamples to a Conjecture of Harris on Hall Ratio.
SIAM J. Discret. Math., 2022

Counting paths, cycles, and blow-ups in planar graphs.
J. Graph Theory, 2022

Large monochromatic components of small diameter.
J. Graph Theory, 2022

Powers of Hamiltonian cycles in multipartite graphs.
Discret. Math., 2022

Accumulation points of the edit distance function.
Discret. Math., 2022

Splits with forbidden subgraphs.
Discret. Math., 2022

On the edit distance function of the random graph.
Comb. Probab. Comput., 2022

2021
Induced and non-induced poset saturation problems.
J. Comb. Theory, Ser. A, 2021

The maximum number of paths of length four in a planar graph.
Discret. Math., 2021

2020
Ore and Chvátal-type degree conditions for bootstrap percolation from small sets.
J. Graph Theory, 2020

On difference graphs and the local dimension of posets.
Eur. J. Comb., 2020

Regular colorings in regular graphs.
Discuss. Math. Graph Theory, 2020

Improved Bounds for Induced Poset Saturation.
Electron. J. Comb., 2020

A Simple Proof for a Forbidden Subposet Problem.
Electron. J. Comb., 2020

2019
Polychromatic Colorings on the Integers.
Integers, 2019

On the edit distance of powers of cycles.
Discret. Math., 2019

2018
Stability of the Potential Function.
SIAM J. Discret. Math., 2018

Polychromatic colorings of complete graphs with respect to 1-, 2-factors and Hamiltonian cycles.
J. Graph Theory, 2018

Tiling Tripartite Graphs with 3-Colorable Graphs: The Extreme Case.
Graphs Comb., 2018

2017
An Asymptotic Multipartite Kühn-Osthus Theorem.
SIAM J. Discret. Math., 2017

Asymptotic multipartite version of the Alon-Yuster theorem.
J. Comb. Theory, Ser. B, 2017

The saturation number of induced subposets of the Boolean lattice.
Discret. Math., 2017

2016
On the path separation number of graphs.
Discret. Appl. Math., 2016

2015
On the computation of edit distance functions.
Discret. Math., 2015

2014
On the Edit Distance from K2, t-Free Graphs.
J. Graph Theory, 2014

Twins in graphs.
Eur. J. Comb., 2014

2013
On diamond-free subposets of the Boolean lattice.
J. Comb. Theory, Ser. A, 2013

The Edit Distance Function and Symmetrization.
Electron. J. Comb., 2013

2012
Q 2-free Families in the Boolean Lattice.
Order, 2012

Induced saturation number.
Discret. Math., 2012

2011
On the Complexity of Chooser-Picker Positional Games.
Integers, 2011

2009
On Avoider-Enforcer Games.
SIAM J. Discret. Math., 2009

The diameter game.
Random Struct. Algorithms, 2009

Tiling Tripartite Graphs with 3-Colorable Graphs.
Electron. J. Comb., 2009

2008
On the editing distance of graphs.
J. Graph Theory, 2008

Quadripartite version of the Hajnal-Szemerédi theorem.
Discret. Math., 2008

Edit Distance and its Computation.
Electron. J. Comb., 2008

Avoiding Rainbow Induced Subgraphs in Vertex-Colorings.
Electron. J. Comb., 2008

2007
Randomly generated intersecting hypergraphs II.
Random Struct. Algorithms, 2007

Codes identifying sets of vertices in random networks.
Discret. Math., 2007

On weighted Ramsey numbers.
Australas. J Comb., 2007

2006
On the Strong Chromatic Number of Graphs.
SIAM J. Discret. Math., 2006

Sub-Ramsey Numbers for Arithmetic Progressions.
Graphs Comb., 2006

A note on short cycles in a hypercube.
Discret. Math., 2006

A note on a conjecture of Gyarfas.
Ars Comb., 2006

2005
Identifying codes in random networks.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
The emergence of a giant component in random subgraphs of pseudo-random graphs.
Random Struct. Algorithms, 2004

Adding random edges to dense graphs.
Random Struct. Algorithms, 2004

2003
How many random edges make a dense graph hamiltonian?
Random Struct. Algorithms, 2003

A note on G-intersecting families.
Discret. Math., 2003

On Randomly Generated Intersecting Hypergraphs.
Electron. J. Comb., 2003

2002
Tripartite version of the Corrádi-Hajnal theorem.
Discret. Math., 2002


  Loading...