Milos Trujic

activity

20172022

most citedLocal resilience of an almost spanning

k

-cycle in random graphs

2 citations · 2 across the 3 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

math.CO2017

Resilience of Perfect Matchings and Hamiltonicity in Random Graph Processes

Rajko Nenadov, Angelika Steger, Miloš Trujić

Let ${G_{i}}$ be the random graph process: starting with an empty graph $G_{0}$ with $n$ vertices, in every step $i \geq 1$ the graph $G_{i}$ is formed by taking an edge chosen uniform…

math.CO2017★ 2 cited

Local resilience of an almost spanning $k$ -cycle in random graphs

Nemanja Škorić, Angelika Steger, Miloš Trujić

The famous Pósa-Seymour conjecture, confirmed in 1998 by Komlós, Sárközy, and Szemerédi, states that for any $k \geq 2$ , every graph on $n$ vertices with minimum degree $kn/(k + 1)…

Resilience of Perfect Matchings and Hamiltonicity in Random Graph Processes

Local resilience of an almost spanning k-cycle in random graphs

Local resilience of an almost spanning $k$ -cycle in random graphs