Zoltán Füredi

Zoltán Füredi, Younjin Kim: The structure of the typical graphs of given diameter. Discrete Mathematics 313(2): 155-163 (2013)

Zoltán Füredi, Younjin Kim: Cycle-Saturated Graphs with Minimum Number of Edges. Journal of Graph Theory 73(2): 203-215 (2013)

Zoltán Füredi: 2-Cancellative Hypergraphs and Codes. Combinatorics, Probability & Computing 21(1-2): 159-177 (2012)

Zoltán Füredi, Attila Sali: Some new bounds on partition critical hypergraphs. Eur. J. Comb. 33(5): 844-852 (2012)

János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós: Large B_d-Free and Union-free Subfamilies. SIAM J. Discrete Math. 26(1): 71-76 (2012)

Zoltán Füredi, Attila Sali: Optimal Multivalued Shattering. SIAM J. Discrete Math. 26(2): 737-744 (2012)

János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós: Large Bd-free and union-free subfamilies. Electronic Notes in Discrete Mathematics 38: 101-104 (2011)

Zoltán Füredi: Linear paths and trees in uniform hypergraphs. Electronic Notes in Discrete Mathematics 38: 377-382 (2011)

Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri: Reverse-free codes and permutations. Electronic Notes in Discrete Mathematics 38: 383-387 (2011)

Zoltán Füredi, Younjin Kim: Minimum Ck-saturated graphs. Electronic Notes in Discrete Mathematics 38: 505-510 (2011)

Zoltán Füredi, Lale Özkahya: On even-cycle-free subgraphs of the hypercube. J. Comb. Theory, Ser. A 118(6): 1816-1819 (2011)

Zoltán Füredi, Lale Özkahya: Unavoidable subhypergraphs: a-clusters. J. Comb. Theory, Ser. A 118(8): 2246-2256 (2011)

Zoltán Füredi, John E. Wetzel: Covers for closed curves of length two. Periodica Mathematica Hungarica 63(1): 1-17 (2011)

Zoltán Füredi, Jenö Lehel: Tight embeddings of partial quadrilateral packings. J. Comb. Theory, Ser. A 117(4): 466-474 (2010)

Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri: On Reverse-Free Codes and Permutations. SIAM J. Discrete Math. 24(3): 964-978 (2010)

Zoltán Füredi, Lale Özkahya: On 14-Cycle-Free Subgraphs of the Hypercube. Combinatorics, Probability & Computing 18(5): 725-729 (2009)

Zoltán Füredi, Lale Özkahya: Unavoidable subhypergraphs: a-clusters. Electronic Notes in Discrete Mathematics 34: 63-67 (2009)

Zoltán Füredi, Ida Kantor: List colorings with distinct list sizes, the case of complete bipartite graphs. Electronic Notes in Discrete Mathematics 34: 323-327 (2009)

Zoltán Füredi, Lale Özkahya: On even-cycle-free subgraphs of the hypercube. Electronic Notes in Discrete Mathematics 34: 515-517 (2009)

Zoltán Füredi, Attila Sali: Partition Critical Hypergraphs. Electronic Notes in Discrete Mathematics 34: 573-577 (2009)

Zoltán Füredi, Miklós Ruszinkó: Large convex cones in hypercubes. Discrete Applied Mathematics 156(9): 1536-1541 (2008)

Zoltán Füredi, Ervin Györi, János Pach, Attila Sali: Guest Editors' Foreword. Discrete Mathematics 308(19): 4305 (2008)

Zoltán Füredi, Jeong-Hyun Kang: Covering the n-space by convex bodies and its chromatic number. Discrete Mathematics 308(19): 4495-4500 (2008)

Zoltán Füredi, Dhruv Mubayi, Oleg Pikhurko: Quadruple systems with independent neighborhoods. J. Comb. Theory, Ser. A 115(8): 1552-1560 (2008)

Zoltán Füredi, András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow: Inequalities for the first-fit chromatic number. Journal of Graph Theory 59(1): 75-88 (2008)

Zoltán Füredi: Covering a Triangle with Positive and Negative Homothetic Copies. Discrete & Computational Geometry 38(2): 273-288 (2007)

Nancy Eaton, Zoltán Füredi, Alexandr V. Kostochka, Jozef Skokan: Tree representations of graphs. Eur. J. Comb. 28(4): 1087-1098 (2007)

Zoltán Füredi, Gyula O. H. Katona: 2-Bases of Quadruples. Combinatorics, Probability & Computing 15(1-2): 131-141 (2006)

Zoltán Füredi, Robert H. Sloan, Ken Takata, György Turán: On set systems with a threshold property. Discrete Mathematics 306(23): 3097-3111 (2006)

Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits: 4-Books of three pages. J. Comb. Theory, Ser. A 113(5): 882-891 (2006)

Zoltán Füredi, André Kündgen: Moments of graphs in monotone families. Journal of Graph Theory 51(1): 37-48 (2006)

Zoltán Füredi, András Gyárfás, Gábor Simonyi: Connected matchings and Hadwiger's conjecture. Combinatorics, Probability & Computing 14(3): 435-438 (2005)

Zoltán Füredi, Miklós Simonovits: Triple Systems Not Containing a Fano Configuration. Combinatorics, Probability & Computing 14(4): 467-484 (2005)

Zoltán Füredi, Miklós Ruszinkó: Large Convex Cones in Hypercubes. Electronic Notes in Discrete Mathematics 21: 283-284 (2005)

Zoltán Füredi, Alexandr V. Kostochka, Riste Skrekovski, Michael Stiebitz, Douglas B. West: Nordhaus-Gaddum-type Theorems for decompositions into many parts. Journal of Graph Theory 50(4): 273-292 (2005)

Ya-Chen Chen, Zoltán Füredi: Minimum vertex-diameter-2-critical graphs. Journal of Graph Theory 50(4): 293-315 (2005)

Péter L. Erdös, Zoltán Füredi, Gyula O. H. Katona: Two-Part and k-Sperner Families: New Proofs Using Permutations. SIAM J. Discrete Math. 19(2): 489-500 (2005)

Zoltán Füredi, Benny Sudakov: Extremal set systems with restricted k-wise intersections. J. Comb. Theory, Ser. A 105(1): 143-159 (2004)

Zoltán Füredi, Zsolt Katona: Multiply intersecting families of sets. J. Comb. Theory, Ser. A 106(2): 315-326 (2004)

Zoltán Füredi, Robert P. Kurshan: Minimal length test vectors for multiple-fault detection. Theor. Comput. Sci. 315(1): 191-208 (2004)

Zoltán Füredi, Jeong-Hyun Kang: Distance graph on Zⁿwith norm. Theor. Comput. Sci. 319(1-3): 357-366 (2004)

Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits: The Tura'n Density of the Hypergraph {abc, ade, bde, cde}. Electr. J. Comb. 10 (2003)

Maria Axenovich, Zoltán Füredi: Exact Bounds on the Sizes of Covering Codes. Des. Codes Cryptography 30(1): 21-38 (2003)

Ya-Chen Chen, Zoltán Füredi: Hamiltonian Kneser Graphs. Combinatorica 22(1): 147-149 (2002)

Zoltán Füredi, András Gyárfás, Miklós Ruszinkó: On the maximum size of (p, Q)-free families. Discrete Mathematics 257(2-3): 385-403 (2002)

Zoltán Füredi, André Kündgen: Turán problems for integer-weighted graphs. Journal of Graph Theory 40(4): 195-225 (2002)

Zoltán Füredi, Radhika Ramamurthi: On splittable colorings of graphs and hypergraphs. Journal of Graph Theory 40(4): 226-237 (2002)

Zoltán Füredi, André Kündgen: Covering a graph with cuts of minimum total size. Discrete Mathematics 237(1-3): 129-148 (2001)

Imre Bárány, Zoltán Füredi: On the lattice diameter of a convex polygon. Discrete Mathematics 241(1-3): 41-50 (2001)

Zoltán Füredi, András Gyárfás, Miklós Ruszinkó: On the Maximum Size of (p, Q) - free Families. Electronic Notes in Discrete Mathematics 10: 247-249 (2001)

Zoltán Füredi: Maximal t-Critical Linear Hypergraphs. Graphs and Combinatorics 17(1): 73-78 (2001)

Zoltán Füredi, Douglas B. West: Ramsey Theory and Bandwidth of Graphs. Graphs and Combinatorics 17(3): 463-471 (2001)

Endre Boros, Yair Caro, Zoltán Füredi, Raphael Yuster: Covering Non-uniform Hypergraphs. J. Comb. Theory, Ser. B 82(2): 270-284 (2001)

Maria Axenovich, Zoltán Füredi: Embedding of graphs in two-irregular graphs. Journal of Graph Theory 36(2): 75-83 (2001)

Dominique de Caen, Zoltán Füredi: The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane. J. Comb. Theory, Ser. B 78(2): 274-276 (2000)

Maria Axenovich, Zoltán Füredi, Dhruv Mubayi: On Generalized Ramsey Theory: The Bipartite Case. J. Comb. Theory, Ser. B 79(1): 66-86 (2000)

Zoltán Füredi, Dhruv Mubayi, Douglas B. West: Multiple vertex coverings by specified induced subgraphs. Journal of Graph Theory 34(2): 180-190 (2000)

Paul Erdös, Zoltán Füredi, Bruce Rothschild, Vera T. Sós: Induced subgraphs of given sizes. Discrete Mathematics 200(1-3): 61-77 (1999)

Zoltán Füredi, Dhruv Mubayi: Signed Domination in Regular Graphs and Set-Systems. J. Comb. Theory, Ser. B 76(2): 223-239 (1999)

Zoltán Füredi, Miklós Ruszinkó: An Improved Upper Bound of the Rate of Euclidean Superimposed Codes. IEEE Transactions on Information Theory 45(2): 799-802 (1999)

Rodney G. Downey, Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel: Difference Sets and Computability Theory. Ann. Pure Appl. Logic 93(1-3): 63-72 (1998)

Zoltán Füredi: On the Double Competition Number. Discrete Applied Mathematics 82(1-3): 251-255 (1998)

Zoltán Füredi, Peter Horák, Chandra M. Pareek, Xuding Zhu: Minimal Oriented Graphs of Diameter 2. Graphs and Combinatorics 14(4): 345-350 (1998)

Zoltán Füredi, Péter Komjáth: Nonexistence of Universal Graphs Without Some Trees. Combinatorica 17(2): 163-171 (1997)

Zoltán Füredi, Péter Komjáth: On the existence of countable universal graphs. Journal of Graph Theory 25(1): 53-58 (1997)

Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel: Difference Sets and Inverting the Difference Operator. Combinatorica 16(1): 87-106 (1996)

Zoltán Füredi: An Upper Bound on Zarankiewicz' Problem. Combinatorics, Probability & Computing 5: 29-33 (1996)

Zoltán Füredi: On the Number of Edges of Quadrilateral-Free Graphs. J. Comb. Theory, Ser. B 68(1): 1-6 (1996)

Zoltán Füredi: On r-Cover-free Families. J. Comb. Theory, Ser. A 73(1): 172-173 (1996)

Zoltán Füredi: New Asymptotics for Bipartite Turán Numbers. J. Comb. Theory, Ser. A 75(1): 141-144 (1996)

Zoltán Füredi: Scrambling permutations and entropy of hypergraphs. Random Struct. Algorithms 8(2): 97-104 (1996)

Paul Erdös, Zoltán Füredi, Ronald J. Gould, David S. Gunderson: Extremal Graphs for Intersecting Triangles. J. Comb. Theory, Ser. B 64(1): 89-100 (1995)

Zoltán Füredi, Felix Lazebnik, Ákos Seress, Vasiliy A. Ustimenko, Andrew J. Woldar: Graphs of Prescribed Girth and Bi-Degree. J. Comb. Theory, Ser. B 64(2): 228-239 (1995)

Zoltán Füredi: Cross-Intersecting Families of Finite Sets. J. Comb. Theory, Ser. A 72(2): 332-339 (1995)

Zoltán Füredi, Daniel J. Kleitman: The Prison Yard Problem. Combinatorica 14(3): 287-300 (1994)

Zoltán Füredi, Michel X. Goemans, Daniel J. Kleitman: On the Maximum Number of Triangles in Wheel-Free Graphs. Combinatorics, Probability & Computing 3: 63-75 (1994)

Zoltán Füredi: Intersecting designs from linear programming and graphs of diameter two. Discrete Mathematics 127(1-3): 187-207 (1994)

Zoltán Füredi, Jeff Kahn, Paul D. Seymour: On the fractional matching polytope of a hypergraph. Combinatorica 13(2): 167-180 (1993)

Paul Erdös, Zoltán Füredi, János Pach, Imre Z. Ruzsa: The grid revisted. Discrete Mathematics 111(1-3): 189-196 (1993)

Noga Alon, Zoltán Füredi: Covering the Cube by Affine Hyperplanes. Eur. J. Comb. 14(2): 79-83 (1993)

Noga Alon, Imre Bárány, Zoltán Füredi, Daniel J. Kleitman: Point Selections and Weak e-Nets for Convex Hulls. Combinatorics, Probability & Computing 1: 189-200 (1992)

Zoltán Füredi: Indecomposable regular graphs and hypergraphs. Discrete Mathematics 101(1-3): 59-64 (1992)

Zoltán Füredi, Péter Hajnal: Davenport-Schinzel theory of matrices. Discrete Mathematics 103(3): 233-251 (1992)

Noga Alon, Zoltán Füredi: Spanning subgraphs of random graphs. Graphs and Combinatorics 8(1): 91-94 (1992)

Zoltán Füredi, Richard Stanley: Sets of vectors with many orthogonal paris. Graphs and Combinatorics 8(4): 391-394 (1992)

Zoltán Füredi: The maximum number of edges in a minimal graph of diameter 2. Journal of Graph Theory 16(1): 81-98 (1992)

Zoltán Füredi, Daniel J. Kleitman: On zero-trees. Journal of Graph Theory 16(2): 107-120 (1992)

Martin E. Dyer, Zoltán Füredi, Colin McDiarmid: Volumes Spanned by Random Points in the Hypercube. Random Struct. Algorithms 3(1): 91-106 (1992)

Zoltán Füredi: On a Turán type problem of Erdös. Combinatorica 11(1): 75-79 (1991)

Zoltán Füredi: The Densest Packing of Equal Circles into a Parallel Strip. Discrete & Computational Geometry 6: 95-106 (1991)

Peter Frankl, Zoltán Füredi: A sharpening of Fisher's inequality. Discrete Mathematics 90(1): 103-107 (1991)

Paul Erdös, Zoltán Füredi, Zsolt Tuza: Saturated r-uniform hypergraphs. Discrete Mathematics 98(2): 95-104 (1991)

Peter Frankl, Zoltán Füredi: Beyond the Erdös-Ko-Rado theorem. J. Comb. Theory, Ser. A 56(2): 182-194 (1991)

Zoltán Füredi: Maximal Independent Subsets in Steiner Systems and in Planar Sets. SIAM J. Discrete Math. 4(2): 196-199 (1991)

Paul Erdös, Peter C. Fishburn, Zoltán Füredi: Midpoints of Diagonals of Convex n-GONS. SIAM J. Discrete Math. 4(3): 329-341 (1991)

Imre Bárány, Zoltán Füredi, László Lovász: On the number of halving planes. Combinatorica 10(2): 175-183 (1990)

Zoltán Füredi: Perfect error-correcting databases. Discrete Applied Mathematics 28(2): 171-176 (1990)

Zoltán Füredi, Jeff Kahn, Daniel J. Kleitman: Sphere coverings of the hypercube with incomparable centers. Discrete Mathematics 83(1): 129-134 (1990)

Zoltán Füredi: Graphs of diameter 3 with the minimum number of edges. Graphs and Combinatorics 6(4): 333-337 (1990)

Zoltán Füredi, Jerrold R. Griggs, Ron Holzman, Daniel J. Kleitman: Representations of families of triples over GF(2). J. Comb. Theory, Ser. A 53(2): 306-315 (1990)

Zoltán Füredi: Covering pairs by q² + q + 1 sets. J. Comb. Theory, Ser. A 54(2): 248-271 (1990)

Zoltán Füredi: The maximum number of unit distances in a convex n-gon. J. Comb. Theory, Ser. A 55(2): 316-320 (1990)

Zoltán Füredi: Competition Graphs and Clique Dimensions. Random Struct. Algorithms 1(2): 183-190 (1990)

Endre Boros, Zoltán Füredi, L. M. Kelly: On Representing Sylvester- Gallai Designs. Discrete & Computational Geometry 4: 345-348 (1989)

Zoltán Füredi: A projective plane is an outstanding 2-cover. Discrete Mathematics 74(3): 321-324 (1989)

Zoltán Füredi: Covering the complete graph by partitions. Discrete Mathematics 75(1-3): 217-226 (1989)

Noga Alon, Zoltán Füredi: Legitimate colorings of projective planes. Graphs and Combinatorics 5(1): 95-106 (1989)

Zoltán Füredi, Jerrold R. Griggs, Daniel J. Kleitman: A minimal cutset of the boolean lattice with almost all members. Graphs and Combinatorics 5(1): 327-332 (1989)

Endre Boros, Zoltán Füredi, Jeff Kahn: Maximal intersecting families and affine regular polygons in PG(2, q). J. Comb. Theory, Ser. A 52(1): 1-9 (1989)

Peter Frankl, Zoltán Füredi: Extremal problems whose solutions are the blowups of the small witt-designs. J. Comb. Theory, Ser. A 52(1): 129-147 (1989)

Zoltán Füredi, Jerrold R. Griggs, Daniel J. Kleitman: Pair Labeelings with Given Distance. SIAM J. Discrete Math. 2(4): 491-499 (1989)

Imre Bárány, Zoltán Füredi, László Lovász: On the Number of Halving Planes. Symposium on Computational Geometry 1989: 140-144

Zoltán Füredi, Ivo G. Rosenberg: Multicolored lines in a finite geometry. Discrete Mathematics 71(2): 149-163 (1988)

Zoltán Füredi: Matchings and covers in hypergraphs. Graphs and Combinatorics 4(1): 115-206 (1988)

Fan R. K. Chung, Zoltán Füredi, Ronald L. Graham, Paul D. Seymour: On induced subgraphs of the cube. J. Comb. Theory, Ser. A 49(1): 180-187 (1988)

Fan R. K. Chung, Zoltán Füredi, M. R. Garey, Ronald L. Graham: On the Fractional Covering Number of Hypergraphs. SIAM J. Discrete Math. 1(1): 45-49 (1988)

Imre Bárány, Zoltán Füredi: Computing the Volume is Difficulte. Discrete & Computational Geometry 2: 319-326 (1987)

Zoltán Füredi, Jerrold R. Griggs, Andrew M. Odlyzko, James B. Shearer: Ramsey-Sperner theory. Discrete Mathematics 63(2-3): 143-152 (1987)

Noga Alon, Zoltán Füredi: On the kernel of intersecting families. Graphs and Combinatorics 3(1): 91-94 (1987)

Zoltán Füredi: The maximum number of balancing sets. Graphs and Combinatorics 3(1): 251-254 (1987)

Peter Frankl, Zoltán Füredi, János Pach: Bounding one-way differences. Graphs and Combinatorics 3(1): 341-347 (1987)

Peter Frankl, Zoltán Füredi: Exact solution of some Turán-type problems. J. Comb. Theory, Ser. A 45(2): 226-262 (1987)

Peter Frankl, Zoltán Füredi: Finite projective spaces and intersecting hypergraphs. Combinatorica 6(4): 335-354 (1986)

Zoltán Füredi, Jerrold R. Griggs: Families of finite sets with minimum shadows. Combinatorica 6(4): 355-363 (1986)

Zoltán Füredi: Random Polytopes in the d-Dimensional Cube. Discrete & Computational Geometry 1: 315-319 (1986)

Paul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress: Coloring graphs with locally few colors. Discrete Mathematics 59(1-2): 21-34 (1986)

Richard P. Anstee, Zoltán Füredi: Forbidden submatrices. Discrete Mathematics 62(3): 225-243 (1986)

Zoltán Füredi: t-expansive andt-wise intersecting hypergraphs. Graphs and Combinatorics 2(1): 67-80 (1986)

Zoltán Füredi: The chromatic index of simple hypergraphs. Graphs and Combinatorics 2(1): 89-92 (1986)

J. Csima, Zoltán Füredi: Colouring finite incidence structures. Graphs and Combinatorics 2(1): 339-346 (1986)

Peter Frankl, Zoltán Füredi: Extremal problems concerning Kneser graphs. J. Comb. Theory, Ser. B 40(3): 270-284 (1986)

Peter Frankl, Zoltán Füredi: Non-trivial intersecting families. J. Comb. Theory, Ser. A 41(1): 150-153 (1986)

Imre Bárány, Zoltán Füredi: Computing the Volume Is Difficult. STOC 1986: 442-447

Zoltán Füredi: Set-systems with three intersections. Combinatorica 5(1): 27-31 (1985)

Zoltán Füredi, Zsolt Tuza: Hypergraphs without a large star. Discrete Mathematics 55(3): 317-321 (1985)

Zoltán Füredi: A Ramsey-Sperner theorem. Graphs and Combinatorics 1(1): 51-56 (1985)

Peter Frankl, Zoltán Füredi: Forbidding Just One Intersection. J. Comb. Theory, Ser. A 39(2): 160-176 (1985)

Zoltán Füredi: Hypergraphs in which all disjoint pairs have distinct unions. Combinatorica 4(2): 161-168 (1984)

Peter Frankl, Zoltán Füredi: A new extremal property of Steiner triple-systems. Discrete Mathematics 48(2-3): 205-212 (1984)

Peter Frankl, Zoltán Füredi: An exact result for 3-graphs. Discrete Mathematics 50: 323-328 (1984)

Peter Frankl, Zoltán Füredi: On Hypergraphs without Two Edges Intersecting in a Given Number of Vertices. J. Comb. Theory, Ser. A 36(2): 230-236 (1984)

Peter Frankl, Zoltán Füredi: A new generation of the Erdös - Ko - Rado theorem. Combinatorica 3(3): 341-350 (1983)

Zoltán Füredi: On finite set-systems whose every intersection is a Kernel of a star. Discrete Mathematics 47: 129-132 (1983)

Imre Bárány, Zoltán Füredi: Mental Poker with Three or More Players. Information and Control 59(1-3): 84-93 (1983)

Zoltán Füredi: Graphs without quadrilaterals. J. Comb. Theory, Ser. B 34(2): 187-190 (1983)

Zoltán Füredi: Set-systems with prescribed cardinalities for pairwise intersections. Discrete Mathematics 40(1): 53-67 (1982)

Zoltán Füredi: An Intersection Problem Whose Extremum Is the Finite Projective Space. J. Comb. Theory, Ser. A 32(1): 66-72 (1982)

Péter L. Erdös, Peter Frankl, Zoltán Füredi: Families of Finite Sets in Which No Set Is Covered by the Union of Two Others. J. Comb. Theory, Ser. A 33(2): 158-166 (1982)

Zoltán Füredi: Maximum degree and fractional matchings in uniform hypergraphs. Combinatorica 1(2): 155-162 (1981)

Zoltán Füredi, János Komlós: The eigenvalues of random symmetric matrices. Combinatorica 1(3): 233-241 (1981)

Peter Frankl, Zoltán Füredi: A short proof for a theorem of Harper about Hamming-spheres. Discrete Mathematics 34(3): 311-313 (1981)

Zoltán Füredi: On Maximal Intersecting Families of Finite Sets. J. Comb. Theory, Ser. A 28(3): 282-289 (1980)