2 papers
math.CO2023
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…
math.CO2023
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…