The following pages link to Ryan R. Martin (Q313785):
Displaying 50 items.
- On the path separation number of graphs (Q313786) (← links)
- Rainbow arithmetic progressions (Q344442) (← links)
- Multicolor and directed edit distance (Q357457) (← links)
- The edit distance function and symmetrization (Q396842) (← links)
- Induced saturation number (Q456647) (← links)
- On the computation of edit distance functions (Q472982) (← links)
- (Q766138) (redirect page) (← links)
- \(Q _{2}\)-free families in the Boolean lattice (Q766139) (← links)
- Sub-Ramsey numbers for arithmetic progressions (Q855300) (← links)
- Codes identifying sets of vertices in random networks (Q870971) (← links)
- Quadripartite version of the Hajnal-Szemerédi theorem (Q941371) (← links)
- Expected values of parameters associated with the minimum rank of a graph (Q972786) (← links)
- Avoiding rainbow induced subgraphs in vertex-colorings (Q1010717) (← links)
- Edit distance and its computation (Q1010726) (← links)
- On randomly generated intersecting hypergraphs (Q1408534) (← links)
- Tripartite version of the Corrádi-Hajnal theorem (Q1613547) (← links)
- A note on the size of \(\mathscr{N}\)-free families (Q1677188) (← links)
- On the approximate shape of degree sequences that are not potentially \(H\)-graphic (Q1713791) (← links)
- Tiling tripartite graphs with 3-colorable graphs: the extreme case (Q1756047) (← links)
- A note on \(G\)-intersecting families (Q1861255) (← links)
- Lower bounds for identifying codes in some infinite grids (Q1960276) (← links)
- On difference graphs and the local dimension of posets (Q1987070) (← links)
- The saturation number of induced subposets of the Boolean lattice (Q2012537) (← links)
- Induced and non-induced poset saturation problems (Q2049440) (← links)
- Powers of Hamiltonian cycles in multipartite graphs (Q2075502) (← links)
- Graph clustering via generalized colorings (Q2136276) (← links)
- Regular colorings in regular graphs (Q2175238) (← links)
- Improved bounds for induced poset saturation (Q2185221) (← links)
- A simple proof for a forbidden subposet problem (Q2290360) (← links)
- On the edit distance of powers of cycles (Q2317648) (← links)
- Tiling tripartite graphs with 3-colorable graphs (Q2380267) (← links)
- Asymptotic multipartite version of the Alon-Yuster theorem (Q2407378) (← links)
- Twins in graphs (Q2441959) (← links)
- A note on short cycles in a hypercube (Q2509296) (← links)
- The maximum number of paths of length four in a planar graph (Q2659227) (← links)
- Splits with forbidden subgraphs (Q2666586) (← links)
- On the complexity of chooser-picker positional games (Q2898395) (← links)
- On the edit distance from \(K_{2,t}\)-free graphs (Q2922222) (← links)
- The edit distance in graphs: Methods, results, and generalizations (Q2957174) (← links)
- The diameter game (Q3055780) (← links)
- Randomly generated intersecting hypergraphs II (Q3419609) (← links)
- A note on a conjecture of Gy\'arf\'as (Q3428658) (← links)
- (Q3433917) (← links)
- On the editing distance of graphs (Q3506314) (← links)
- On Avoider-Enforcer Games (Q3563950) (← links)
- (Q3838205) (← links)
- (Q4379750) (← links)
- The emergence of a giant component in random subgraphs of pseudo-random graphs (Q4446876) (← links)
- Adding random edges to dense graphs (Q4459584) (← links)
- Stability of the Potential Function (Q4684741) (← links)
