☰

Zoltan Furedi - Publications

Affiliations: 
University of Illinois, Urbana-Champaign, Urbana-Champaign, IL 
Area:
Mathematics
Tree Info Similar researchers PubMed Report error

162 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2021 Füredi Z, Jiang T, Kostochka A, Mubayi D, Verstraëte J. Partitioning ordered hypergraphs Journal of Combinatorial Theory, Series A. 177: 105300. DOI: 10.1016/J.Jcta.2020.105300  0.455
2020 Füredi Z, Gyárfás A. An Extension of Mantel’s Theorem to k-Graphs American Mathematical Monthly. 127: 263-268. DOI: 10.1080/00029890.2020.1693227  0.516
2020 Füredi Z, Jiang T, Kostochka AV, Mubayi D, Verstraëte J. Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2 Discrete Applied Mathematics. 276: 50-59. DOI: 10.1016/J.Dam.2019.09.010  0.329
2020 Furedi Z, Ruzsa IZ. Nearly subadditive sequences Acta Mathematica Hungarica. 161: 401-411. DOI: 10.1007/S10474-020-01071-0  0.427
2020 Füredi Z, Kostochka AV, Mubayi D, Verstraëte J. Ordered and convex geometric trees with linear extremal function Discrete and Computational Geometry. 64: 324-338. DOI: 10.1007/S00454-019-00149-Z  0.486
2019 Füredi Z, Jiang T, Kostochka AV, Mubayi D, Verstraëte J. Hypergraphs Not Containing a Tight Tree with a Bounded Trunk Siam Journal On Discrete Mathematics. 33: 862-873. DOI: 10.1137/17M1160926  0.346
2019 Füredi Z, Kostochka AV, Luo R. Avoiding long Berge cycles Journal of Combinatorial Theory, Series B. 137: 55-64. DOI: 10.1016/J.Jctb.2018.12.001  0.439
2019 Füredi Z, Kostochka AV, Luo R. A variation of a theorem by Pósa Discrete Mathematics. 342: 1919-1923. DOI: 10.1016/J.Disc.2019.03.008  0.393
2019 Ferrara M, Füredi Z, Jahanbekam S, Wenger PS. List-distinguishing Cartesian products of cliques Discrete Mathematics. 342: 2012-2022. DOI: 10.1016/J.Disc.2019.03.001  0.44
2018 Füredi Z, Kantor I. Kneser Ranks of Random Graphs and Minimum Difference Representations Siam Journal On Discrete Mathematics. 32: 1016-1028. DOI: 10.1137/17M1114703  0.409
2018 Füredi Z, Kostochka AV, Luo R, Verstraëte J. Stability in the Erdős–Gallai Theorem on cycles and paths, II Discrete Mathematics. 341: 1253-1263. DOI: 10.1016/J.Disc.2017.12.018  0.516
2018 Füredi Z, Kostochka AV, Luo R. Extensions of a theorem of Erdős on nonhamiltonian graphs Journal of Graph Theory. 89: 176-193. DOI: 10.1002/Jgt.22246  0.369
2017 Füredi Z, Maleki Z. The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs Combinatorics, Probability & Computing. 26: 525-535. DOI: 10.1017/S0963548316000407  0.414
2017 Füredi Z, Kantor I. Kneser ranks of random graphs and minimum difference representations Electronic Notes in Discrete Mathematics. 61: 499-503. DOI: 10.1016/J.Endm.2017.06.079  0.524
2017 Füredi Z, Kostochka AV, Luo R. A stability version for a theorem of Erdős on nonhamiltonian graphs Discrete Mathematics. 340: 2688-2690. DOI: 10.1016/J.Disc.2016.08.030  0.423
2017 Füredi Z, Özkahya L. On 3-uniform hypergraphs without a cycle of a given length Discrete Applied Mathematics. 216: 582-588. DOI: 10.1016/J.Dam.2016.10.013  0.802
2016 Füredi Z, Kantor I. List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs Journal of Graph Theory. 82: 218-227. DOI: 10.1002/Jgt.21896  0.404
2015 Füredi Z, Gunderson DS. Extremal Numbers for Odd Cycles Combinatorics, Probability & Computing. 24: 641-645. DOI: 10.1017/S0963548314000601  0.508
2015 Füredi Z. A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity Journal of Combinatorial Theory, Series B. 115: 66-71. DOI: 10.1016/J.Jctb.2015.05.001  0.457
2015 Füredi Z, Gerbner D, Vizer M. A discrete isodiametric result European Journal of Combinatorics. 48: 224-233. DOI: 10.1016/J.Ejc.2015.02.023  0.435
2014 Füredi Z, Jiang T. Hypergraph Turán numbers of linear cycles Journal of Combinatorial Theory, Series A. 123: 252-270. DOI: 10.1016/J.Jcta.2013.12.009  0.501
2014 Füredi Z. Linear trees in uniform hypergraphs European Journal of Combinatorics. 35: 264-272. DOI: 10.1016/J.Ejc.2013.06.022  0.438
2014 Füredi Z, Jiang T, Seiver R. Exact solution of the hypergraph Turán problem for k-uniform linear paths Combinatorica. 34: 299-322. DOI: 10.1007/S00493-014-2838-4  0.518
2014 Füredi Z, Kostochka A, Kumbhat M. Choosability with separation of complete multipartite graphs and hypergraphs Journal of Graph Theory. 76: 129-137. DOI: 10.1002/Jgt.21754  0.747
2013 Füredi Z, Kim Y. The structure of the typical graphs of given diameter Discrete Mathematics. 313: 155-163. DOI: 10.1016/J.Disc.2012.09.021  0.411
2013 Füredi Z, Ruszinkó M. Uniform hypergraphs containing no grids Advances in Mathematics. 240: 302-324. DOI: 10.1016/J.Aim.2013.03.009  0.304
2013 Biró C, Füredi Z, Jahanbekam S. Large Chromatic Number and Ramsey Graphs Graphs and Combinatorics. 29: 1183-1191. DOI: 10.1007/S00373-012-1179-6  0.474
2013 Füredi Z, Kim Y. Cycle-saturated graphs with minimum number of edges Journal of Graph Theory. 73: 203-215. DOI: 10.1002/Jgt.21668  0.524
2012 Füredi Z, Sali A. Optimal Multivalued Shattering Siam Journal On Discrete Mathematics. 26: 737-744. DOI: 10.1137/110850104  0.45
2012 Barát J, Füredi Z, Kantor I, Kim Y, Patkós B. Large $B_d$-Free and Union-free Subfamilies Siam Journal On Discrete Mathematics. 26: 71-76. DOI: 10.1137/110823109  0.317
2012 Füredi Z. 2-cancellative hypergraphs and codes Combinatorics, Probability & Computing. 21: 159-177. DOI: 10.1017/S0963548311000563  0.454
2012 Frankl P, Füredi Z. A new short proof of the EKR theorem Journal of Combinatorial Theory, Series A. 119: 1388-1390. DOI: 10.1016/J.Jcta.2012.03.012  0.407
2012 Barát J, Füredi Z, Kantor I, Kim Y, Patkós B. Large bd-free and union-free subfamilies Siam Journal On Discrete Mathematics. 26: 71-76. DOI: 10.1016/J.Endm.2011.09.017  0.348
2012 Füredi Z, Sali A. Some new bounds on partition critical hypergraphs European Journal of Combinatorics. 33: 844-852. DOI: 10.1016/J.Ejc.2011.09.023  0.396
2011 Füredi Z, Riet AE, Tyomkyn M. Completing partial packings of bipartite graphs Journal of Combinatorial Theory. Series A. 118: 2463-2473. DOI: 10.1016/J.Jcta.2011.06.009  0.455
2011 Füredi Z, Özkahya L. Unavoidable subhypergraphs: a-clusters Journal of Combinatorial Theory, Series A. 118: 2246-2256. DOI: 10.1016/J.Jcta.2011.05.002  0.793
2011 Füredi Z, Özkahya L. On even-cycle-free subgraphs of the hypercube Journal of Combinatorial Theory, Series A. 118: 1816-1819. DOI: 10.1016/J.Jcta.2011.02.009  0.799
2011 Füredi Z, Kim Y. Minimum Ck-saturated graphs Electronic Notes in Discrete Mathematics. 38: 505-510. DOI: 10.1016/J.Endm.2011.09.082  0.529
2011 Füredi Z, Kantor I, Monti A, Sinaimeri B. Reverse-free codes and permutations Electronic Notes in Discrete Mathematics. 38: 383-387. DOI: 10.1016/J.Endm.2011.09.062  0.513
2011 Füredi Z. Linear paths and trees in uniform hypergraphs Electronic Notes in Discrete Mathematics. 38: 377-382. DOI: 10.1016/J.Endm.2011.09.061  0.509
2010 Füredi Z, Kantor I, Monti A, Sinaimeri B. On reverse-free codes and permutations Siam Journal On Discrete Mathematics. 24: 964-978. DOI: 10.1137/090774835  0.52
2010 Füredi Z, Lehel J. Tight embeddings of partial quadrilateral packings Journal of Combinatorial Theory, Series A. 117: 466-474. DOI: 10.1016/J.Jcta.2009.06.003  0.473
2009 FÜredi Z, Özkahya L. On 14-cycle-free subgraphs of the hypercube Combinatorics, Probability & Computing. 18: 725-729. DOI: 10.1017/S0963548309009985  0.749
2009 Füredi Z, Sali A. Partition Critical Hypergraphs Electronic Notes in Discrete Mathematics. 34: 573-577. DOI: 10.1016/J.Endm.2009.07.095  0.459
2009 Füredi Z, Özkahya L. On even-cycle-free subgraphs of the hypercube Electronic Notes in Discrete Mathematics. 34: 515-517. DOI: 10.1016/J.Endm.2009.07.085  0.804
2009 Füredi Z, Özkahya L. Unavoidable subhypergraphs: a-clusters Electronic Notes in Discrete Mathematics. 34: 63-67. DOI: 10.1016/J.Endm.2009.07.011  0.781
2008 Füredi Z, Mubayi D, Pikhurko O. Quadruple systems with independent neighborhoods Journal of Combinatorial Theory. Series A. 115: 1552-1560. DOI: 10.1016/J.Jcta.2008.01.008  0.508
2008 Füredi Z, Kang JH. Covering the n-space by convex bodies and its chromatic number Discrete Mathematics. 308: 4495-4500. DOI: 10.1016/J.Disc.2007.08.048  0.612
2008 Füredi Z, Ruszinkó M. Large convex cones in hypercubes Discrete Applied Mathematics. 156: 1536-1541. DOI: 10.1016/J.Dam.2006.11.018  0.42
2007 Eaton N, Füredi Z, Kostochka AV, Skokan J. Tree representations of graphs European Journal of Combinatorics. 28: 1087-1098. DOI: 10.1016/J.Ejc.2006.04.002  0.397
2007 Furedi Z. Covering a Triangle with Positive and Negative Homothetic Copies Discrete and Computational Geometry. 38: 273-288. DOI: 10.1007/S00454-007-1338-3  0.362
2006 Füredi Z, Katona GOH. 2-Bases of Quadruples Combinatorics, Probability & Computing. 15: 131-141. DOI: 10.1017/S0963548305007248  0.445
2006 Füredi Z, Pikhurko O, Simonovits M. 4-books of three pages Journal of Combinatorial Theory, Series A. 113: 882-891. DOI: 10.1016/J.Jcta.2005.03.012  0.387
2006 Füredi Z, Sloan RH, Takata K, Turán G. On set systems with a threshold property Discrete Mathematics. 306: 3097-3111. DOI: 10.1016/J.Disc.2006.06.001  0.501
2006 Füredi Z, Naor A, Verstraëte J. On the Turán number for the hexagon Advances in Mathematics. 203: 476-496. DOI: 10.1016/J.Aim.2005.04.011  0.531
2005 Erdos PL, Füredi Z, Katona GOH. Two-part and k-Sperner families: New proofs using permutations Siam Journal On Discrete Mathematics. 19: 489-500. DOI: 10.1137/S0895480104443588  0.394
2005 Füredi Z, Pikhurko O, Simonovits M. On Triple Systems with Independent Neighbourhoods Combinatorics, Probability & Computing. 14: 795-813. DOI: 10.1017/S0963548305006905  0.47
2005 Füredi Z, Simonovits M. Triple Systems Not Containing a Fano Configuration Combinatorics, Probability & Computing. 14: 467-484. DOI: 10.1017/S0963548305006784  0.435
2005 Füredi Z, Gyárfás A, Simonyi G. Connected matchings and Hadwiger's conjecture Combinatorics, Probability & Computing. 14: 435-438. DOI: 10.1017/S0963548305006759  0.321
2005 Füredi Z, Ruszinkó M. Large Convex Cones in Hypercubes Electronic Notes in Discrete Mathematics. 21: 283-284. DOI: 10.1016/J.Endm.2005.07.045  0.429
2005 Füredi Z, Kostochka AV, Škrekovski R, Stiebitz M, West DB. Nordhaus–Gaddum-type Theorems for decompositions into many parts Journal of Graph Theory. 50: 273-292. DOI: 10.1002/Jgt.V50:4  0.494
2004 Füredi Z, Kang J. Distance graph on Z n with l 1 norm Theoretical Computer Science. 319: 357-366. DOI: 10.1016/J.Tcs.2004.02.010  0.66
2004 Füredi Z, Kurshan RP. Minimal length test vectors for multiple-fault detection Theoretical Computer Science. 315: 191-208. DOI: 10.1016/J.Tcs.2003.11.018  0.349
2004 Füredi Z, Katona Z. Multiply intersecting families of sets Journal of Combinatorial Theory, Series A. 106: 315-326. DOI: 10.1016/J.Jcta.2004.03.003  0.424
2004 Füredi Z, Sudakov B. Extremal set systems with restricted k-wise intersections Journal of Combinatorial Theory. Series A. 105: 143-159. DOI: 10.1016/J.Jcta.2003.10.008  0.466
2003 Füredi Z, Pikhurko O, Simonovits M. The Turan Density of the Hypergraph {abc, ade, bde, cde} Electronic Journal of Combinatorics. 10: 18. DOI: 10.37236/1711  0.456
2003 Axenovich M, Füredi Z. Exact bounds on the sizes of covering codes Designs, Codes, and Cryptography. 30: 21-38. DOI: 10.1023/A:1024703225079  0.33
2002 Furedi Z, Gyarfas A, Ruszinko M. On the maximum size of (P,Q)-free families Discrete Mathematics. 257: 385-403. DOI: 10.1016/S0012-365X(02)00437-5  0.415
2002 Chen Y, Füredi Z. Hamiltonian Kneser Graphs Combinatorica. 22: 147-149. DOI: 10.1007/S004930200007  0.517
2002 Füredi Z, Ramamurthi R. On splittable colorings of graphs and hypergraphs Journal of Graph Theory. 40: 226-237. DOI: 10.1002/Jgt.V40:4  0.488
2002 Füredi Z, Ramamurthi R. On splittable colorings of graphs and hypergraphs: SPLITTABLE COLORINGS Journal of Graph Theory. 40: 226-237. DOI: 10.1002/Jgt.10044  0.31
2002 Füredi Z, Kündgen A. Turán problems for integer-weighted graphs: TURÁN PROBLEMS FOR INTEGER-WEIGHTED GRAPHS Journal of Graph Theory. 40: 195-225. DOI: 10.1002/Jgt.10012  0.32
2001 Bárány I, Füredi Z. On the lattice diameter of a convex polygon Discrete Mathematics. 241: 41-50. DOI: 10.1016/S0012-365X(01)00145-5  0.301
2001 Füredi Z, Kündgen A. Covering a graph with cuts of minimum total size Discrete Mathematics. 237: 129-148. DOI: 10.1016/S0012-365X(00)00367-8  0.378
2001 Füredi Z. Maximal τ-Critical Linear Hypergraphs Graphs and Combinatorics. 17: 73-78. DOI: 10.1007/S003730170056  0.313
2001 Füredi Z, West DB. Ramsey theory and bandwidth of graphs Graphs and Combinatorics. 17: 463-471. DOI: 10.1007/Pl00013410  0.454
2001 Boros E, Caro Y, Füredi Z, Yuster R. Covering non-uniform hypergraphs Journal of Combinatorial Theory. Series B. 82: 270-284. DOI: 10.1006/Jctb.2001.2037  0.549
2001 Axenovich M, Füredi Z. Embedding of graphs in two-irregular graphs Journal of Graph Theory. 36: 75-83. DOI: 10.1002/1097-0118(200102)36:2<>1.0.Co;2-W  0.438
2000 Axenovich M, Füredi Z, Mubayi D. On generalized Ramsey theory: The bipartite case Journal of Combinatorial Theory, Series B. 79: 66-86. DOI: 10.1006/Jctb.1999.1948  0.471
2000 Caen DD, Füredi Z. The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane Journal of Combinatorial Theory, Series B. 78: 274-276. DOI: 10.1006/Jctb.1999.1938  0.417
2000 Füredi Z, Mubayi D, West DB. Multiple vertex coverings by specified induced subgraphs Journal of Graph Theory. 34: 180-190. DOI: 10.1002/1097-0118(200006)34:2<>1.0.Co;2-P  0.44
1999 Füredi Z, Mubayi D. Signed Domination in Regular Graphs and Set-Systems Journal of Combinatorial Theory. Series B. 76: 223-239. DOI: 10.1006/Jctb.1999.1905  0.378
1998 Füredi Z, Reznick BA. The maximal angular gap among rectangular grid points Periodica Mathematica Hungarica. 36: 119-137. DOI: 10.1023/A:1004677608508  0.431
1998 Füredi Z. On the double competition number Discrete Applied Mathematics. 82: 251-255. DOI: 10.1016/S0166-218X(97)00117-0  0.474
1998 Füredi Z, Horak P, Pareek CM, Zhu X. Minimal Oriented Graphs of Diameter 2 Graphs and Combinatorics. 14: 345-350. DOI: 10.1007/Pl00021182  0.489
1997 Füredi Z, Komjáth P. Nonexistence of universal graphs without some trees Combinatorica. 17: 163-171. DOI: 10.1007/Bf01200905  0.359
1997 Füredi Z, Komjáth P. On the existence of countable universal graphs Journal of Graph Theory. 25: 53-58. DOI: 10.1002/(Sici)1097-0118(199705)25:1<53::Aid-Jgt3>3.0.Co;2-H  0.353
1996 Füredi Z. An Upper Bound on Zarankiewicz' Problem Combinatorics, Probability & Computing. 5: 29-33. DOI: 10.1017/S0963548300001814  0.516
1996 Füredi Z, Jockusch CG, Rubel LA. Difference sets and inverting the difference operator Combinatorica. 16: 87-106. DOI: 10.1007/Bf01300128  0.354
1996 Füredi Z. On the Number of Edges of Quadrilateral-Free Graphs Journal of Combinatorial Theory, Series B. 68: 1-6. DOI: 10.1006/Jctb.1996.0052  0.361
1996 Füredi Z, Székely GJ, Zubor Z. On the lottery problem Journal of Combinatorial Designs. 4: 5-10. DOI: 10.1002/(Sici)1520-6610(1996)4:1<5::Aid-Jcd2>3.0.Co;2-J  0.493
1995 Füredi Z. Cross-intersecting families of finite sets Journal of Combinatorial Theory, Series A. 72: 332-339. DOI: 10.1016/0097-3165(95)90072-1  0.335
1995 Furedi Z, Lazebnik F, Seress A, Ustimenko VA, Woldar AJ. Graphs of Prescribed Girth and Bi-Degree Journal of Combinatorial Theory, Series B. 64: 228-239. DOI: 10.1006/Jctb.1995.1033  0.342
1995 Erdos P, Furedi Z, Gould RJ, Gunderson DS. Extremal Graphs for Intersecting Triangles Journal of Combinatorial Theory, Series B. 64: 89-100. DOI: 10.1006/Jctb.1995.1026  0.502
1994 Füredi Z, Goemans MX, Kleitman DJ. On the Maximum Number of Triangles in Wheel-Free Graphs Combinatorics, Probability and Computing. 3: 63-75. DOI: 10.1017/S0963548300000985  0.48
1994 Füredi Z. Random Ramsey graphs for the four-cycle Discrete Mathematics. 126: 407-410. DOI: 10.1016/0012-365X(94)90287-9  0.508
1994 Füredi Z. Intersecting designs from linear programming and graphs of diameter two Discrete Mathematics. 127: 187-207. DOI: 10.1016/0012-365X(92)00478-A  0.321
1994 Füredi Z. The order dimension of two levels of the Boolean lattice Order. 11: 15-28. DOI: 10.1007/Bf01462226  0.411
1994 Füredi Z, Seress Á. Maximal triangle-free graphs with restrictions on the degrees Journal of Graph Theory. 18: 11-24. DOI: 10.1002/Jgt.3190180103  0.514
1993 Erdős P, Füredi Z, Pach J, Ruzsa IZ. The grid revisted Discrete Mathematics. 111: 189-196. DOI: 10.1016/0012-365X(93)90155-M  0.443
1993 Alon N, Füredi Z. Covering the cube by affine hyperplanes The Journal of Combinatorics. 14: 79-83. DOI: 10.1006/Eujc.1993.1011  0.454
1992 Alon N, Bárány I, Füredi Z, Kleitman DJ. Point Selections and Weak ε-Nets for Convex Hulls Combinatorics, Probability and Computing. 1: 189-200. DOI: 10.1017/S0963548300000225  0.325
1992 Füredi Z. Indecomposable regular graphs and hypergraphs Discrete Mathematics. 101: 59-64. DOI: 10.1016/0012-365X(92)90590-C  0.43
1992 Alon N, Füredi Z. Spanning subgraphs of random graphs Graphs and Combinatorics. 8: 91-94. DOI: 10.1007/Bf01271712  0.366
1992 Dyer ME, Füredi Z, McDiarmid C. Volumes Spanned by Random Points in the Hypercube Random Structures and Algorithms. 3: 91-106. DOI: 10.1002/Rsa.3240030107  0.464
1992 Füredi Z, Kleitman DJ. On zero-trees Journal of Graph Theory. 16: 107-120. DOI: 10.1002/Jgt.3190160202  0.357
1992 Füredi Z. The maximum number of edges in a minimal graph of diameter 2 Journal of Graph Theory. 16: 81-98. DOI: 10.1002/Jgt.3190160110  0.466
1991 Füredi Z. Maximal independent subsets in Steiner systems and in planar sets Siam Journal On Discrete Mathematics. 4: 196-199. DOI: 10.1137/0404019  0.376
1991 Frankl P, Füredi Z. Beyond the Erdos-Ko-Rado theorem Journal of Combinatorial Theory, Series A. 56: 182-194. DOI: 10.1016/0097-3165(91)90031-B  0.415
1991 Erdős P, Füredi Z, Tuza Z. Saturated r-uniform hypergraphs Discrete Mathematics. 98: 95-104. DOI: 10.1016/0012-365X(91)90035-Z  0.318
1991 Füredi Z. The densest packing of equal circles into a parallel strip Discrete and Computational Geometry. 6: 95-106. DOI: 10.1007/Bf02574677  0.363
1991 Füredi Z. On a Turán type problem of Erdös Combinatorica. 11: 75-79. DOI: 10.1007/Bf01375476  0.473
1990 Füredi Z. The maximum number of unit distances in a convex n -gon Journal of Combinatorial Theory, Series A. 55: 316-320. DOI: 10.1016/0097-3165(90)90074-7  0.408
1990 Füredi Z, Griggs JR, Holzman R, Kleitman DJ. Representations of families of triples over GF(2) Journal of Combinatorial Theory, Series A. 53: 306-315. DOI: 10.1016/0097-3165(90)90062-2  0.383
1990 Füredi Z, Kahn J, Kleitman DJ. Sphere coverings of the hypercube with incomparable centers Discrete Mathematics. 83: 129-134. DOI: 10.1016/0012-365X(90)90229-B  0.308
1990 Bárány I, Füredi Z, Lovász L. On The Number Of Halving Planes Combinatorica. 10: 175-183. DOI: 10.1007/Bf02123008  0.453
1990 Füredi Z. Graphs of diameter 3 with the minimum number of edges Graphs and Combinatorics. 6: 333-337. DOI: 10.1007/Bf01787701  0.438
1990 Füredi Z. Competition graphs and clique dimensions Random Structures and Algorithms. 1: 183-189. DOI: 10.1002/Rsa.3240010205  0.48
1989 Furedi Z, Griggs JR, Kleitman DJ. Pair Labellings with Given Distance Siam Journal On Discrete Mathematics. 2: 491-499. DOI: 10.1137/0402044  0.408
1989 Alon N, Faudree R, Füredi Z. A Turanlike neighborhood condition and cliques in graphs Annals of the New York Academy of Sciences. 555: 4-8. DOI: 10.1111/J.1749-6632.1989.Tb22430.X  0.476
1989 Frankl P, Füredi Z. Extremal problems whose solutions are the blowups of the small Witt-designs Journal of Combinatorial Theory, Series A. 52: 129-147. DOI: 10.1016/0097-3165(89)90067-8  0.476
1989 Boros E, Füredi Z, Kahn J. Maximal intersecting families and affine regular polygons in PG(2, q) Journal of Combinatorial Theory, Series A. 52: 1-9. DOI: 10.1016/0097-3165(89)90057-5  0.422
1989 Füredi Z. A projective plane is an outstanding 2-cover Discrete Mathematics. 74: 321-324. DOI: 10.1016/0012-365X(89)90143-X  0.472
1989 Füredi Z. Covering the complete graph by partitions Discrete Mathematics. 75: 217-226. DOI: 10.1016/0012-365X(89)90088-5  0.398
1989 Alon N, Füredi Z. Legitimate colorings of projective planes Graphs and Combinatorics. 5: 95-106. DOI: 10.1007/Bf01788662  0.401
1988 Frankl P, Füredi Z. Solution of the Littlewood-Offord problem in high dimensions Annals of Mathematics. 128: 259-270. DOI: 10.2307/1971442  0.416
1988 Chung FRK, Füredi Z, Garey MR, Graham RL. On the fractional covering number of hypergraphs Siam Journal On Discrete Mathematics. 1: 45-49. DOI: 10.1137/0401005  0.346
1988 Boros E, Füredi Z. Rectangular Dissections of a Square European Journal of Combinatorics. 9: 271-280. DOI: 10.1016/S0195-6698(88)80018-0  0.44
1988 Chung FRK, Füredi Z, Graham RL, Seymour P. On induced subgraphs of the cube Journal of Combinatorial Theory, Series A. 49: 180-187. DOI: 10.1016/0097-3165(88)90034-9  0.479
1988 Bárány I, Füredi Z. On the shape of the convex hull of random points Probability Theory and Related Fields. 77: 231-240. DOI: 10.1007/Bf00334039  0.396
1988 Füredi Z, Kahn J. Dimension versus size Order. 5: 17-20. DOI: 10.1007/Bf00143893  0.367
1987 Bárány I, Füredi Z. Empty Simplices In Euclidean-Space Canadian Mathematical Bulletin. 30: 436-445. DOI: 10.4153/Cmb-1987-064-1  0.359
1987 Frankl P, Füredi Z. Colored packing of sets North-Holland Mathematics Studies. 149: 165-177. DOI: 10.1016/S0304-0208(08)72884-6  0.435
1987 Frankl P, Füredi Z. Exact solution of some Tura´n-type problems Journal of Combinatorial Theory, Series A. 45: 226-262. DOI: 10.1016/0097-3165(87)90016-1  0.472
1987 Füredi Z, Griggs JR, Odlyzko AM, Shearer JB. Ramsey-Sperner theory Discrete Mathematics. 63: 143-152. DOI: 10.1016/0012-365X(87)90004-5  0.509
1987 Bárány I, Füredi Z. Computing the volume is difficult Discrete and Computational Geometry. 2: 319-326. DOI: 10.1007/Bf02187886  0.392
1987 Füredi Z. The maximum number of balancing sets Graphs and Combinatorics. 3: 251-254. DOI: 10.1007/Bf01788547  0.483
1987 Alon N, Füredi Z. On the kernel of intersecting families Graphs and Combinatorics. 3: 91-94. DOI: 10.1007/Bf01788533  0.331
1987 Füredi Z. The number of maximal independent sets in connected graphs Journal of Graph Theory. 11: 463-470. DOI: 10.1002/Jgt.3190110403  0.489
1986 Frankl P, Füredi Z. Non-trivial intersecting families Journal of Combinatorial Theory, Series A. 41: 150-153. DOI: 10.1016/0097-3165(86)90121-4  0.481
1986 Erdös P, Füredi Z, Hajnal A, Komjáth P, Rödl V, Seress A. Coloring graphs with locally few colors Discrete Mathematics. 59: 21-34. DOI: 10.1016/0012-365X(86)90065-8  0.347
1986 Füredi Z, Griggs JR. Families of finite sets with minimum shadows Combinatorica. 6: 355-363. DOI: 10.1007/Bf02579261  0.373
1986 Füredi Z. Random polytopes in thed-dimensional cube Discrete and Computational Geometry. 1: 315-319. DOI: 10.1007/Bf02187704  0.316
1986 Csima J, Füredi Z. Colouring finite incidence structures Graphs and Combinatorics. 2: 339-346. DOI: 10.1007/Bf01788107  0.359
1985 Alon N, Füredi Z, Katchalski M. Separating Pairs of Points by Standard Boxes European Journal of Combinatorics. 6: 205-210. DOI: 10.1016/S0195-6698(85)80028-7  0.439
1985 Füredi Z, Tuza Z. Hypergraphs without a large star Discrete Mathematics. 55: 317-321. DOI: 10.1016/S0012-365X(85)80009-1  0.337
1985 Frankl P, Füredi Z. Forbidding just one intersection Journal of Combinatorial Theory, Series A. 39: 160-176. DOI: 10.1016/0097-3165(85)90035-4  0.439
1985 Erdös P, Frankl P, Füredi Z. Families of finite sets in which no set is covered by the union ofr others Israel Journal of Mathematics. 51: 79-89. DOI: 10.1007/Bf02772959  0.453
1985 Füredi Z. Set systems with three intersections Combinatorica. 5: 27-31. DOI: 10.1007/Bf02579439  0.359
1984 Frankl P, Füredi Z. On hypergraphs without two edges intersecting in a given number of vertices Journal of Combinatorial Theory, Series A. 36: 230-236. DOI: 10.1016/0097-3165(84)90008-6  0.428
1984 Frankl P, Füredi Z. An exact result for 3-graphs Discrete Mathematics. 50: 323-328. DOI: 10.1016/0012-365X(84)90058-X  0.328
1984 Füredi Z. Hypergraphs in which all disjoint pairs have distinct unions Combinatorica. 4: 161-168. DOI: 10.1007/Bf02579216  0.324
1984 Boros E, Füredi Z. The number of triangles covering the center of an n-set Geometriae Dedicata. 17: 69-77. DOI: 10.1007/Bf00181519  0.415
1983 Frankl P, Füredi Z. DISJOINT r-TUPLES IN AN r-GRAPH WITH GIVEN MAXIMUM DEGREE Quarterly Journal of Mathematics. 34: 423-426. DOI: 10.1093/Qmath/34.4.423  0.311
1983 Füredi Z. Graphs without quadrilaterals Journal of Combinatorial Theory, Series B. 34: 187-190. DOI: 10.1016/0095-8956(83)90018-7  0.46
1983 Frankl P, Füredi Z. A new generalization of the Erdős-Ko-Rado theorem Combinatorica. 3: 341-349. DOI: 10.1007/Bf02579190  0.512
1982 Füredi Z. An intersection problem whose extremum is the finite projective space Journal of Combinatorial Theory, Series A. 32: 66-72. DOI: 10.1016/0097-3165(82)90065-6  0.47
1982 Erdös P, Frankl P, Füredi Z. Families of finite sets in which no set is covered by the union of two others Journal of Combinatorial Theory, Series A. 33: 158-166. DOI: 10.1016/0097-3165(82)90004-8  0.498
1982 Füredi Z. Set-systems with prescribed cardinalities for pairwise intersections Discrete Mathematics. 40: 53-67. DOI: 10.1016/0012-365X(82)90188-1  0.383
1981 Füredi Z. Maximum degree and fractional matchings in uniform hypergraphs Combinatorica. 1: 155-162. DOI: 10.1007/Bf02579271  0.336
1980 Erdös PL, Füredi Z. On Automorphisms of Line-graphs European Journal of Combinatorics. 1: 341-345. DOI: 10.1016/S0195-6698(80)80035-7  0.379
1980 Füredi Z. On maximal intersecting families of finite sets Journal of Combinatorial Theory, Series A. 28: 282-289. DOI: 10.1016/0097-3165(80)90071-0  0.316
Show low-probability matches.