29.3k citations
- D. Schaile9 profiles92 · h 87
- M. Strauss11 profiles86 · h 130
- K. M. Chan2 profiles80
- A. Meyer3 profiles78 · h 142
- B. Åsman9 profiles78 · h 98
- C. Bélanger-Champagne2 profiles78
- S. Strandberg3 profiles78 · h 88
- A. Quadt10 profiles77 · h 86
- A. Sopczak2 profiles77 · h 83
- G. Borissov3 profiles77 · h 100
- H. Fox4 profiles77 · h 51
- P. Lebrun12 profiles77 · h 54
- University of California, BerkeleyUS114 papers
- Columbia UniversityUS105 papers
- University of WashingtonUS105 papers
- Fermi National Accelerator LaboratoryUS101 papers
- University of Maryland, College ParkUS98 papers
- University of ArizonaUS97 papers
- University of MichiganUS90 papers
- University of Notre DameUS87 papers
- Ludwig-Maximilians-Universität MünchenDE86 papers
- Brown UniversityUS85 papers
- Imperial College LondonGB84 papers
- Rice UniversityUS84 papers
21 papers · 1 filter
Decompositions into subgraphs of small diameter
Jacob Fox, Benny Sudakov
We investigate decompositions of a graph into a small number of low diameter subgraphs. Let P(n,ε,d) be the smallest k such that every graph G=(V,E) on n vertices has an edge parti…
Enumeration of non-crossing pairings on bit strings
Todd Kemp, Karl Mahlburg, Amarpreet Rattan +1
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings $1^{n_1}…
Paths and stability number in digraphs
Jacob Fox, Benny Sudakov
The Gallai-Milgram theorem says that the vertex set of any digraph with stability number k can be partitioned into k directed paths. In 1990, Hahn and Jackson conjectured that this…
Large almost monochromatic subsets in hypergraphs
David Conlon, Jacob Fox, Benny Sudakov
We show that for all and there is a constant such that every -coloring of the triples of an -element set contains a subset of size $c\sqrt…
A note on embedding hypertrees
Po-Shen Loh
A classical result from graph theory is that every graph with chromatic number χ> t contains a subgraph with all degrees at least t, and therefore contains a copy of every t-edge t…
Directed graphs without short cycles
Jacob Fox, Peter Keevash, Benny Sudakov
For a directed graph without loops or parallel edges, let denote the size of the smallest feedback arc set, i.e., the smallest subset such that $G \sm X…