The following pages link to Jacob Fox (Q290804):
Displaying 50 items.
- A tight bound for Green's arithmetic triangle removal lemma in vector spaces (Q4575849) (← links)
- Permutation Property Testing under Different Metrics with Low Query Complexity (Q4575850) (← links)
- Erdos-Hajnal conjecture for graphs with bounded VC-dimension (Q4580118) (← links)
- (Q4589009) (← links)
- (Q4623033) (← links)
- Rainbow Arithmetic Progressions and Anti-Ramsey Results (Q4655903) (← links)
- Decompositions into Subgraphs of Small Diameter (Q4911111) (← links)
- Combinatorial anti-concentration inequalities, with applications (Q4958638) (← links)
- Triforce and corners (Q4958657) (← links)
- Erratum: On Regularity Lemmas and their Algorithmic Applications (Q4962595) (← links)
- Tomescu's Graph Coloring Conjecture for $\ell$-Connected Graphs (Q4997140) (← links)
- Acyclic subgraphs of tournaments with high chromatic number (Q4999677) (← links)
- Finding cliques in social networks: a new distribution-free model (Q5002730) (← links)
- Popular Progression Differences in Vector Spaces (Q5006287) (← links)
- Independent sets in hypergraphs with a forbidden link (Q5012711) (← links)
- Common and Sidorenko Linear Equations (Q5021369) (← links)
- Threshold Ramsey multiplicity for odd cycles (Q5054757) (← links)
- Discrepancy in modular arithmetic progressions (Q5056330) (← links)
- Pure pairs. III. Sparse graphs with no polynomial‐sized anticomplete pairs (Q5066924) (← links)
- (Q5088966) (← links)
- Finding Cliques in Social Networks: A New Distribution-Free Model (Q5112249) (← links)
- A completion of the proof of the Edge-statistics Conjecture (Q5126755) (← links)
- Ramsey-type results for semi-algebraic relations (Q5174491) (← links)
- Ramsey-Type Problem for an Almost Monochromatic $K_4$ (Q5189505) (← links)
- Efficient arithmetic regularity and removal lemmas for induced bipartite patterns (Q5211002) (← links)
- Popular progression differences in vector spaces II (Q5211015) (← links)
- Books versus Triangles at the Extremal Density (Q5215901) (← links)
- A fast new algorithm for weak graph regularity (Q5222555) (← links)
- On Ramsey numbers of hedgehogs (Q5222572) (← links)
- Tower-type bounds for unavoidable patterns in words (Q5241496) (← links)
- Distinct Volume Subsets (Q5251621) (← links)
- Cycle packing (Q5256386) (← links)
- The Number of Edges in $k$-Quasi-planar Graphs (Q5300510) (← links)
- On graphs decomposable into induced matchings of linear sizes (Q5357047) (← links)
- Density and regularity theorems for semi-algebraic hypergraphs (Q5363051) (← links)
- Easily Testable Graph Properties (Q5364250) (← links)
- (Q5365106) (← links)
- Overlap properties of geometric expanders (extended abstract) (Q5365109) (← links)
- On Regularity Lemmas and their Algorithmic Applications (Q5366957) (← links)
- On grids in topological graphs (Q5370741) (← links)
- Intersection patterns of curves (Q5392191) (← links)
- Short Proofs of Some Extremal Results (Q5414143) (← links)
- Applications of a New Separator Theorem for String Graphs (Q5414146) (← links)
- There exist graphs with super‐exponential Ramsey multiplicity constant (Q5441404) (← links)
- A Bipartite Strengthening of the Crossing Lemma (Q5452205) (← links)
- On minimal colorings without monochromatic solutions to a linear equation (Q5754476) (← links)
- (Q5754488) (← links)
- A Note on the Erdös Distinct Subset Sums Problem (Q5854463) (← links)
- On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion (Q5855529) (← links)
- The regularity method for graphs with few 4‐cycles (Q5874028) (← links)
