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