48 results on '"Draganić, Nemanja"'
Search Results
2. Effective Bounds for Induced Size-Ramsey Numbers of Cycles
3. Hamiltonicity of expanders: optimal bounds and applications
4. Long induced paths in expanders
5. Edge-disjoint paths in expanders: online with removals
6. Optimal Hamilton covers and linear arboricity for random graphs
7. Size-Ramsey numbers of structurally sparse graphs
8. Cycles with many chords
9. A generalization of Bondy's pancyclicity theorem
10. Chv\'atal-Erd\H{o}s condition for pancyclicity
11. Effective bounds for induced size-Ramsey numbers of cycles
12. Pancyclicity of Hamiltonian graphs
13. Size-Ramsey numbers of graphs with maximum degree three
14. Edge-disjoint paths in expanders: online with removals
15. Tight bounds for divisible subdivisions
16. Ramsey number of 1-subdivisions of transitive tournaments
17. Short proofs for long induced paths
18. The largest hole in sparse random graphs
19. Tight bound for powers of Hamilton cycles in tournaments
20. Tight bounds for divisible subdivisions
21. A Note on Powers of Paths in Tournaments
22. Powers of paths in tournaments
23. Rolling backwards can move you forward: on embedding problems in sparse expanders
24. The size-Ramsey number of short subdivisions
25. Large induced matchings in random graphs
26. Large induced trees in dense random graphs
27. Universal and unavoidable graphs
28. Tight bounds for powers of Hamilton cycles in tournaments
29. A Ramsey Theorem for Multiposets
30. Unavoidable Hypergraphs
31. A generalization of Bondy’s pancyclicity theorem
32. Cycles with many chords.
33. A Ramsey theorem for multiposets
34. Rolling backwards can move you forward: on embedding problems in sparse expanders
35. The Largest Hole in Sparse Random Graphs
36. A generalization of Bondy’s pancyclicity theorem
37. Chvátal-Erdős condition for pancyclicity
38. Ramsey number of 1-subdivisions of transitive tournaments
39. A characterization of idempotent strong Mal’cev conditions for congruence meet-semidistributivity in locally finite varieties
40. Rolling backwards can move you forward: On embedding problems in sparse expanders
41. The largest hole in sparse random graphs
42. Short proofs for long induced paths
43. Unavoidable hypergraphs
44. Universal and unavoidable graphs
45. Powers of paths in tournaments
46. The size‐Ramsey number of short subdivisions
47. Large Induced Matchings in Random Graphs
48. Embedding problems in graphs and digraphs
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.