2.2k citations
- Princeton UniversityUS37 papers
- Harvard UniversityUS21 papers
- California Institute of TechnologyUS13 papers
- University of OxfordGB13 papers
- University of Wisconsin–MadisonUS13 papers
- Albert Einstein College of MedicineUS12 papers
- Center for Astrophysics Harvard & SmithsonianUS12 papers
- Case Western Reserve UniversityUS11 papers
- University of California, BerkeleyUS10 papers
- University of California, Santa CruzUS10 papers
- Yale UniversityUS10 papers
- Leiden UniversityNL9 papers
4 papers · 2 filters
Ramsey numbers of sparse hypergraphs
David Conlon, Jacob Fox, Benny Sudakov
We give a short proof that any k-uniform hypergraph H on n vertices with bounded degree Δhas Ramsey number at most c(Δ, k)n, for an appropriate constant c(Δ, k). This result was re…
Additive approximation for edge-deletion problems
Noga Alon, Asaf Shapira, Benny Sudakov
A graph property is monotone if it is closed under removal of vertices and edges. In this paper we consider the following edge-deletion problem; given a monotone property P and a g…
Independent transversals in locally sparse graphs
Po-Shen Loh, Benny Sudakov
Let G be a graph with maximum degree Δwhose vertex set is partitioned into parts V(G) = V_1 \cup ... \cup V_r. A transversal is a subset of V(G) containing exactly one vertex from…
On the strong chromatic number of random graphs
Po-Shen Loh, Benny Sudakov
Let G be a graph with n vertices, and let k be an integer dividing n. G is said to be strongly k-colorable if for every partition of V(G) into disjoint sets V_1 \cup ... \cup V_r,…