default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJacob Fox
Jacob Licht
Person information
- affiliation: Stanford University, USA
- award (2014): Presidential Early Career Award for Scientists and Engineers
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j100]Jacob Fox, Tung Nguyen, Alex D. Scott, Paul D. Seymour:
Induced subgraph density. II. Sparse and dense sets in cographs. Eur. J. Comb. 124: 104075 (2025)- 2024
- [j99]Jacob Fox, Sammy Luo, Huy Tuan Pham, Yunkun Zhou:
Small subsets with large sumset: Beyond the Cauchy-Davenport bound. Comb. Probab. Comput. 33(4): 411-431 (2024) - [j98]Jacob Fox, János Pach, Andrew Suk:
Quasiplanar graphs, string graphs, and the Erdős-Gallai problem. Eur. J. Comb. 119: 103811 (2024) - [j97]Jacob Fox, Zoe M. Himwich
, Nitya Mani:
Extremal results on feedback arc sets in digraphs. Random Struct. Algorithms 64(2): 287-308 (2024) - [j96]Jacob Fox, Sammy Luo, Huy Tuan Pham:
On random irregular subgraphs. Random Struct. Algorithms 64(4): 899-917 (2024) - [j95]David Conlon, Jacob Fox, Huy Tuan Pham, Yufei Zhao:
Set-Coloring Ramsey Numbers and Error-Correcting Codes Near the Zero-Rate Threshold. IEEE Trans. Inf. Theory 70(6): 4074-4078 (2024) - [c24]Jacob Fox, János Pach, Andrew Suk:
A Structure Theorem for Pseudo-Segments and Its Applications. SoCG 2024: 59:1-59:14 - [c23]Jacob Fox, János Pach, Andrew Suk:
Enumeration of Intersection Graphs of x-Monotone Curves. GD 2024: 4:1-4:12 - [i33]Jacob Fox, Huy Tuan Pham:
A multipartite analogue of Dilworth's Theorem. CoRR abs/2401.00827 (2024) - 2023
- [j94]Jacob Fox, János Pach, Andrew Suk:
Sunflowers in Set Systems of Bounded Dimension. Comb. 43(1): 187-202 (2023) - [j93]David Conlon, Jacob Fox, Yuval Wigderson:
Three Early Problems on Size Ramsey Numbers. Comb. 43(4): 743-768 (2023) - [j92]David Conlon, Jacob Fox, Yuval Wigderson:
Off-diagonal book Ramsey numbers. Comb. Probab. Comput. 32(3): 516-545 (2023) - [j91]David Conlon, Jacob Fox, Benny Sudakov, Fan Wei:
Threshold Ramsey multiplicity for paths and even cycles. Eur. J. Comb. 107: 103612 (2023) - [j90]Jacob Fox, Zoe M. Himwich, Nitya Mani:
Making an H $H$ -free graph k $k$ -colorable. J. Graph Theory 102(2): 234-261 (2023) - [j89]Jacob Fox, Yuval Wigderson:
Minimum degree and the graph removal lemma. J. Graph Theory 102(4): 648-665 (2023) - [j88]David Conlon, Jacob Fox, Xiaoyu He, Dhruv Mubayi, Andrew Suk, Jacques Verstraëte:
Hypergraph Ramsey numbers of cliques versus stars. Random Struct. Algorithms 63(3): 610-623 (2023) - [i32]David Conlon, Jacob Fox, Huy Tuan Pham, Yufei Zhao:
Set-coloring Ramsey numbers and error-correcting codes near the zero-rate threshold. CoRR abs/2305.14132 (2023) - [i31]Jacob Fox, János Pach, Andrew Suk:
A structure theorem for pseudo-segments and its applications. CoRR abs/2312.01028 (2023) - 2022
- [j87]David Conlon, Jacob Fox, Yuval Wigderson:
Ramsey Numbers of Books and Quasirandomness. Comb. 42(3): 309-363 (2022) - [j86]Jacob Fox, Yufei Zhao:
Removal lemmas and approximate homomorphisms. Comb. Probab. Comput. 31(4): 721-736 (2022) - [j85]Jacob Fox, Xiaoyu He, Sammy Luo, Max Wenqiang Xu:
Multicolor list Ramsey numbers grow exponentially. J. Graph Theory 101(3): 389-396 (2022) - [j84]Matija Bucic, Jacob Fox, Benny Sudakov:
Clique minors in graphs with a forbidden subgraph. Random Struct. Algorithms 60(3): 327-338 (2022) - [c22]Jacob Fox, János Pach, Andrew Suk:
Quasiplanar Graphs, String Graphs, and the Erdős-Gallai Problem. GD 2022: 219-231 - [i30]Jacob Fox, Zoe M. Himwich, Nitya Mani:
Extremal results on feedback arc sets in digraphs. CoRR abs/2204.01938 (2022) - 2021
- [j83]Jacob Fox, János Pach, Andrew Suk:
Bounded VC-Dimension Implies the Schur-Erdős Conjecture. Comb. 41(6): 803-813 (2021) - [j82]Nemanja Draganic, François Dross, Jacob Fox, António Girão, Frédéric Havet, Dániel Korándi, William Lochet, David Munhá Correia, Alex D. Scott, Benny Sudakov:
Powers of paths in tournaments. Comb. Probab. Comput. 30(6): 894-898 (2021) - [j81]Jacob Fox, Cosmin Pohoata:
Sets without k-term progressions can have many shorter progressions. Random Struct. Algorithms 58(3): 383-389 (2021) - [j80]Jacob Fox, Lisa Sauermann, Fan Wei:
On the inducibility problem for random Cayley graphs of abelian groups with a few deleted vertices. Random Struct. Algorithms 59(4): 554-615 (2021) - [j79]Quentin Dubroff, Jacob Fox, Max Wenqiang Xu:
A Note on the Erdös Distinct Subset Sums Problem. SIAM J. Discret. Math. 35(1): 322-324 (2021) - [j78]John Engbers, Aysel Erey, Jacob Fox, Xiaoyu He:
Tomescu's Graph Coloring Conjecture for ℓ-Connected Graphs. SIAM J. Discret. Math. 35(2): 1478-1502 (2021) - [c21]Jacob Fox, János Pach, Andrew Suk:
Sunflowers in Set Systems of Bounded Dimension. SoCG 2021: 37:1-37:13 - [c20]Jacob Fox, János Pach, Andrew Suk:
On the Number of Edges of Separated Multigraphs. GD 2021: 223-227 - [i29]Jacob Fox, Zoe M. Himwich, Nitya Mani:
Making an $H$-Free Graph $k$-Colorable. CoRR abs/2102.10220 (2021) - [i28]Jacob Fox, János Pach, Andrew Suk:
On the number of edges of separated multigraphs. CoRR abs/2108.11290 (2021) - [i27]Jacob Fox, János Pach, Andrew Suk:
Quasiplanar graphs, string graphs, and the Erdős-Gallai problem. CoRR abs/2112.02378 (2021) - 2020
- [j77]Jacob Fox, Ray Li:
On Ramsey numbers of hedgehogs. Comb. Probab. Comput. 29(1): 101-112 (2020) - [j76]Asaf Ferber, Jacob Fox, Vishesh Jain:
Towards the linear arboricity conjecture. J. Comb. Theory B 142: 56-79 (2020) - [j75]Maria Chudnovsky, Jacob Fox, Alex Scott, Paul D. Seymour, Sophie Spirkl:
Pure pairs. III. Sparse graphs with no polynomial-sized anticomplete pairs. J. Graph Theory 95(3): 315-340 (2020) - [j74]David Conlon, Jacob Fox, Benny Sudakov:
Short proofs of some extremal results III. Random Struct. Algorithms 57(4): 958-982 (2020) - [j73]Jacob Fox, Xiaoyu He, Yuval Wigderson:
Ramsey, Paper, Scissors. Random Struct. Algorithms 57(4): 1157-1173 (2020) - [j72]Jacob Fox, Ray Li:
On edge-ordered Ramsey numbers. Random Struct. Algorithms 57(4): 1174-1204 (2020) - [j71]Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein:
Finding Cliques in Social Networks: A New Distribution-Free Model. SIAM J. Comput. 49(2): 448-464 (2020) - [j70]David Conlon, Jacob Fox, Benny Sudakov:
Books versus Triangles at the Extremal Density. SIAM J. Discret. Math. 34(1): 385-398 (2020) - [j69]Jacob Fox, Fan Wei:
On the Number of Cliques in Graphs with a Forbidden Subdivision or Immersion. SIAM J. Discret. Math. 34(4): 2556-2582 (2020) - [c19]Jacob Fox, János Pach, Andrew Suk:
Bounded VC-Dimension Implies the Schur-Erdős Conjecture. SoCG 2020: 46:1-46:8
2010 – 2019
- 2019
- [j68]Maria Chudnovsky, Jacob Fox, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Towards Erdős-Hajnal for Graphs with No 5-Hole. Comb. 39(5): 983-991 (2019) - [j67]Jacob Fox, János Pach, Andrew Suk:
Approximating the rectilinear crossing number. Comput. Geom. 81: 45-53 (2019) - [j66]Jacob Fox, László Miklós Lovász, Yufei Zhao:
A fast new algorithm for weak graph regularity. Comb. Probab. Comput. 28(5): 777-790 (2019) - [j65]David Conlon, Jacob Fox:
Lines in Euclidean Ramsey Theory. Discret. Comput. Geom. 61(1): 218-225 (2019) - [j64]Jacob Fox, János Pach, Andrew Suk:
Erdős-Hajnal Conjecture for Graphs with Bounded VC-Dimension. Discret. Comput. Geom. 61(4): 809-829 (2019) - [j63]Jacob Fox, Lior Gishboliner, Asaf Shapira, Raphael Yuster:
The removal lemma for tournaments. J. Comb. Theory B 136: 110-134 (2019) - [j62]Jacob Fox, Xiaoyu He, Freddie Manners:
A proof of Tomescu's graph coloring conjecture. J. Comb. Theory B 136: 204-221 (2019) - [c18]Jacob Fox, János Pach, Andrew Suk:
Semi-Algebraic Colorings of Complete Graphs. SoCG 2019: 36:1-36:12 - [i26]Jacob Fox, Ray Li:
On Ramsey numbers of hedgehogs. CoRR abs/1902.10221 (2019) - [i25]Jacob Fox, Jonathan Tidor, Yufei Zhao:
Induced arithmetic removal: complexity 1 patterns over finite fields. CoRR abs/1911.03427 (2019) - 2018
- [j61]Jacob Fox, János Pach, Andrew Suk:
More Distinct Distances Under Local Conditions. Comb. 38(2): 501-509 (2018) - [j60]Jacob Fox, Lisa Sauermann:
Erdős-Ginzburg-Ziv Constants by Avoiding Three-Term Arithmetic Progressions. Electron. J. Comb. 25(2): 2 (2018) - [j59]Jacob Fox, János Pach, Andrew Suk:
Ramsey-Turán Numbers for Semi-Algebraic Graphs. Electron. J. Comb. 25(4): 4 (2018) - [j58]Jacob Fox, Fan Wei:
Fast Property Testing and Metrics for Permutations. Comb. Probab. Comput. 27(4): 539-579 (2018) - [j57]Jacob Fox, László Miklós Lovász, Yufei Zhao:
Erratum: On Regularity Lemmas and their Algorithmic Applications. Comb. Probab. Comput. 27(5): 851-852 (2018) - [j56]Jacob Fox, László Miklós Lovász, Lisa Sauermann:
A polynomial bound for the arithmetic k-cycle removal lemma in vector spaces. J. Comb. Theory A 160: 186-201 (2018) - [c17]Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein:
Finding Cliques in Social Networks: A New Distribution-Free Model. ICALP 2018: 55:1-55:15 - [i24]Jacob Fox, László Miklós Lovász, Yufei Zhao:
A fast new algorithm for weak graph regularity. CoRR abs/1801.05037 (2018) - [i23]Jacob Fox, Tim Roughgarden, C. Seshadhri, Fan Wei, Nicole Wein:
Finding Cliques in Social Networks: A New Distribution-Free Model. CoRR abs/1804.07431 (2018) - [i22]Jacob Fox, Lisa Sauermann:
A completion of the proof of the Edge-statistics Conjecture. CoRR abs/1809.01352 (2018) - [i21]Asaf Ferber, Jacob Fox, Vishesh Jain:
Towards the linear arboricity conjecture. CoRR abs/1809.04716 (2018) - 2017
- [j55]Jacob Fox, László Miklós Lovász:
A tight lower bound for Szemerédi's regularity lemma. Comb. 37(5): 911-951 (2017) - [j54]Jacob Fox, László Miklós Lovász, Yufei Zhao:
On Regularity Lemmas and their Algorithmic Applications. Comb. Probab. Comput. 26(4): 481-505 (2017) - [j53]Jacob Fox, Fan Wei:
On the Local Approach to Sidorenko's Conjecture. Electron. Notes Discret. Math. 61: 459-465 (2017) - [j52]David Conlon, Jacob Fox, Choongbum Lee, Benny Sudakov:
Ordered Ramsey numbers. J. Comb. Theory B 122: 353-383 (2017) - [j51]Jacob Fox, Fan Wei:
On the number of cliques in graphs with a forbidden minor. J. Comb. Theory B 126: 175-197 (2017) - [c16]Jacob Fox, János Pach, Andrew Suk:
Erdös-Hajnal Conjecture for Graphs with Bounded VC-Dimension. SoCG 2017: 43:1-43:15 - [c15]Jacob Fox, László Miklós Lovász:
A tight bound for Green's arithmetic triangle removal lemma in vector spaces. SODA 2017: 1612-1617 - [c14]Jacob Fox, Fan Wei:
Permutation Property Testing under Different Metrics with Low Query Complexity. SODA 2017: 1618-1637 - 2016
- [j50]David Conlon, Jacob Fox, Choongbum Lee, Benny Sudakov:
Ramsey numbers of cubes versus cliques. Comb. 36(1): 37-70 (2016) - [j49]Jacob Fox, Andrey Grinshpun, Anita Liebenau, Yury Person, Tibor Szabó:
On the minimum degree of minimal Ramsey graphs for multiple colours. J. Comb. Theory B 120: 64-82 (2016) - [j48]David Conlon, Jacob Fox, Benny Sudakov:
Short proofs of some extremal results II. J. Comb. Theory B 121: 173-196 (2016) - [j47]Jacob Fox, János Pach, Andrew Suk:
A Polynomial Regularity Lemma for Semialgebraic Hypergraphs and Its Applications in Geometry and Property Testing. SIAM J. Comput. 45(6): 2199-2223 (2016) - [c13]Jacob Fox:
Discrete Geometry, Algebra, and Combinatorics (Invited Talk). SoCG 2016: 2:1-2:1 - [c12]Jacob Fox, János Pach, Andrew Suk:
Approximating the Rectilinear Crossing Number. GD 2016: 413-426 - [i20]Jacob Fox, Fan Wei:
On the number of cliques in graphs with a forbidden minor. CoRR abs/1603.07056 (2016) - [i19]Jacob Fox, János Pach, Andrew Suk:
Approximating the rectilinear crossing number. CoRR abs/1606.03753 (2016) - [i18]Jacob Fox, Fan Wei:
Fast property testing and metrics for permutations. CoRR abs/1611.01270 (2016) - 2015
- [j46]Jacob Fox, Po-Shen Loh, Yufei Zhao:
The critical window for the classical Ramsey-Turán problem. Comb. 35(4): 435-476 (2015) - [j45]Noga Alon, Jacob Fox:
Easily Testable Graph Properties. Comb. Probab. Comput. 24(4): 646-657 (2015) - [j44]Jacob Fox, Andrey Grinshpun, János Pach:
The Erdős-Hajnal conjecture for rainbow triangles. J. Comb. Theory B 111: 75-125 (2015) - [j43]David Conlon, Jacob Fox, William I. Gasarch, David G. Harris, Douglas Ulrich, Samuel Zbarsky:
Distinct Volume Subsets. SIAM J. Discret. Math. 29(1): 472-480 (2015) - [c11]Jacob Fox, János Pach, Andrew Suk:
Density and regularity theorems for semi-algebraic hypergraphs. SODA 2015: 1517-1530 - [p2]David Conlon, Jacob Fox, Benny Sudakov:
Recent developments in graph Ramsey theory. Surveys in Combinatorics 2015: 49-118 - [i17]Jacob Fox, János Pach, Andrew Suk:
A polynomial regularity lemma for semi-algebraic hypergraphs and its applications in geometry and property testing. CoRR abs/1502.01730 (2015) - [i16]Jacob Fox, János Pach, Andrew Suk:
Semi-algebraic colorings of complete graphs. CoRR abs/1505.07429 (2015) - 2014
- [j42]Matt DeVos, Zdenek Dvorák, Jacob Fox, Jessica McDonald, Bojan Mohar, Diego Scheide:
A minimum degree condition forcing complete graph immersion. Comb. 34(3): 279-298 (2014) - [j41]Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk:
On grids in topological graphs. Comput. Geom. 47(7): 710-723 (2014) - [j40]David Conlon, Jacob Fox, Benny Sudakov:
Short Proofs of Some Extremal Results. Comb. Probab. Comput. 23(1): 8-28 (2014) - [j39]Jacob Fox, János Pach:
Applications of a New Separator Theorem for String Graphs. Comb. Probab. Comput. 23(1): 66-74 (2014) - [j38]Jacob Fox, Andrey Grinshpun, Anita Liebenau, Yury Person, Tibor Szabó:
What is Ramsey-equivalent to a clique? J. Comb. Theory B 109: 120-133 (2014) - [j37]David Conlon, Jacob Fox, Benny Sudakov:
Cycle packing. Random Struct. Algorithms 45(4): 608-626 (2014) - [i15]David Conlon, Jacob Fox, William I. Gasarch, David G. Harris, Douglas Ulrich, Sam Zbarsky:
Distinct volume subsets. CoRR abs/1401.6734 (2014) - [i14]Jacob Fox, László Miklós Lovász:
A tight lower bound for Szemerédi's regularity lemma. CoRR abs/1403.1768 (2014) - 2013
- [j36]Jacob Fox, Choongbum Lee, Benny Sudakov:
Chromatic number, clique subdivisions, and the conjectures of Hajós and Erdős-Fajtlowicz. Comb. 33(2): 181-197 (2013) - [j35]David Conlon, Jacob Fox, Benny Sudakov:
An improved bound for the stepping-up lemma. Discret. Appl. Math. 161(9): 1191-1196 (2013) - [j34]Eyal Ackerman, Jacob Fox, Rom Pinchasi:
A note on light geometric graphs. Discret. Math. 313(11): 1281-1283 (2013) - [j33]Eli Berger, Krzysztof Choromanski, Maria Chudnovsky, Jacob Fox, Martin Loebl, Alex Scott, Paul D. Seymour, Stéphan Thomassé:
Tournaments and colouring. J. Comb. Theory B 103(1): 1-20 (2013) - [j32]Jacob Fox, János Pach, Andrew Suk:
The Number of Edges in k-Quasi-planar Graphs. SIAM J. Discret. Math. 27(1): 550-561 (2013) - [c10]David Conlon, Jacob Fox, János Pach, Benny Sudakov, Andrew Suk:
Ramsey-type results for semi-algebraic relations. SoCG 2013: 309-318 - [p1]David Conlon, Jacob Fox:
Graph removal lemmas. Surveys in Combinatorics 2013: 1-50 - [i13]Jacob Fox, János Pach:
Applications of a new separator theorem for string graphs. CoRR abs/1302.7228 (2013) - [i12]Jacob Fox:
Stanley-Wilf limits are typically exponential. CoRR abs/1310.8378 (2013) - 2012
- [j31]David Conlon, Jacob Fox, Benny Sudakov:
On two problems in graph Ramsey theory. Comb. 32(5): 513-535 (2012) - [j30]Jacob Fox, Po-Shen Loh:
On a problem of Erdös and Rothschild on edges in triangles. Comb. 32(6): 619-628 (2012) - [j29]Jacob Fox, János Pach:
Coloring Kk-free intersection graphs of geometric objects in the plane. Eur. J. Comb. 33(5): 853-866 (2012) - [j28]David Conlon, Jacob Fox, Benny Sudakov:
Erdős-Hajnal-type theorems in hypergraphs. J. Comb. Theory B 102(5): 1142-1154 (2012) - [c9]Jacob Fox, János Pach:
String graphs and incomparability graphs. SCG 2012: 405-414 - [i11]David Conlon, Jacob Fox, Yufei Zhao:
Extremal results in sparse pseudorandom graphs. CoRR abs/1204.6645 (2012) - [i10]David Conlon, Jacob Fox:
Graph removal lemmas. CoRR abs/1211.3487 (2012) - 2011
- [j27]Jacob Fox, János Pach, Csaba D. Tóth:
Intersection patterns of curves. J. Lond. Math. Soc. 83(2): 389-406 (2011) - [j26]Jacob Fox, Benny Sudakov:
Dependent random choice. Random Struct. Algorithms 38(1-2): 68-99 (2011) - [c8]Jacob Fox, János Pach:
Computing the Independence Number of Intersection Graphs. SODA 2011: 1161-1165 - [c7]Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assaf Naor, János Pach:
Overlap properties of geometric expanders. SODA 2011: 1188-1197 - [i9]David Conlon, Jacob Fox, Benny Sudakov:
Erdos-Hajnal-type theorems in hypergraphs. CoRR abs/1104.5544 (2011) - [i8]David Conlon, Jacob Fox:
Bounds for graph regularity and removal lemmas. CoRR abs/1107.4829 (2011) - [i7]Jacob Fox:
Constructing dense graphs with sublinear Hadwiger number. CoRR abs/1108.4953 (2011) - [i6]Noga Alon, Jacob Fox:
Testing perfection is hard. CoRR abs/1110.2828 (2011) - [i5]David Conlon, Jacob Fox, Benny Sudakov:
Two extensions of Ramsey's theorem. CoRR abs/1112.1548 (2011) - [i4]Jacob Fox, János Pach, Andrew Suk:
The number of edges in k-quasi-planar graphs. CoRR abs/1112.2361 (2011) - 2010
- [j25]Jacob Fox, Peter Keevash, Benny Sudakov:
Directed Graphs Without Short Cycles. Comb. Probab. Comput. 19(2): 285-301 (2010) - [j24]Jacob Fox, János Pach:
A Separator Theorem for String Graphs and its Applications. Comb. Probab. Comput. 19(3): 371-390 (2010) - [j23]Jacob Fox, Benny Sudakov:
Decompositions into Subgraphs of Small Diameter. Comb. Probab. Comput. 19(5-6): 753-774 (2010) - [j22]Jacob Fox, János Pach, Csaba D. Tóth:
A bipartite strengthening of the Crossing Lemma. J. Comb. Theory B 100(1): 23-35 (2010) - [j21]Jacob Fox:
Complete Minors and Independence Number. SIAM J. Discret. Math. 24(4): 1313-1321 (2010) - [c6]Jacob Fox, Fabrizio Frati, János Pach, Rom Pinchasi:
Crossings between Curves with Many Tangencies. WALCOM 2010: 1-8 - [i3]Jacob Fox, Mikhail Gromov, Vincent Lafforgue, Assaf Naor, János Pach:
Overlap properties of geometric expanders. CoRR abs/1005.1392 (2010) - [i2]Jacob Fox:
A new proof of the graph removal lemma. CoRR abs/1006.1300 (2010) - [i1]Jacob Fox, Choongbum Lee, Benny Sudakov:
Maximum union-free subfamilies. CoRR abs/1012.3127 (2010)
2000 – 2009
- 2009
- [j20]Jacob Fox, Benny Sudakov:
Density theorems for bipartite graphs and related Ramsey-type results. Comb. 29(2): 153-196 (2009) - [j19]Michael O. Albertson, Daniel W. Cranston, Jacob Fox:
Crossings, Colorings, and Cliques. Electron. J. Comb. 16(1) (2009) - [j18]Jacob Fox, Benny Sudakov:
Paths and Stability Number in Digraphs. Electron. J. Comb. 16(1) (2009) - [j17]Jacob Fox, Benny Sudakov:
Two remarks on the Burr-Erdos conjecture. Eur. J. Comb. 30(7): 1630-1645 (2009) - [j16]Jacob Fox, János Pach:
A bipartite analogue of Dilworth's theorem for multiple partial orders. Eur. J. Comb. 30(8): 1846-1853 (2009) - [j15]Jacob Fox, Po-Shen Loh, Benny Sudakov:
Large induced trees in Kr-free graphs. J. Comb. Theory B 99(2): 494-501 (2009) - [j14]David Conlon, Jacob Fox, Benny Sudakov:
Ramsey numbers of sparse hypergraphs. Random Struct. Algorithms 35(1): 1-14 (2009) - [c5]Eyal Ackerman, Jacob Fox, János Pach, Andrew Suk:
On grids in topological graphs. SCG 2009: 403-412 - [c4]Jacob Fox, János Pach:
A Separator Theorem for String Graphs and Its Applications. WALCOM 2009: 1-14 - 2008
- [j13]Jacob Fox, Mohammad Mahdian, Rados Radoicic:
Rainbow solutions to the Sidon equation. Discret. Math. 308(20): 4773-4778 (2008) - [j12]Jacob Fox, Csaba D. Tóth:
On the decay of crossing numbers. J. Comb. Theory B 98(1): 33-42 (2008) - [j11]Jacob Fox, Benny Sudakov:
On a problem of Duke-Erdös-Rödl on cycle-connected subgraphs. J. Comb. Theory B 98(5): 1056-1062 (2008) - [j10]Jacob Fox, Benny Sudakov:
Unavoidable patterns. J. Comb. Theory A 115(8): 1561-1569 (2008) - [j9]Jacob Fox:
There exist graphs with super-exponential Ramsey multiplicity constant. J. Graph Theory 57(2): 89-98 (2008) - [j8]Jacob Fox, Benny Sudakov:
Ramsey-Type Problem for an Almost Monochromatic K4. SIAM J. Discret. Math. 23(1): 155-162 (2008) - [c3]Jacob Fox, János Pach:
Coloring kk-free intersection graphs of geometric objects in the plane. SCG 2008: 346-354 - 2007
- [j7]Jacob Fox, Veselin Jungic, Rados Radoicic:
Sub-Ramsey Numbers for Arithmetic Progressions and Schur Triples. Electron. Notes Discret. Math. 28: 191-198 (2007) - [j6]Jacob Fox, Benny Sudakov:
Induced Ramsey-type theorems. Electron. Notes Discret. Math. 29: 53-58 (2007) - [j5]Jacob Fox:
An infinite color analogue of Rado's theorem. J. Comb. Theory A 114(8): 1456-1469 (2007) - [j4]Jacob Fox, Kathy Lin:
The minimum degree of Ramsey-minimal graphs. J. Graph Theory 54(2): 167-177 (2007) - [c2]Jacob Fox, János Pach, Csaba D. Tóth:
A Bipartite Strengthening of the Crossing Lemma. GD 2007: 13-24 - 2006
- [j3]Jacob Fox, Daniel J. Kleitman:
On Rado's Boundedness Conjecture. J. Comb. Theory A 113(1): 84-100 (2006) - [j2]Jacob Fox:
A Bipartite Analogue of Dilworth's Theorem. Order 23(2-3): 197-209 (2006) - [c1]Jacob Fox, Csaba D. Tóth:
On the Decay of Crossing Numbers. GD 2006: 174-183 - 2003
- [j1]Veselin Jungic, Jacob Licht, Mohammad Mahdian, Jaroslav Nesetril, Rados Radoicic:
Rainbow Arithmetic Progressions and Anti-Ramsey Results. Comb. Probab. Comput. 12(5-6): 599-620 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 21:40 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
