1 citations · 1 across the 10 of their papers we have counts for
11 papers
Off-diagonal Ramsey numbers
Domagoj Bradač
For positive integers and , the Ramsey number is the minimum integer such that any graph on vertices contains a clique of size or an independent set of…
Hamiltonicity of regular sublinear expanders
Domagoj Bradač, Oliver Janzer
We say that a -regular graph is a -expander if for every not too large set of vertices , there are at least edges leaving , and we say that a graph is -…
Coloring small locally sparse degenerate graphs and related problems
Domagoj Bradač, Jacob Fox, Raphael Steiner +2
The classic upper bound on the chromatic number of -degenerate graphs is , shown to be tight by complete graphs. A natural question is whether this bound remains tight if o…
Ramsey numbers of digraphs with local edge structure
Domagoj Bradač, Patryk Morawski, Benny Sudakov +1
One of the classical topics in graph Ramsey theory is the study of which -vertex graphs have Ramsey numbers that are linear in . In this paper, we consider this problem in th…
Ordered Ramsey numbers of graphs with edges
Domagoj Bradač, Patryk Morawski, Benny Sudakov +1
Given a vertex-ordered graph , the ordered Ramsey number is the minimum integer such that every -coloring of the edges of the complete ordered graph contai…
Unique subgraphs are rare
Domagoj Bradač, Micha Christoph
A folklore result attributed to Pólya states that there are non-isomorphic graphs on vertices. Given two graphs and , we say that is…
Counting subgraphs in locally dense graphs
Domagoj Bradač, Benny Sudakov, Yuval Wigderson
A graph is said to be -locally dense if every induced subgraph of with linearly many vertices has edge density at least . A famous conjecture of Kohayakawa, Nagle, Rö…
The extremal number of cycles with all diagonals
Domagoj Bradač, Abhishek Methuku, Benny Sudakov
In 1975, Erdős asked the following natural question: What is the maximum number of edges that an -vertex graph can have without containing a cycle with all diagonals? Erdős obse…
A generalization of Turán's theorem
Domagoj Bradač
We prove a generalization of Turán's theorem proposed by Balogh and Lidický.
The Turán number of the grid
Domagoj Bradač, Oliver Janzer, Benny Sudakov +1
For a positive integer , let denote the graph of the grid. Motivated by a 50-year-old conjecture of Erdős about Turán numbers of -degenerate graphs, we prov…
Turán numbers of sunflowers
Domagoj Bradač, Matija Bucić, Benny Sudakov
A collection of distinct sets is called a sunflower if the intersection of any pair of sets equals the common intersection of all the sets. Sunflowers are fundamental objects in ex…