4 citations · 6 across the 10 of their papers we have counts for
6 papers · 1 filter
The growth rate of multicolor Ramsey numbers of -graphs
Domagoj Bradač, Jacob Fox, Benny Sudakov
The -color Ramsey number of a -uniform hypergraph denoted , is the minimum integer such that any coloring of the edges of the complete -uniform hypergraph…
Ramsey numbers of hypergraphs of a given size
Domagoj Bradač, Jacob Fox, Benny Sudakov
The -color Ramsey number of a -uniform hypergraph is the minimum integer such that any -coloring of the complete -uniform hypergraph on vertices contains a…
Large cliques or co-cliques in hypergraphs with forbidden order-size pairs
Maria Axenovich, Domagoj Bradač, Lior Gishboliner +2
The well-known Erdős-Hajnal conjecture states that for any graph , there exists such that every -vertex graph that contains no induced copy of has a homogeneous…
Minimum Degree Threshold for -factors with High Discrepancy
Domagoj Bradač, Micha Christoph, Lior Gishboliner
Given a graph , a perfect -factor in a graph is a collection of vertex-disjoint copies of spanning . Kühn and Osthus showed that the minimum degree threshold for a…
Weighted Turán theorems with applications to Ramsey-Turán type of problems
József Balogh, Domagoj Bradač, Bernard Lidický
We study extensions of Turán Theorem in edge-weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique…
Effective bounds for induced size-Ramsey numbers of cycles
Domagoj Bradač, Nemanja Draganić, Benny Sudakov
The induced size-Ramsey number of a graph is the smallest number of edges a (host) graph can have such that for any -coloring of its edges, the…