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 2024Show all

2 papers · 1 filter

math.CO2024

Clique density vs blowups

Domagoj Bradač, Hong Liu, Zhuo Wu +1

A well-known theorem of Nikiforov asserts that any graph with a positive $K_{r}$ -density contains a logarithmic blowup of $K_{r}$ . In this paper, we explore variants of Nikiforov's r…

math.CO2024

On a question of Erdős and Nešetřil about minimal cuts in a graph

Domagoj Bradač

Answering a question of Erdős and Nešetřil, we show that the maximum number of inclusion-wise minimal vertex cuts in a graph on $n$ vertices is at most $1.889 9^{n}$ for large enough…