129 results on '"Ryan R. Martin"'
Search Results
2. Counting paths, cycles, and blow-ups in planar graphs.
3. On the edit distance function of the random graph.
4. Graph clustering via generalized colorings.
5. Counterexamples to a Conjecture of Harris on Hall Ratio.
6. On Generalized Turán Results in Height Two Posets.
7. Planar Turán Number of the 6-Cycle.
8. The maximum number of 10- and 12-cycles in a planar graph.
9. Ore and Chvátal-type degree conditions for bootstrap percolation from small sets.
10. Regular colorings in regular graphs.
11. On the edit distance of powers of cycles.
12. Splits with forbidden subgraphs.
13. Accumulation points of the edit distance function.
14. Powers of Hamiltonian cycles in multipartite graphs.
15. Polychromatic colorings of complete graphs with respect to 1-, 2-factors and Hamiltonian cycles.
16. Tiling Tripartite Graphs with 3-Colorable Graphs: The Extreme Case.
17. Stability of the Potential Function.
18. The saturation number of induced subposets of the Boolean lattice.
19. Asymptotic multipartite version of the Alon-Yuster theorem.
20. An Asymptotic Multipartite Kühn-Osthus Theorem.
21. The maximum number of paths of length four in a planar graph.
22. Induced and non-induced poset saturation problems.
23. On the path separation number of graphs.
24. On difference graphs and the local dimension of posets.
25. On the computation of edit distance functions.
26. A Simple Proof for a Forbidden Subposet Problem.
27. Improved Bounds for Induced Poset Saturation.
28. On difference graphs and the local dimension of posets.
29. Identifying codes in random networks.
30. On the Edit Distance from K2, t-Free Graphs.
31. Twins in graphs.
32. On diamond-free subposets of the Boolean lattice.
33. Induced saturation number.
34. Q 2-free Families in the Boolean Lattice.
35. Polychromatic Colorings on the Integers.
36. The diameter game.
37. On Avoider-Enforcer Games.
38. On the editing distance of graphs.
39. Quadripartite version of the Hajnal-Szemerédi theorem.
40. Codes identifying sets of vertices in random networks.
41. Randomly generated intersecting hypergraphs II.
42. On weighted Ramsey numbers.
43. A note on short cycles in a hypercube.
44. Sub-Ramsey Numbers for Arithmetic Progressions.
45. On the Strong Chromatic Number of Graphs.
46. The emergence of a giant component in random subgraphs of pseudo-random graphs.
47. Adding random edges to dense graphs.
48. A note on G-intersecting families.
49. How many random edges make a dense graph hamiltonian?
50. Tripartite version of the Corrádi-Hajnal theorem.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.