Domagoj Bradač

activity

20242026

collaborators

4 papers

math.CO2026

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 enou…

math.CO2025

Lower bounds for Ramsey numbers of bounded degree hypergraphs

Domagoj BradaÄ, Zach Hunter, Benny Sudakov

We prove that, for all $k \geq 3,$ and any integers $I^, n$ with $n \geq I^,$ there exists a $k$ -uniform hypergraph on $n$ vertices with maximum degree at most $I^$ whose $4$ -color R…

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

The growth rate of multicolor Ramsey numbers of $3$ -graphs

Domagoj BradaÄ, Jacob Fox, Benny Sudakov

The $q$ -color Ramsey number of a $k$ -uniform hypergraph $G,$ denoted $r (G; q)$ , is the minimum integer $N$ such that any coloring of the edges of the complete $k$ -uniform hypergraph…

On a question of ErdÅs and NeÅ¡etÅil about minimal cuts in a graph

Lower bounds for Ramsey numbers of bounded degree hypergraphs

Clique density vs blowups

The growth rate of multicolor Ramsey numbers of 3-graphs

On a question of ErdÅs and NeÅ¡etÅil about minimal cuts in a graph

The growth rate of multicolor Ramsey numbers of $3$ -graphs