From the 1 of 4 linked papers with an AI index.
4 papers
Efficient Hamilton covers and linear arboricity of random graphs
Nemanja DraganiÄ, Michael Krivelevich
The paper proves that the minimum possible size of a Hamilton cover in binomial random graphs matches the trivial lower bound across a wide range of edge probabilities, and also sh…
Size-Ramsey numbers of graphs with maximum degree three
Nemanja DraganiÄ, Kalina Petrova
The size-Ramsey number of a graph is the smallest number of edges a (host) graph can have, such that for any red/blue colouring of , there is a monochromati…
Cycle-factors of regular graphs via entropy
Micha Christoph, Nemanja DraganiÄ, António Girão +3
It is a classical result that a random permutation of elements has, on average, about cycles. We generalise this fact to all directed -regular graphs on vertice…
Disjoint connected dominating sets in pseudorandom graphs
Nemanja DraganiÄ, Michael Krivelevich
A connected dominating set (CDS) in a graph is a dominating set of vertices that induces a connected subgraph. Having many disjoint CDSs in a graph can be considered as a measure o…