The following pages link to Nemanja Draganić (Q1991580):
Displayed 24 items.
- A characterization of idempotent strong Mal'cev conditions for congruence meet-semidistributivity in locally finite varieties (Q1991583) (← links)
- Tight bounds for powers of Hamilton cycles in tournaments (Q2101176) (← links)
- Ramsey number of 1-subdivisions of transitive tournaments (Q2171017) (← links)
- A Ramsey theorem for multiposets (Q2323089) (← links)
- Rolling backwards can move you forward: On embedding problems in sparse expanders (Q5082387) (← links)
- Large Induced Matchings in Random Graphs (Q5854458) (← links)
- Powers of paths in tournaments (Q5886115) (← links)
- Universal and unavoidable graphs (Q5886120) (← links)
- Short proofs for long induced paths (Q5886345) (← links)
- The largest hole in sparse random graphs (Q6052472) (← links)
- The size‐Ramsey number of short subdivisions (Q6074649) (← links)
- (Q6147255) (← links)
- Tight bounds for divisible subdivisions (Q6187340) (← links)
- Large induced trees in dense random graphs (Q6338188) (← links)
- A Note on Powers of Paths in Tournaments (Q6351423) (← links)
- Size-Ramsey numbers of graphs with maximum degree three (Q6404642) (← links)
- Pancyclicity of Hamiltonian graphs (Q6410027) (← links)
- Effective bounds for induced size-Ramsey numbers of cycles (Q6424295) (← links)
- Chv\'atal-Erd\H{o}s condition for pancyclicity (Q6424297) (← links)
- A generalization of Bondy's pancyclicity theorem (Q6427550) (← links)
- Cycles with many chords (Q6440427) (← links)
- Size-Ramsey numbers of structurally sparse graphs (Q6444739) (← links)
- Optimal Hamilton covers and linear arboricity for random graphs (Q6455584) (← links)
- Edge-disjoint paths in expanders: online with removals (Q6455887) (← links)