 | 2009 |
|---|
| 112 |       | Zoltán Füredi,
Lale Özkahya:
On 14-Cycle-Free Subgraphs of the Hypercube.
Combinatorics, Probability & Computing 18(5): 725-729 (2009) |
| 2008 |
|---|
| 111 | | Zoltán Füredi,
Miklós Ruszinkó:
Large convex cones in hypercubes.
Discrete Applied Mathematics 156(9): 1536-1541 (2008) |
| 110 | | Zoltán Füredi,
Ervin Györi,
János Pach,
Attila Sali:
Guest Editors' Foreword.
Discrete Mathematics 308(19): 4305 (2008) |
| 109 | | 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) |
| 108 | | Zoltán Füredi,
Dhruv Mubayi,
Oleg Pikhurko:
Quadruple systems with independent neighborhoods.
J. Comb. Theory, Ser. A 115(8): 1552-1560 (2008) |
| 107 | | 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) |
| 2007 |
|---|
| 106 | | Zoltán Füredi:
Covering a Triangle with Positive and Negative Homothetic Copies.
Discrete & Computational Geometry 38(2): 273-288 (2007) |
| 105 | | Nancy Eaton,
Zoltán Füredi,
Alexandr V. Kostochka,
Jozef Skokan:
Tree representations of graphs.
Eur. J. Comb. 28(4): 1087-1098 (2007) |
| 2006 |
|---|
| 104 | | Zoltán Füredi,
Gyula O. H. Katona:
2-Bases of Quadruples.
Combinatorics, Probability & Computing 15(1-2): 131-141 (2006) |
| 103 | | 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) |
| 102 | | Zoltán Füredi,
Oleg Pikhurko,
Miklós Simonovits:
4-Books of three pages.
J. Comb. Theory, Ser. A 113(5): 882-891 (2006) |
| 101 | | Zoltán Füredi,
André Kündgen:
Moments of graphs in monotone families.
Journal of Graph Theory 51(1): 37-48 (2006) |
| 2005 |
|---|
| 100 | | 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) |
| 99 | | Zoltán Füredi,
Miklós Simonovits:
Triple Systems Not Containing a Fano Configuration.
Combinatorics, Probability & Computing 14(4): 467-484 (2005) |
| 98 | | Zoltán Füredi,
Miklós Ruszinkó:
Large Convex Cones in Hypercubes.
Electronic Notes in Discrete Mathematics 21: 283-284 (2005) |
| 97 | | 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) |
| 96 | | Ya-Chen Chen,
Zoltán Füredi:
Minimum vertex-diameter-2-critical graphs.
Journal of Graph Theory 50(4): 293-315 (2005) |
| 95 | | 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) |
| 2004 |
|---|
| 94 | | Zoltán Füredi,
Benny Sudakov:
Extremal set systems with restricted k-wise intersections.
J. Comb. Theory, Ser. A 105(1): 143-159 (2004) |
| 93 | | Zoltán Füredi,
Zsolt Katona:
Multiply intersecting families of sets.
J. Comb. Theory, Ser. A 106(2): 315-326 (2004) |
| 92 | | Zoltán Füredi,
Robert P. Kurshan:
Minimal length test vectors for multiple-fault detection.
Theor. Comput. Sci. 315(1): 191-208 (2004) |
| 91 | | Zoltán Füredi,
Jeong-Hyun Kang:
Distance graph on Znwith norm.
Theor. Comput. Sci. 319(1-3): 357-366 (2004) |
| 2003 |
|---|
| 90 | | Maria Axenovich,
Zoltán Füredi:
Exact Bounds on the Sizes of Covering Codes.
Des. Codes Cryptography 30(1): 21-38 (2003) |
| 89 | | 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) |
| 2002 |
|---|
| 88 | | Ya-Chen Chen,
Zoltán Füredi:
Hamiltonian Kneser Graphs.
Combinatorica 22(1): 147-149 (2002) |
| 87 | | 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) |
| 2001 |
|---|
| 86 | | Zoltán Füredi,
André Kündgen:
Covering a graph with cuts of minimum total size.
Discrete Mathematics 237(1-3): 129-148 (2001) |
| 85 | | Imre Bárány,
Zoltán Füredi:
On the lattice diameter of a convex polygon.
Discrete Mathematics 241(1-3): 41-50 (2001) |
| 84 | | 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) |
| 83 | | Zoltán Füredi:
Maximal t-Critical Linear Hypergraphs.
Graphs and Combinatorics 17(1): 73-78 (2001) |
| 82 | | Zoltán Füredi,
Douglas B. West:
Ramsey Theory and Bandwidth of Graphs.
Graphs and Combinatorics 17(3): 463-471 (2001) |
| 81 | | Endre Boros,
Yair Caro,
Zoltán Füredi,
Raphael Yuster:
Covering Non-uniform Hypergraphs.
J. Comb. Theory, Ser. B 82(2): 270-284 (2001) |
| 2000 |
|---|
| 80 | | 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) |
| 79 | | 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) |
| 1999 |
|---|
| 78 | | 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) |
| 77 |  | 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) |
| 76 | | Zoltán Füredi,
Dhruv Mubayi:
Signed Domination in Regular Graphs and Set-Systems.
J. Comb. Theory, Ser. B 76(2): 223-239 (1999) |
| 1998 |
|---|
| 75 | | 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) |
| 74 | | Zoltán Füredi:
On the Double Competition Number.
Discrete Applied Mathematics 82(1-3): 251-255 (1998) |
| 1997 |
|---|
| 73 | | Zoltán Füredi,
Péter Komjáth:
Nonexistence of Universal Graphs Without Some Trees.
Combinatorica 17(2): 163-171 (1997) |
| 1996 |
|---|
| 72 | | Zoltán Füredi,
Carl G. Jockusch Jr.,
Lee A. Rubel:
Difference Sets and Inverting the Difference Operator.
Combinatorica 16(1): 87-106 (1996) |
| 71 | | Zoltán Füredi:
An Upper Bound on Zarankiewicz' Problem.
Combinatorics, Probability & Computing 5: 29-33 (1996) |
| 70 | | Zoltán Füredi:
On r-Cover-free Families.
J. Comb. Theory, Ser. A 73(1): 172-173 (1996) |
| 69 | | Zoltán Füredi:
New Asymptotics for Bipartite Turán Numbers.
J. Comb. Theory, Ser. A 75(1): 141-144 (1996) |
| 68 | | Zoltán Füredi:
On the Number of Edges of Quadrilateral-Free Graphs.
J. Comb. Theory, Ser. B 68(1): 1-6 (1996) |
| 67 | | Zoltán Füredi:
Scrambling permutations and entropy of hypergraphs.
Random Struct. Algorithms 8(2): 97-104 (1996) |
| 1995 |
|---|
| 66 | | Zoltán Füredi:
Cross-Intersecting Families of Finite Sets.
J. Comb. Theory, Ser. A 72(2): 332-339 (1995) |
| 65 | | 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) |
| 64 | | 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) |
| 1994 |
|---|
| 63 | | Zoltán Füredi,
Daniel J. Kleitman:
The Prison Yard Problem.
Combinatorica 14(3): 287-300 (1994) |
| 62 | | 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) |
| 61 | | Zoltán Füredi:
Intersecting designs from linear programming and graphs of diameter two.
Discrete Mathematics 127(1-3): 187-207 (1994) |
| 1993 |
|---|
| 60 | | Zoltán Füredi,
Jeff Kahn,
Paul D. Seymour:
On the fractional matching polytope of a hypergraph.
Combinatorica 13(2): 167-180 (1993) |
| 59 | | Paul Erdös,
Zoltán Füredi,
János Pach,
Imre Z. Ruzsa:
The grid revisted.
Discrete Mathematics 111(1-3): 189-196 (1993) |
| 58 | | Noga Alon,
Zoltán Füredi:
Covering the Cube by Affine Hyperplanes.
Eur. J. Comb. 14(2): 79-83 (1993) |
| 1992 |
|---|
| 57 | | 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) |
| 56 | | Zoltán Füredi:
Indecomposable regular graphs and hypergraphs.
Discrete Mathematics 101(1-3): 59-64 (1992) |
| 55 | | Zoltán Füredi,
Péter Hajnal:
Davenport-Schinzel theory of matrices.
Discrete Mathematics 103(3): 233-251 (1992) |
| 54 | | 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) |
| 1991 |
|---|
| 53 | | Zoltán Füredi:
On a Turán type problem of Erdös.
Combinatorica 11(1): 75-79 (1991) |
| 52 | | Zoltán Füredi:
The Densest Packing of Equal Circles into a Parallel Strip.
Discrete & Computational Geometry 6: 95-106 (1991) |
| 51 | | Peter Frankl,
Zoltán Füredi:
A sharpening of Fisher's inequality.
Discrete Mathematics 90(1): 103-107 (1991) |
| 50 | | Paul Erdös,
Zoltán Füredi,
Zsolt Tuza:
Saturated r-uniform hypergraphs.
Discrete Mathematics 98(2): 95-104 (1991) |
| 49 | | Peter Frankl,
Zoltán Füredi:
Beyond the Erdös-Ko-Rado theorem.
J. Comb. Theory, Ser. A 56(2): 182-194 (1991) |
| 48 | | Zoltán Füredi:
Maximal Independent Subsets in Steiner Systems and in Planar Sets.
SIAM J. Discrete Math. 4(2): 196-199 (1991) |
| 47 | | 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) |
| 1990 |
|---|
| 46 | | Imre Bárány,
Zoltán Füredi,
László Lovász:
On the number of halving planes.
Combinatorica 10(2): 175-183 (1990) |
| 45 | | Zoltán Füredi:
Perfect error-correcting databases.
Discrete Applied Mathematics 28(2): 171-176 (1990) |
| 44 | | Zoltán Füredi,
Jeff Kahn,
Daniel J. Kleitman:
Sphere coverings of the hypercube with incomparable centers.
Discrete Mathematics 83(1): 129-134 (1990) |
| 43 | | 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) |
| 42 | | Zoltán Füredi:
Covering pairs by q2 + q + 1 sets.
J. Comb. Theory, Ser. A 54(2): 248-271 (1990) |
| 41 | | 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) |
| 40 | | Zoltán Füredi:
Competition Graphs and Clique Dimensions.
Random Struct. Algorithms 1(2): 183-190 (1990) |
| 1989 |
|---|
| 39 | | 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 |
| 38 | | Endre Boros,
Zoltán Füredi,
L. M. Kelly:
On Representing Sylvester- Gallai Designs.
Discrete & Computational Geometry 4: 345-348 (1989) |
| 37 | | Zoltán Füredi:
A projective plane is an outstanding 2-cover.
Discrete Mathematics 74(3): 321-324 (1989) |
| 36 | | Zoltán Füredi:
Covering the complete graph by partitions.
Discrete Mathematics 75(1-3): 217-226 (1989) |
| 35 | | 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) |
| 34 | | 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) |
| 33 | | Zoltán Füredi,
Jerrold R. Griggs,
Daniel J. Kleitman:
Pair Labeelings with Given Distance.
SIAM J. Discrete Math. 2(4): 491-499 (1989) |
| 1988 |
|---|
| 32 | | Zoltán Füredi,
Ivo G. Rosenberg:
Multicolored lines in a finite geometry.
Discrete Mathematics 71(2): 149-163 (1988) |
| 31 | | 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) |
| 30 | | 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) |
| 1987 |
|---|
| 29 | | Imre Bárány,
Zoltán Füredi:
Computing the Volume is Difficulte.
Discrete & Computational Geometry 2: 319-326 (1987) |
| 28 | | Zoltán Füredi,
Jerrold R. Griggs,
Andrew M. Odlyzko,
James B. Shearer:
Ramsey-Sperner theory.
Discrete Mathematics 63(2-3): 143-152 (1987) |
| 27 | | Peter Frankl,
Zoltán Füredi:
Exact solution of some Turán-type problems.
J. Comb. Theory, Ser. A 45(2): 226-262 (1987) |
| 1986 |
|---|
| 26 | | Imre Bárány,
Zoltán Füredi:
Computing the Volume Is Difficult
STOC 1986: 442-447 |
| 25 | | Peter Frankl,
Zoltán Füredi:
Finite projective spaces and intersecting hypergraphs.
Combinatorica 6(4): 335-354 (1986) |
| 24 | | Zoltán Füredi,
Jerrold R. Griggs:
Families of finite sets with minimum shadows.
Combinatorica 6(4): 355-363 (1986) |
| 23 | | Zoltán Füredi:
Random Polytopes in the d-Dimensional Cube.
Discrete & Computational Geometry 1: 315-319 (1986) |
| 22 | | 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) |
| 21 | | Richard P. Anstee,
Zoltán Füredi:
Forbidden submatrices.
Discrete Mathematics 62(3): 225-243 (1986) |
| 20 | | Peter Frankl,
Zoltán Füredi:
Non-trivial intersecting families.
J. Comb. Theory, Ser. A 41(1): 150-153 (1986) |
| 19 | | Peter Frankl,
Zoltán Füredi:
Extremal problems concerning Kneser graphs.
J. Comb. Theory, Ser. B 40(3): 270-284 (1986) |
| 1985 |
|---|
| 18 | | Zoltán Füredi:
Set-systems with three intersections.
Combinatorica 5(1): 27-31 (1985) |
| 17 | | Zoltán Füredi,
Zsolt Tuza:
Hypergraphs without a large star.
Discrete Mathematics 55(3): 317-321 (1985) |
| 16 | | Peter Frankl,
Zoltán Füredi:
Forbidding Just One Intersection.
J. Comb. Theory, Ser. A 39(2): 160-176 (1985) |
| 1984 |
|---|
| 15 | | Zoltán Füredi:
Hypergraphs in which all disjoint pairs have distinct unions.
Combinatorica 4(2): 161-168 (1984) |
| 14 | | Peter Frankl,
Zoltán Füredi:
A new extremal property of Steiner triple-systems.
Discrete Mathematics 48(2-3): 205-212 (1984) |
| 13 | | Peter Frankl,
Zoltán Füredi:
An exact result for 3-graphs.
Discrete Mathematics 50: 323-328 (1984) |
| 12 | | 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) |
| 1983 |
|---|
| 11 | | Peter Frankl,
Zoltán Füredi:
A new generation of the Erdös - Ko - Rado theorem.
Combinatorica 3(3): 341-350 (1983) |
| 10 | | Zoltán Füredi:
On finite set-systems whose every intersection is a Kernel of a star.
Discrete Mathematics 47: 129-132 (1983) |
| 9 | | Imre Bárány,
Zoltán Füredi:
Mental Poker with Three or More Players
Information and Control 59(1-3): 84-93 (1983) |
| 8 | | Zoltán Füredi:
Graphs without quadrilaterals.
J. Comb. Theory, Ser. B 34(2): 187-190 (1983) |
| 1982 |
|---|
| 7 | | Zoltán Füredi:
Set-systems with prescribed cardinalities for pairwise intersections.
Discrete Mathematics 40(1): 53-67 (1982) |
| 6 | | Zoltán Füredi:
An Intersection Problem Whose Extremum Is the Finite Projective Space.
J. Comb. Theory, Ser. A 32(1): 66-72 (1982) |
| 5 | | 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) |
| 1981 |
|---|
| 4 | | Zoltán Füredi:
Maximum degree and fractional matchings in uniform hypergraphs.
Combinatorica 1(2): 155-162 (1981) |
| 3 | | Zoltán Füredi,
János Komlós:
The eigenvalues of random symmetric matrices.
Combinatorica 1(3): 233-241 (1981) |
| 2 | | Peter Frankl,
Zoltán Füredi:
A short proof for a theorem of Harper about Hamming-spheres.
Discrete Mathematics 34(3): 311-313 (1981) |
| 1980 |
|---|
| 1 | | Zoltán Füredi:
On Maximal Intersecting Families of Finite Sets.
J. Comb. Theory, Ser. A 28(3): 282-289 (1980) |
