default search action
Ryan R. Martin
Person information
- affiliation: Iowa State University, Ames, IA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j55]Christopher Cox
, Ryan R. Martin
The maximum number of 10- and 12-cycles in a planar graph. Discret. Math. 346(2): 113245 (2023) - 2022
- [j54]Ryan R. Martin
On the edit distance function of the random graph. Comb. Probab. Comput. 31(2): 345-367 (2022) - [j53]Maria Axenovich, Ryan R. Martin
Splits with forbidden subgraphs. Discret. Math. 345(2): 112689 (2022) - [j52]Louis DeBiasio, Ryan R. Martin
Powers of Hamiltonian cycles in multipartite graphs. Discret. Math. 345(4): 112747 (2022) - [j51]Christopher Cox
Accumulation points of the edit distance function. Discret. Math. 345(7): 112857 (2022) - [j50]Erik Carlson, Ryan R. Martin
Large monochromatic components of small diameter. J. Graph Theory 99(2): 247-250 (2022) - [j49]Christopher Cox
Counting paths, cycles, and blow-ups in planar graphs. J. Graph Theory 101(3): 521-558 (2022) - [j48]József Balogh, Ryan R. Martin
On Generalized Turán Results in Height Two Posets. SIAM J. Discret. Math. 36(2): 1483-1495 (2022) - [j47]Adam Blumenthal, Bernard Lidický
Counterexamples to a Conjecture of Harris on Hall Ratio. SIAM J. Discret. Math. 36(3): 1678-1686 (2022) - [j46]Debarun Ghosh, Ervin Györi
Planar Turán Number of the 6-Cycle. SIAM J. Discret. Math. 36(3): 2028-2050 (2022) - [j45]András London
Graph clustering via generalized colorings. Theor. Comput. Sci. 918: 94-104 (2022) - 2021
- [j44]Debarun Ghosh
The maximum number of paths of length four in a planar graph. Discret. Math. 344(5): 112317 (2021) - [j43]Balázs Keszegh, Nathan Lemons, Ryan R. Martin
Induced and non-induced poset saturation problems. J. Comb. Theory A 184: 105497 (2021) - 2020
- [j42]Ryan R. Martin
A Simple Proof for a Forbidden Subposet Problem. Electron. J. Comb. 27(1): 1 (2020) - [j41]Ryan R. Martin
Improved Bounds for Induced Poset Saturation. Electron. J. Comb. 27(2): 2 (2020) - [j40]Anton Bernshteyn, Omid Khormali, Ryan R. Martin
Regular colorings in regular graphs. Discuss. Math. Graph Theory 40(3): 795-806 (2020) - [j39]Jinha Kim
On difference graphs and the local dimension of posets. Eur. J. Comb. 86: 103074 (2020) - [j38]Michael Dairyko, Michael Ferrara, Bernard Lidický
Ore and Chvátal-type degree conditions for bootstrap percolation from small sets. J. Graph Theory 94(2): 252-266 (2020)
2010 – 2019
- 2019
- [j37]Zhanar Berikkyzy
On the edit distance of powers of cycles. Discret. Math. 342(10): 2804-2817 (2019) - [j36]Maria Axenovich, John L. Goldwasser, Bernard Lidický, Ryan R. Martin, David Offner, John M. Talbot, Michael Young:
Polychromatic Colorings on the Integers. Integers 19: A18 (2019) - 2018
- [j35]Kirsten Hogenson
Tiling Tripartite Graphs with 3-Colorable Graphs: The Extreme Case. Graphs Comb. 34(5): 1049-1075 (2018) - [j34]Maria Axenovich, John L. Goldwasser, Ryan Hansen
Polychromatic colorings of complete graphs with respect to 1-, 2-factors and Hamiltonian cycles. J. Graph Theory 87(4): 660-671 (2018) - [j33]Catherine Erbes, Michael Ferrara, Ryan R. Martin
Stability of the Potential Function. SIAM J. Discret. Math. 32(3): 2313-2331 (2018) - [i1]Jinha Kim, Ryan R. Martin, Tomás Masarík
On difference graphs and the local dimension of posets. CoRR abs/1803.08641 (2018) - 2017
- [j32]Michael Ferrara, Bill Kay
The saturation number of induced subposets of the Boolean lattice. Discret. Math. 340(10): 2479-2487 (2017) - [j31]Ryan R. Martin
Asymptotic multipartite version of the Alon-Yuster theorem. J. Comb. Theory B 127: 32-52 (2017) - [j30]Ryan R. Martin
An Asymptotic Multipartite Kühn-Osthus Theorem. SIAM J. Discret. Math. 31(3): 1498-1513 (2017) - 2016
- [j29]József Balogh, Béla Csaba
On the path separation number of graphs. Discret. Appl. Math. 213: 26-33 (2016) - 2015
- [j28]Ryan R. Martin
On the computation of edit distance functions. Discret. Math. 338(2): 291-305 (2015) - 2014
- [j27]Maria Axenovich, Ryan R. Martin
Twins in graphs. Eur. J. Comb. 39: 188-197 (2014) - [j26]Ryan R. Martin
On the Edit Distance from K2, t-Free Graphs. J. Graph Theory 77(2): 117-143 (2014) - 2013
- [j25]Ryan R. Martin:
The Edit Distance Function and Symmetrization. Electron. J. Comb. 20(3): 26 (2013) - [j24]Lucas Kramer, Ryan R. Martin
On diamond-free subposets of the Boolean lattice. J. Comb. Theory A 120(3): 545-560 (2013) - 2012
- [j23]Ryan R. Martin
Induced saturation number. Discret. Math. 312(21): 3096-3106 (2012) - [j22]Maria Axenovich, Jacob Manske, Ryan R. Martin
Q 2-free Families in the Boolean Lattice. Order 29(1): 177-191 (2012) - 2011
- [j21]András Csernenszky, Ryan R. Martin, András Pluhár:
On the Complexity of Chooser-Picker Positional Games. Integers 11: G2 (2011)
2000 – 2009
- 2009
- [j20]Ryan R. Martin, Yi Zhao:
Tiling Tripartite Graphs with 3-Colorable Graphs. Electron. J. Comb. 16(1) (2009) - [j19]József Balogh, Ryan R. Martin
The diameter game. Random Struct. Algorithms 35(3): 369-389 (2009) - [j18]József Balogh, Ryan R. Martin
On Avoider-Enforcer Games. SIAM J. Discret. Math. 23(2): 901-908 (2009) - 2008
- [j17]Maria Axenovich, Ryan R. Martin:
Avoiding Rainbow Induced Subgraphs in Vertex-Colorings. Electron. J. Comb. 15(1) (2008) - [j16]József Balogh, Ryan R. Martin:
Edit Distance and its Computation. Electron. J. Comb. 15(1) (2008) - [j15]Ryan R. Martin
Quadripartite version of the Hajnal-Szemerédi theorem. Discret. Math. 308(19): 4337-4360 (2008) - [j14]Maria Axenovich, André E. Kézdy
On the editing distance of graphs. J. Graph Theory 58(2): 123-138 (2008) - 2007
- [j13]Maria Axenovich, Ryan R. Martin:
On weighted Ramsey numbers. Australas. J Comb. 38: 179-194 (2007) - [j12]Alan M. Frieze
Codes identifying sets of vertices in random networks. Discret. Math. 307(9-10): 1094-1107 (2007) - [j11]Tom Bohman
Randomly generated intersecting hypergraphs II. Random Struct. Algorithms 30(1-2): 17-34 (2007) - 2006
- [j10]Ryan R. Martin:
A note on a conjecture of Gyarfas. Ars Comb. 79 (2006) - [j9]Maria Axenovich, Ryan R. Martin
A note on short cycles in a hypercube. Discret. Math. 306(18): 2212-2218 (2006) - [j8]Maria Axenovich, Ryan R. Martin
Sub-Ramsey Numbers for Arithmetic Progressions. Graphs Comb. 22(3): 297-309 (2006) - [j7]Maria Axenovich, Ryan R. Martin
On the Strong Chromatic Number of Graphs. SIAM J. Discret. Math. 20(3): 741-747 (2006) - 2005
- [c1]Alan M. Frieze, Ryan R. Martin
Identifying codes in random networks. ISIT 2005: 1464-1467 - 2004
- [j6]Alan M. Frieze
The emergence of a giant component in random subgraphs of pseudo-random graphs. Random Struct. Algorithms 24(1): 42-50 (2004) - [j5]Tom Bohman
Adding random edges to dense graphs. Random Struct. Algorithms 24(2): 105-117 (2004) - 2003
- [j4]Tom Bohman
On Randomly Generated Intersecting Hypergraphs. Electron. J. Comb. 10 (2003) - [j3]Tom Bohman
A note on G-intersecting families. Discret. Math. 260(1-3): 183-188 (2003) - [j2]Tom Bohman
How many random edges make a dense graph hamiltonian? Random Struct. Algorithms 22(1): 33-42 (2003) - 2002
- [j1]Csaba Magyar, Ryan R. Martin
Tripartite version of the Corrádi-Hajnal theorem. Discret. Math. 254(1-3): 289-308 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: