Domagoj Bradač

activity

20192026

most citedRobust Algorithms for the Secretary Problem

4 citations · 6 across the 10 of their papers we have counts for

collaborators

Showing 2021Show all

2 papers · 1 filter

math.CO2021

Covering random graphs with monochromatic trees

Domagoj Bradač, Matija Bucić

Given an $r$ -edge-coloured complete graph $K_{n}$ , how many monochromatic connected components does one need in order to cover its vertex set? This natural question is a well-known e…

math.CO2021

Powers of Hamilton cycles of high discrepancy are unavoidable

Domagoj Bradač

The Pósa-Seymour conjecture asserts that every graph on $n$ vertices with minimum degree at least $(1 - 1/ (r + 1)) n$ contains the $r^{t h}$ power of a Hamilton cycle. Komlós, Sárközy…