Zoltan Furedi's downloadable research papers

Version of Jan 28, 2009.
129 out of about 210 manuscripts

Contents

Combinatorial Geometry on the plane (17) and in higher dimension (18)

Turan problems in graphs (12) and in hypergraphs (16)

Intersecting hypergraphs (8)

Packing and covering in (hyper)graphs, (applications of) (quasi)designs, and finite geometries (17)

More Extremal Hypergraphs (17)

Graph representations (7)

Szemeredi's regularity lemma (2)

More extremal graph theory (20)

Posets (4)

Codes (8)

None of the above, more Combinatorics (3)

Papers with Paul Erdös (9) (out of the total 10)

Combinatorial Geometry on the plane Back to contents

  • 200.
    Z. Furedi:
    Covering a triangle with positive and negative homothetic copies,
    Discrete and Comput. Geom. 38 (2007), 273-288.
    | pdf | | ps |

  • 184.
    Füredi Zoltán:
    A Feuerbach kör érinti az érintö köröket, KöMaL 54 (2004) május
    http://www.komal.hu/cikkek/2004-05/furedi/furedi.h.shtml
    In Hungarian | pdf | | ps |
    The 9-point circle touches the incircle and the escribed circles.
    In English | pdf | | ps |

  • 177.
    Z. Furedi:
    Covering a triangle with homothetic copies,
    Discrete Geometry (edited by A. Bezdek) Dekker, New York-Basel, 2003. pp. 435-445.
    | pdf | | ps |

  • 172.
    I. Barany and Z. Furedi:
    On the lattice diameter of a convex polygon,
    Discrete Mathematics 241 (2001), 41-50.
    | pdf | | ps | (no figures, sorry)

  • 157.
    Z. Furedi and B. Reznick:
    The maximum angular gap among rectangular grid points,
    Period. Math. Hungar. 36 (1998), 119-137.
    | pdf | | ps |

  • 117.
    P. Erdös, P. Fishburn, and Z. Furedi:
    Midpoints of diagonals of convex n-gons,
    SIAM Journal on Discrete Mathematics 4 (1991), 329-341.
    | 2.8 MB pdf |

  • 110.
    Z. Furedi:
    Decomposition of a convex region with lines,
    Archiv der Mathematik 56 (1991), 300-312.
    | 2.7 MB pdf |

  • 101.
    Z. Furedi:
    Maximal independent subsets in Steiner systems and in planar sets,
    SIAM Journal on Discrete Mathematics 4 (1991), 196-199.
    | 1.2 MB pdf |

  • 96.
    Z. Furedi:
    The densest packing of equal circles into a parallel strip,
    Discrete and Computational Geometry 6 (1991), 95-106.
    | 2.5 MB pdf |

  • 86.
    Z. Furedi:
    The maximum number of unit distances in a convex n-gon,
    Journal of Combinatorial Theory, Ser. A 55 (1990), 316-320.
    | 1 MB pdf |

  • 71.
    E. Boros and Z. Furedi:
    Rectangular dissections of the unit square,
    European Journal of Combinatorics 9 (1988), 271-280.
    | 2.4 MB pdf |

  • 59.
    I. Barany and Z. Furedi:
    Covering all secants of a square,
    in Intuitive Geometry, (G. Fejes Toth ed.),
    Proc. Colloq. Math. Soc. Janos Bolyai 48 (Siofok, Hungary, 1985), pp. 19-27. North-Holland, Amsterdam, 1987.
    | 1.4 MB pdf |

  • 43.
    N. Alon, Z. Furedi, and M. Katchalski:
    Separating pairs of points by standard boxes,
    European Journal of Combinatorics 6 (1985), 205-210.
    | 1.7 MB pdf |

  • 34.
    Z. Furedi and Palasti:
    Arrangements of lines with a large number of triangles,
    Proc. Amer. Math. Soc. 92 (1984), 561-566.
    | 1.3 MB pdf |

  • 33.
    E. Boros and Z. Furedi:
    The number of triangles covering the center of an n-set,
    Geometriae Dedicata 17 (1984), 69-77.
    | 1.8 MB pdf |

  • 31.
    I. Barany, Z. Furedi, and J. Pach:
    Discrete convex functions and proof of the six circle conjecture of Fejes Toth,
    Canadian Journal of Mathematics 36 (1984), 569-576.
    | 1.3 MB pdf |

  • 13.
    Z. Furedi:
    The number of well-oriented regions,
    Geometriae Dedicata 12 (1982), 397-400.
    same in: Diskrete Geometrie, 2. Kolloq., Inst. Math. Univ. Salzburg 1980, pp. 50-57. (1980).
    | 0.7 MB pdf |

    • Combinatorial Geometry in higher dimension Back to contents

  • 202.
    Z. Furedi and Jeong-Hyun Kang:
    Covering the $n$-space by convex bodies and its chromatic number
    | pdf (no figures here) | | ps | (As of 4/25/2004)

  • 201.
    Z. Furedi and M. Ruszinko:
    Large convex cones in hypercubes,
    in: General Theory of Information Transfer and Combinatorics,
    Discrete Applied Mathematics 156 (2008), 1536-1541.
    | pdf | | ps |

  • 182.
    Z. Furedi and Jeong-Hyun Kang:
    Distance graph on Z^n with l_1 norm,
    Theoretical Computer Science 319 (2004), 357-366.
    (Special issue on combinatorics of the discrete plane and tilings.)
    | pdf | | ps |

  • 161.
    Z. Furedi and M. Ruszinko:
    An improved upper bound of the rate of Eucledian superimposed codes,
    IEEE Trans. Inform. Theory 45 (1999), 799-802.
    | pdf | | ps |

  • 150.
    Z. Furedi:
    Scrambling permutations and entropy of hypergraphs,
    Random Structures and Algorithms 8 (1996), 97-104.
    | pdf | | ps |

  • 147.
    Z. Furedi:
    Extremal hypergraphs and combinatorial geometry,
    Proceedings of the International Congress of Mathematicians,
    Zurich, Switzerland 1994.     pp. 1343-1352. Birkhauser, Basel, 1995.
    | pdf | | ps |

  • 146.
    Z. Furedi:
    The expected size of a random sphere-of-influence graph,
    Intuitive Geometry, edited by I. Barany et al., (Proc. Colloq., Budapest, Hungary, 1995),
    Bolyai Society Mathematical Studies, 6 (1997), pp. 319-326. Budapest, Hungary.
    | pdf | | ps |

  • 134.
    N. Alon and Z. Furedi:
    Covering the cube by affine hyperplanes,
    European Journal of Combinatorics 14 (1993), 79-83.
    | 1.5 MB pdf |

  • 131.
    Noga Alon, I. Barany, Z. Furedi, and D. J. Kleitman:
    Point selections and weak $epsilon$-nets for convex hulls,
    Combinatorics, Probability and Computing 1 (1992), 189-200.
    | pdf |

  • 130.
    Z. Furedi and R. Stanley:
    Sets of vectors with many orthogonal pairs (A research problem),
    Graphs and Combinatorics 8 (1992), 391-394.
    | 1 MB pdf |

  • 128.
    Z. Furedi and J. Lagarias and F. Morgan:
    Singularities of minimal surfaces and networks and related extremal problems in Minkowski space,
    DIMACS Series in Discrete Mathematics and Theoretical Computer Science 6 (1991), 95-109.
    | 3.7 MB pdf |

  • 119.
    M. E. Dyer, Z. Furedi, and C. McDiarmid:
    Random volumes in the $n$-cube,
    in Polyhedral Combinatorics (Proceedings of the DIMACS Workshop held in Morristown, NJ, June 1989), P. D. Seymour and W. Cook, Eds.,
    DIMACS Series in Discrete Mathematics and Theoretical Computer Science 1 (1990), 33-38.
    | 2.1 MB pdf |

  • 94.
    Z. Furedi:
    The second and the third smallest distances on the sphere,
    Journal of Geometry 46 (1993), 55-65.
    | 2.5 MB pdf |

  • 90b.
    I. Barany, Z. Furedi, and L. Lovasz:
    On the number of halving planes,
    Combinatorica 10 (1990), 175-183.
    (same in Proc. 5th ACM Symp. on Computational Geometry, Saarbrüucken, West-Germany, June 1989. pp. 140-144.)
    | pdf |

  • 66.
    I. Barany and Z. Furedi:
    Empty simplices in the Euclidean space,
    Canad. Math. Bull. 30 (1987), 436-445.
    | 2.1 MB pdf |

  • 49.
    I. Barany and Z. Furedi:
    Computing the volume is difficult,
    Discrete and Computational Geometry 2 (1987), 319-326.
    | 2.5 MB pdf |

  • 26.
    Z. Furedi:
    Geometrical solution of an intersection problem for two hypergraphs,
    European Journal of Combinatorics 5 (1984), 133-136.
    | 1 MB pdf |

  • 17.
    P. Erdös and Z. Furedi:
    The greatest angle among n points in the d-dimensional Euclidean space,
    in: Combinatorial Mathematics (Proc. Colloq., Marseilles-Luminy, 1981. C. Berge et al. Eds.) North-Holland, Amsterdam, 1983.
    North-Holland Math. Studies 75. Annals of Discrete Mathematics 17 (1983), 275-283.
    | 2.1 MB pdf |

    • Turan problems in graphs Back to contents

  • 210.
    Z. Furedi and L. Özkahya:
    On 14-cycle-free subgraphs of the hypercube,
    Combinatorics, Probability and Computing, submitted
    | pdf |

  • 195.
    Z. Furedi, A. Naor, and J. Verstraete:
    On the Turan number for the hexagon,
    Advances in Math. 203 (2006), 476-496.
    | pdf |

  • 174.
    Z. Furedi and A. Kundgen:
    Turan problems for weighted graphs,
    Journal of Graph Theory 40 (2002), 195-225.
    | pdf | | ps |

  • 171.
    Z. Furedi, and D. West:
    Ramsey theory and bandwidth of graphs,
    Graphs and Combinatorics 17 (2001), 463-471.
    | pdf | | ps |

  • 152.
    Z. Furedi, G. J. Szekely, and Z. Zubor:
    On the lottery problem,
    J. Combinatorial Designs 4 (1996), 5-10.
    | pdf | | ps |

  • 149.
    Z. Furedi:
    An upper bound on Zarankiewicz' problem,
    Combinatorics, Probability and Computing 5 (1996), 29-33.
    | pdf | | ps |

  • 148.
    Z. Furedi:
    On the number of edges of quadrilateral-free graphs,
    Journal of Combinatorial Theory, Ser.B 68 (1996), 1-6.
    | pdf | | ps |
    Here is a longer version (10 pages):
    Quadrilateral-free graphs with maximum number of edges,
    Proceedings of the Japan Workshop on Graph Th. and Combinatorics, University, Yokohama, Japan 1994, pp. 13-22.
    | pdf | | ps |
    Here is a more complete earlier version from 1988 (21 pages, unpublished):
    Quadrilateral-free graphs with maximum number of edges,
    | pdf | | ps |
    Another early (published version) is below.

  • 145.
    Z. Furedi, F. Lazebnik, A. Seress, Ustimenko, and A. Woldar:
    Graphs of prescribed girth and bi-degree,
    Journal of Combinatorial Theory, Ser. B 64 (1995), 228-239.
    | pdf | | ps |

  • 142.
    Z. Furedi:
    New asymptotics for bipartite Turan numbers,
    Journal of Combinatorial Theory, Ser.A 75 (1996), 141-144.
    | pdf | | ps |
    Here is a slightly longer version (for students):
    | pdf | | ps |

  • 140.
    P. Erdös, Z. Furedi, R. J. Gould, and D. S. Gunderson:
    Extremal graphs for intersecting triangles,
    Journal of Combinatorial Theory, Ser. B 64 (1995), 89-100.
    | ps |

  • 102.
    Z. Furedi:
    On a Turan type problem of Erdös,
    Combinatorica 11 (1991), 75-79.
    | 1.1 MB pdf |

  • 16.
    Z. Furedi:
    Graphs without quadrilaterals,
    Journal of Combinatorial Theory, Ser. B 34 (1983), 187-190.
    | 0.9 MB pdf |
    This is here only for historical reasons. See the more complete version # 148 above.

    • Turan problems in hypergraphs Back to contents

  • 206.
    Z. Furedi, D. Mubayi, and O. Pikhurko:
    Quadruple systems with independent neighborhoods,
    Journal of Combinatorial Theory (2008)
    | pdf | | ps |

  • 194.
    Z. Furedi, O. Pikhurko, and M. Simonovits:
    4-books of three pages,
    Journal of Combinatorial Theory, Ser. A 113 (2006), 882-891.
    | pdf | | ps |

  • 187.
    Z. Furedi, A. Pikhurko, and M. Simonovits:
    On triple systems with independent neighborhoods,
    Combinatorics, Computing and Probabality 14 (2005), 795-813.
    | ps |

  • 186.
    Z. Furedi and M. Simonovits:
    Triple systems not containing a Fano configuration,
    Combinatorics, Computing and Probabality 14 (2005), 467-484.
    | pdf | | ps |

  • 178.
    Z. Furedi, A. Pikhurko, and M. Simonovits:
    The Turan density of the hypergraph { abc, ade, bde, cde},
    Electronic Journal of Combinatorics 10 (2003), R18, pp. 7.
    | pdf | | ps |

  • 163.
    Dominique de Caen and Z. Furedi:
    The maximum size of 3-uniform hypergraphs not containing a Fano plane,
    Journal of Combinatorial Theory, Ser. B 78 (2000), 274-276.
    | pdf | | ps |

  • 147.
    Z. Furedi:
    Extremal hypergraphs and combinatorial geometry,
    Proceedings of the International Congress of Mathematicians,
    Zurich, Switzerland 1994.     pp. 1343-1352. Birkhauser, Basel, 1995.
    | pdf | | ps |

  • 125.
    Z. Furedi:
    Turan type problems,
    Surveys in Combinatorics. 1991, (Proc. of the 13th British Combinatorial Conference), ed. A. D. Keedwell, Cambridge Univ. Press.
    London Math. Soc. Lecture Note Series 166 (1991), 253-300.
    | pdf | | ps |
    (A 48 page summary of the hypergraph results up to 1991)

  • 114.
    P. Erdös, Z. Furedi, and Z. Tuza:
    Saturated r-uniform hypergraphs,
    Discrete Mathematics 98 (1991), 95-104.
    | 3 MB pdf |

  • 76.
    P. Frankl and Z. Furedi:
    Extremal problems whose solutions are the blow-ups of the small Witt-designs,
    Journal of Combinatorial Theory, Ser. A 52 (1989), 129-147.
    | 3.8 MB pdf |

  • 42.
    P. Erdös, P. Frankl, and Z. Furedi:
    Families of finite sets in which no set is covered by the union of r others,
    Israel Journal of Mathematics 51 (1985), 79-89.
    | 2.8 MB pdf |

  • 30.
    Z. Furedi:
    Hypergraphs in which all disjoint pairs have distinct unions,
    Combinatorica 4 (1984), 161-168.
    | 3 MB pdf |

  • 28.
    P. Frankl and Z. Furedi:
    An exact result for 3-graphs,
    Discrete Mathematics 50 (1984), 323-328.
    | 1.4 MB pdf |

  • 27.
    P. Frankl and Z. Furedi:
    Union-free hypergraphs and probability theory,
    European Journal of Combinatorics 5 (1984), 127-131.
    Erratum, ibid 5 (1984), p. 395.
    | 1.4 MB pdf |

  • 20.
    Z. Furedi and P. Frankl:
    A new generalization of the Erdös-Ko-Rado theorem,
    Combinatorica 3 (1983), 341-349.
    | 2.6 MB pdf |

  • 14.
    P. Erdös, P. Frankl, and Z. Furedi:
    Families of finite sets in which no set is covered by the union of two others,
    Journal of Combinatorial Theory, Ser. A 33 (1982), 158-166.
    | 1.7 MB pdf |

    • Intersecting hypergraphs Back to contents

  • 196.
    Z. Furedi, K.-W. Hwang, and P. Weichsel:
    A proof and generalizations of the Erdös-Ko-Rado theorem using the method of linearly independent polynomials,
    in: Topics in Discrete Mathematics, pp. 215-224, Algorithms Combin., 26, Springer, Berlin, 2006.
    | pdf | | ps |

  • 181.
    Z. Furedi and Zs. Katona:
    Multiply intersecting families,
    Journal of Combinatorial Theory, Ser.A 106 (2004), 315-326.
    | pdf | | ps |

  • 180.
    Z. Furedi and B. Sudakov:
    Extremal set systems with restricted k-wise intersections,
    J. Combinatorial Theory, Ser. A 105 (2004), 143-159.
    | pdf | | ps |

  • 143.
    Z. Furedi:
    Cross-intersecting families of finite sets,
    Journal of Combinatorial Theory, Ser.A 72 (1995), 332-339.
    | pdf | | ps |

  • 61.
    N. Alon and Z. Furedi:
    On the kernel of intersecting families,
    Graphs and Combinatorics 3 (1987), 91-94.
    | 1.5 MB pdf |

  • 44.
    P. Frankl and Z. Furedi:
    Nontrivial intersecting families,
    Journal of Combinatorial Theory, Ser. A 41 (1986), 150-153.
    | 0.8 MB pdf |

  • 26.
    Z. Furedi:
    Geometrical solution of an intersection problem for two hypergraphs,
    European Journal of Combinatorics 5 (1984), 133-136.
    | 1 MB pdf |

  • 2.
    Z. Furedi:
    On maximal intersecting families of finite sets,
    Journal of Combinatorial Theory, Ser. A 28 (1980), 282-289.
    | 1.7 MB pdf |

    • Packing and covering in (hyper)graphs,(applications of) (quasi)designs, and finite geometries Back to contents

  • 209.
    Z. Furedi and J. Lehel:
    Tight embeddings of partial quadrilateral packings,
    | pdf |

  • 204.
    Z. Furedi, A. Gyarfas, G. Sarkozy, and S. Selkow:
    Inequalities for the First-Fit chromatic number,
    Journal of Graph Theory
    | pdf | | ps |

  • 186.
    Z. Furedi and M. Simonovits:
    Triple systems not containing a Fano configuration,
    Combinatorics, Computing and Probabality 14 (2005), 467-484.
    | pdf | | ps |

  • 170.
    E. Boros, Y. Caro, Z. Furedi, and R. Yuster:
    Covering non-uniform hypergraphs,
    Journal of Combinatorial Theory, Ser.B 82 (2001), 270-284.
    | pdf | | ps |

  • 168.
    Z. Furedi:
    Maximal tau-critical linear hypergraphs,
    Graphs and Combinatorics 17 (2001), 73-78.
    | pdf | | ps |

  • 163.
    Dominique de Caen and Z. Furedi:
    The maximum size of 3-uniform hypergraphs not containing a Fano plane,
    Journal of Combinatorial Theory, Ser. B 78 (2000), 274-276.
    | pdf | | ps |

  • 152.
    Z. Furedi, G. J. Szekely, and Z. Zubor:
    On the lottery problem,
    J. Combinatorial Designs 4 (1996), 5-10.
    | pdf | | ps |

  • 148.
    Z. Furedi:
    On the number of edges of quadrilateral-free graphs,
    Journal of Combinatorial Theory, Ser.B 68 (1996), 1-6.
    | pdf | | ps |
    Here is a longer version (10 pages):
    Quadrilateral-free graphs with maximum number of edges,
    Proceedings of the Japan Workshop on Graph Th. and Combinatorics, University, Yokohama, Japan 1994, pp. 13-22.
    | pdf | | ps |
    Here is a more complete earlier version from 1988 (21 pages, unpublished):
    Quadrilateral-free graphs with maximum number of edges,
    | pdf | | ps |
    Another early (published version) is below.

  • 108.
    Z. Furedi and L. Spissich:
    The minimum size of a maximal partial plane,
    Ars Combinatoria 34 (1992), 143-145.
    | 0.9 MB pdf |

  • 85.
    Z. Furedi:
    A projective plane is an outstanding 2-cover,
    Discrete Mathematics 74 (1989), 321-324.
    | 0.9 MB pdf |

  • 76.
    P. Frankl and Z. Furedi:
    Extremal problems whose solutions are the blow-ups of the small Witt-designs,
    Journal of Combinatorial Theory, Ser. A 52 (1989), 129-147.
    | 3.8 MB pdf |

  • 72.
    Z. Furedi and J. Kahn:
    Dimension versus size,
    Order 5 (1988), 17-20.
    | 0.8 MB pdf |

  • 68.
    F. R. K. Chung, Z. Furedi, M. R. Garey, and R. L. Graham:
    On the fractional covering number of hypergraphs,
    SIAM Journal on Discrete Mathematics 1 (1988), 45-49.
    | pdf |

  • 64.
    P. Frankl and Z. Furedi:
    Colored packing of sets,
    in: Combinatorial Design Theory,
    Annals of Discrete Mathematics     34 (1987), 165-178.
    | 2.1 MB and rather bad quality (sorry) pdf |

  • 28.
    P. Frankl and Z. Furedi:
    An exact result for 3-graphs,
    Discrete Mathematics 50 (1984), 323-328.
    | 1.4 MB pdf |

  • 7.
    Z. Furedi:
    Maximum degree and fractional matchings in uniform hypergraphs,
    Combinatorica 1 (1981), 155-162.
    | 3.3 MB pdf |

  • 2.
    Z. Furedi:
    On maximal intersecting families of finite sets,
    Journal of Combinatorial Theory, Ser. A 28 (1980), 282-289.
    | 1.7 MB pdf |

    • More Extremal Hypergraphs Back to contents

  • 197.
    Z. Furedi, R. H. Sloane, G. Turan, and K. Takata:
    On set systems with a threshold property,
    Discrete Mathematics 306 (2006), 3097-3111.
    | pdfs |

  • 193.
    Z. Furedi and G.O.H. Katona:
    2-bases of quadruples,
    Combinatorics, Computing and Probabality 15 (2006), 131-141.
    | pdf | | ps |

  • 190.
    Peter L. Erdös, Z. Furedi, and G. O. H. Katona:
    Two-part and k-Sperner families: new proofs using permutations,
    SIAM Journal on Discrete Mathematics 19 (2005), 489-500.
    | pdf | | ps |

  • 176.
    Z. Furedi, A. Gyarfas, and M. Ruszinko:
    On the maximum size of (p,Q)-free families,
    Discrete Mathematics 257 (2002), 385-403.
    | pdf | | ps |

  • 175.
    Z. Furedi and R. Ramamurthi:
    On splittable colorings of graphs and hypergraphs,
    Journal of Graph Theory 49 (2002), 226-237.
    | pdf | | ps |

  • 173.
    Ya-Chen Chen and Z. Furedi:
    Hamiltonian Kneser graphs,
    Combinatorica 22 (2002), 147-149.
    | pdf | | ps |

  • 160.
    Z. Furedi and D. Mubayi:
    Signed domination in regular graphs and set-systems,
    Journal of Combinatorial Theory, Ser. B 76 (1999), 223-239.
    | pdf | | ps |

  • 135.
    Z. Furedi and J. Pach:
    Traces of finite sets: extremal problems and geometric applications,
    in Extremal Problems for Finite Sets, Proc. Colloq., Visegrád, Hungary, 1991. (P. Frankl et al., Eds.)
    Bolyai Society Mathematical Studies 3 (1994), pp. 251-282.
    | pdf |

  • 80.
    Z. Furedi, J. Kahn, and D. J. Kleitman:
    Sphere coverings of the hypercube with incomparable centers,
    Discrete Mathematics 83 (1990), 129-134.
    | 1.3 MB pdf |

  • 63.
    P. Frankl, Z. Furedi, and J. Pach:
    Bounding one-way differences,
    Graphs and Combinatorics 3 (1987), 341-347.
    | 1.6 MB pdf |

  • 62.
    Z. Furedi:
    The maximum number of balancing sets,
    Graphs and Combinatorics 3 (1987), 251-254.
    | 0.8 MB pdf |

  • 58.
    Z. Furedi, J. R. Griggs, A. M. Odlyzko and J. B. Shearer:
    Ramsey-Sperner theory,
    Discrete Mathematics 63 (1987), 143-152.
    | 2.9 MB pdf |

  • 45.
    S. J. Dow, D. A. Drake, Z. Furedi, and J. A. Larson:
    A lower bound for the cardinality of a maximal family of mutually intersecting sets of equal size,
    Proceedings of the 16th Southeastern international conference on combinatorics, graph theory and computing (Boca Raton, Fla., 1985)
    Congressus Numerantium 48 (1985), 47-48.
    | 0.4 MB pdf |

  • 36.
    Z. Furedi:
    A Ramsey-Sperner theorem,
    Graphs and Combinatorics 1 (1985), 51-56.
    | 1.4 MB pdf |

  • 19.
    P. Frankl and Z. Furedi:
    Disjoint $r$-tuples in an $r$-graph with given maximum degree,
    Quarterly Journal of Mathematics Oxford, Ser. (2) 34 (1983), 423-426.
    | 0.9 MB pdf |

  • 18.
    Z. Furedi:
    On finite set-systems whose every intersection is a kernel of a star,
    Discrete Mathematics 47 (1983), 129-132.
    | 1 MB pdf |

  • 6.
    P. Frankl and Z. Furedi:
    A short proof for a theorem of Harper about Hamming-spheres,
    Discrete Mathematics 34 (1981), 311-313.
    | 0.6 MB pdf |

    • Graph representations Back to contents

  • 198.
    N. Eaton, Z. Furedi, A. Kostochka, and J. Skokan:
    Tree representations of graphs,
    European Journal of Combinatorics 28 (2007), 1087-1098.
    | pdf | | ps |

  • 162.
    Z. Furedi:
    On the Prague dimension of Kneser graphs,
    in: Numbers, Information and Complexity, (Bielefeld, 1998), pp. 125-128. (Ingo Althöfer, Ning Cai, Gunter Dueck, Levon Khachatrian, Mark S. Pinsker, Andras Sarközy, Ingo Wegener and Zhen Zhang, Eds.), Kluwer Academic Publishers, Boston, MA, 2000.
    | pdf | | ps |

  • 156.
    Z. Furedi:
    On the double competition number,
    Discrete Applied Mathematics 82 (1998), 251-255.
    | pdf | | ps |

  • 154.
    Z. Furedi and P. Komjath:
    Nonexistence of universal graphs without some trees,
    Combinatorica 17 (1997), 163-171.
    | pdf | | ps |

  • 151.
    Z. Furedi and P. Komjath:
    On the existence of countable universal graphs,
    J. Graph Theory 25 (1997), 53-58.
    | pdf | | ps |

  • 95.
    Z. Furedi, J. R. Griggs, and D. J. Kleitman:
    Pair labellings with given distance,
    SIAM Journal on Discrete Mathematics 2 (1989), 491-498.
    | pdf |

  • 82.
    Z. Furedi, J. R. Griggs, R. Holzman, and D. J. Kleitman:
    Representations of families of triples over GF(2),
    Journal of Combinatorial Theory, Ser. A 53 (1990), 306-315.
    |(almost final preprint) pdf |

    • Szemeredi's regularity lemma Back to contents

  • 147.
    Z. Furedi:
    Extremal hypergraphs and combinatorial geometry,
    Proceedings of the International Congress of Mathematicians,
    Zurich, Switzerland 1994.     pp. 1343-1352. Birkhauser, Basel, 1995.
    | pdf | | ps |

  • 91.
    Z. Furedi, :
    The maximum number of edges in a minimal graph of diameter 2,
    Journal of Graph Theory 16 (1992), 81-98.
    | (almost final preprint) pdf |

    • More extremal graph theory Back to contents

  • 204.
    Z. Furedi, A. Gyarfas, G. Sarkozy, and S. Selkow:
    Inequalities for the First-Fit chromatic number,
    Journal of Graph Theory
    | pdf | | ps |

  • 192.
    Z. Furedi and A. Kundgen:
    Moments of graphs in monotone families,
    Journal of Graph Theory 51 (2006), 37-48.
    | pdf |

  • 189.
    Ya-Chen Chen and Z. Furedi:
    Minimum vertex-diameter-2-critical graphs,
    J. Graph Theory, 50 (2005), 293-315.
    | pdf | | ps |

  • 188.
    Z. Furedi, A. Kostochka, R. Skrekovski, M. Stiebitz, and D. West:
    Nordhaus-Gaddum-type theorems for decompositions into many parts,
    J. Graph Theory, 50 (2005), 273-292.
    | pdf | | ps |

  • 183.
    Z. Füredi:
    Gráfok lokális szinezései , (On local colorings of graphs. In Hungarian)
    (Sept. 16, 2002)
    | ps |

  • 173.
    Ya-Chen Chen and Z. Furedi:
    Hamiltonian Kneser graphs,
    Combinatorica 22 (2002), 147-149.
    | pdf | | ps |

  • 169.
    Z. Furedi and A. Kundgen:
    Covering a graph with cuts of minimum total size,
    Discrete Mathematics 237 (2001), 129-148.
    | pdf |

  • 167.
    M. Axenovich and Z. Furedi:
    Embedding of graphs in two-irregular graphs,
    Journal of Graph Theory 36 (2001), 75-83.
    | pdf |

  • 165.
    Z. Furedi, D. Mubayi, and D. West:
    Multiple vertex coverings by specified induced subgraphs,
    Journal of Graph Theory 34 (2000), 180-190.
    | pdf | | ps |

  • 164.
    M. Axenovich, Z. Furedi, and D. Mubayi:
    On generalized Ramsey theory: the bipartite case,
    Journal of Combinatorial Theory, Ser. B 79 (2000), 66-86.
    | pdf |

  • 160.
    Z. Furedi and D. Mubayi:
    Signed domination in regular graphs and set-systems,
    Journal of Combinatorial Theory, Ser. B 76 (1999), 223-239.
    | pdf | | ps |

  • 159.
    P. Erdös, Z. Furedi, B. Rothschild, and V. T. Sos:
    Induced subgraphs of given sizes,
    Discrete Mathematics 200 (1999), 61-77.
    | pdf | | ps |

  • 144.
    P. Erdös, Z. Furedi, M. Loebl, and V. T. Sos:
    Discrepancy of trees,
    Studia Sci. Math. Hungar. 30 (1995), 47-57.
    | 3.2 MB pdf |

  • 129.
    Z. Furedi:
    Random Ramsey graphs for the four-cycle,
    Discrete Mathematics 126 (1994), 407-410.
    | 0.9 MB pdf |

  • 127.
    Z. Furedi and D. Reimer and A. Seress:
    Hajnal's triangle-free game and extremal graph problems,
    Proceedings of the 22th Southeastern international conference on combinatorics, graph theory and computing (Boca Raton, Fla., 1991)
    Congressus Numerantium 82 (1991), 123-128.
    | 1.5 MB pdf |

  • 126.
    Noga Alon and Z. Furedi:
    Spanning subgraphs of random graphs (A research problem),
    Graphs and Combinatorics 8 (1992), 91-94.
    | pdf |

  • 106.
    Z. Furedi:
    Graphs of diameter 3 with minimum number of edges,
    Graphs and Combinatorics 6 (1990), 333-337.
    | 1 MB pdf |

  • 105.
    Z. Furedi:
    Graphs with maximum number of star-forests,
    Studia Sci. Math. Hungar. 27 (1992), 403-407.
    | 1.1 MB pdf |

  • 74.
    F. R. K. Chung, Z. Furedi, R. L. Graham, and P. Seymour:
    On induced subgraphs of the cube,
    Journal of Combinatorial Theory, Ser. A 49 (1988), 180-187.
    | pdf |

  • 48.
    P. Erdös, Z. Furedi, A. Hajnal, P. Komjáth, V. Rodl, and A. Seress:
    Coloring graphs with locally few colors,
    Discrete Mathematics 59 (1986), 21-34.
    | 3.7 MB pdf |

    • Posets Back to contents

  • 98.
    Z. Furedi and Klaus Reuter:
    The jump number of suborders of the power set order,
    Order 6 (1989), 101-103.
    | 0.6 MB pdf |

  • 83.
    Z. Furedi, J. R. Griggs, and D. J. Kleitman:
    A minimal cutset of the Boolean lattice with almost all members,
    Graphs and Combinatorics 5 (1989), 327-332.
    | pdf |

  • 72.
    Z. Furedi and J. Kahn:
    Dimension versus size,
    Order 5 (1988), 17-20.
    | 0.8 MB pdf |

  • 52.
    Z. Furedi and J. Kahn:
    On the dimensions of ordered sets of bounded degree,
    Order 3 (1986), 15-20.
    | 1.3 MB pdf |

    • Codes Back to contents

  • 199.
    D. Danev, Z. Furedi, and M. Ruszinko:
    Multiple access Euclidean channel,
    Multiple Access Channels - Theory and Practice (Edited by Ezio Biglieri, Laszlo Gyorfi),
    NATO Security through Science Series, D: Information and Communication Security 10 (2007), 54-72.
    | pdf |

  • 179.
    M. Axenovich and Z. Furedi:
    Exact bounds on the sizes of covering codes,
    Designs, Codes, and Cryptography 30 (2003), 21-38.
    | pdf |

  • 161.
    Z. Furedi and M. Ruszinko:
    An improved upper bound of the rate of Eucledian superimposed codes,
    IEEE Trans. Inform. Theory 45 (1999), 799-802.
    | pdf | | ps |

  • 153.
    Z. Furedi:
    On r-cover-free families,
    Journal of Combinatorial Theory, Ser. A 73 (1996), 172-173.
    | 0.6 MB pdf |

  • 152.
    Z. Furedi, G. J. Szekely, and Z. Zubor:
    On the lottery problem,
    J. Combinatorial Designs 4 (1996), 5-10.
    | pdf | | ps |

  • 42.
    P. Erdös, P. Frankl, and Z. Furedi:
    Families of finite sets in which no set is covered by the union of r others,
    Israel Journal of Mathematics 51 (1985), 79-89.
    | 2.8 MB pdf |

  • 27.
    P. Frankl and Z. Furedi:
    Union-free hypergraphs and probability theory,
    European Journal of Combinatorics 5 (1984), 127-131.
    Erratum, ibid 5 (1984), p. 395.
    | 1.4 MB pdf |

  • 14.
    P. Erdös, P. Frankl, and Z. Furedi:
    Families of finite sets in which no set is covered by the union of two others,
    Journal of Combinatorial Theory, Ser. A 33 (1982), 158-166.
    | 1.7 MB pdf |

    • None of the above, more Combinatorics Back to contents

  • 103.
    Z. Furedi and R. Kurshan:
    Minimal length test vectors for multiple-fault detection,
    Theoretical Computer Science 305 (2004), 191-208.
    | pdf |

  • 62.
    Z. Furedi:
    The maximum number of balancing sets,
    Graphs and Combinatorics 3 (1987), 251-254.
    | 0.8 MB pdf |

  • 8.
    Z. Furedi and J. Komlos:
    The eigenvalues of random symmetric matrices,
    Combinatorica 1 (1981), 233-241.
    | 2.8 MB pdf |

    • Papers with Paul Erdös Back to contents

  • 159.
    P. Erdös, Z. Furedi, B. Rothschild, and V. T. Sos:
    Induced subgraphs of given sizes,
    Discrete Mathematics 200 (1999), 61-77.
    | pdf | | ps |

  • 144.
    P. Erdös, Z. Furedi, M. Loebl, and V. T. Sos:
    Discrepancy of trees,
    Studia Sci. Math. Hungar. 30 (1995), 47-57.
    | 3.2 MB pdf |

  • 140.
    P. Erdös, Z. Furedi, R. J. Gould, and D. S. Gunderson:
    Extremal graphs for intersecting triangles,
    Journal of Combinatorial Theory, Ser. B 64 (1995), 89-100.
    | ps |

  • 117.
    P. Erdös, P. Fishburn, and Z. Furedi:
    Midpoints of diagonals of convex n-gons,
    SIAM Journal on Discrete Mathematics 4 (1991), 329-341.
    | 2.8 MB pdf |

  • 114.
    P. Erdös, Z. Furedi, and Z. Tuza:
    Saturated r-uniform hypergraphs,
    Discrete Mathematics 98 (1991), 95-104.
    | 3 MB pdf |

  • 48.
    P. Erdös, Z. Furedi, A. Hajnal, P. Komjáth, V. Rodl, and A. Seress:
    Coloring graphs with locally few colors,
    Discrete Mathematics 59 (1986), 21-34.
    | 3.7 MB pdf |

  • 42.
    P. Erdös, P. Frankl, and Z. Furedi:
    Families of finite sets in which no set is covered by the union of r others,
    Israel Journal of Mathematics 51 (1985), 79-89.
    | 2.8 MB pdf |

  • 17.
    P. Erdös and Z. Furedi:
    The greatest angle among n points in the d-dimensional Euclidean space,
    in: Combinatorial Mathematics (Proc. Colloq., Marseilles-Luminy, 1981. C. Berge et al. Eds.) North-Holland, Amsterdam, 1983.
    North-Holland Math. Studies 75. Annals of Discrete Mathematics 17 (1983), 275-283.
    | 2.1 MB pdf |

  • 14.
    P. Erdös, P. Frankl, and Z. Furedi:
    Families of finite sets in which no set is covered by the union of two others,
    Journal of Combinatorial Theory, Ser. A 33 (1982), 158-166.
    | 1.7 MB pdf |