| Select a publication |
| Show |
Title |
Venue |
Rating |
Date |
|
Zoltán Füredi, Lale Özkahya.
On 14-Cycle-Free Subgraphs of the Hypercube.
|
Combinatorics, Probability Computing 2009, Volume 18 |
 (0)
|
2009 |
|
|
Zoltán Füredi, Miklós Ruszinkó.
Large convex cones in hypercubes.
|
Discrete Applied Mathematics 2008, Volume 156 |
(0)
|
2008 |
|
|
Zoltán Füredi, Jeong-Hyun Kang.
Covering the n-space by convex bodies and its chromatic number.
|
Discrete Mathematics 2008, Volume 308 |
(0)
|
2008 |
|
|
Zoltán Füredi, Ervin Györi, János Pach, Attila Sali.
Guest Editors' Foreword.
|
Discrete Mathematics 2008, Volume 308 |
(0)
|
2008 |
|
|
Zoltán Füredi, Dhruv Mubayi, Oleg Pikhurko.
Quadruple systems with independent neighborhoods.
|
J. Comb. Theory, Ser. A 2008, Volume 115 |
(0)
|
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 2008, Volume 59 |
(0)
|
2008 |
|
|
Zoltán Füredi.
Covering a Triangle with Positive and Negative Homothetic Copies.
|
Discrete Computational Geometry 2007, Volume 38 |
(0)
|
2007 |
|
|
Nancy Eaton, Zoltán Füredi, Alexandr V. Kostochka, Jozef Skokan.
Tree representations of graphs.
|
Eur. J. Comb. 2007, Volume 28 |
(0)
|
2007 |
|
|
Zoltán Füredi, Gyula O. H. Katona.
2-Bases of Quadruples.
|
Combinatorics, Probability Computing 2006, Volume 15 |
(0)
|
2006 |
|
|
Zoltán Füredi, Robert H. Sloan, Ken Takata, György Turán.
On set systems with a threshold property.
|
Discrete Mathematics 2006, Volume 306 |
(0)
|
2006 |
|
|
Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits.
4-Books of three pages.
|
J. Comb. Theory, Ser. A 2006, Volume 113 |
(0)
|
2006 |
|
|
Zoltán Füredi, André Kündgen.
Moments of graphs in monotone families.
|
Journal of Graph Theory 2006, Volume 51 |
(0)
|
2006 |
|
|
Zoltán Füredi, András Gyárfás, Gábor Simonyi.
Connected matchings and Hadwiger's conjecture.
|
Combinatorics, Probability Computing 2005, Volume 14 |
(0)
|
2005 |
|
|
Zoltán Füredi, Miklós Simonovits.
Triple Systems Not Containing a Fano Configuration.
|
Combinatorics, Probability Computing 2005, Volume 14 |
(0)
|
2005 |
|
|
Péter L. Erdös, Zoltán Füredi, Gyula O. H. Katona.
Two-Part and
|
SIAM J. Discrete Math. 2005, Volume 19 |
(0)
|
2005 |
|
|
Ya-Chen Chen, Zoltán Füredi.
Minimum vertex-diameter-2-critical graphs.
|
Journal of Graph Theory 2005, Volume 50 |
(0)
|
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 2005, Volume 50 |
(0)
|
2005 |
|
|
Zoltán Füredi, Miklós Ruszinkó.
Large Convex Cones in Hypercubes.
|
Electronic Notes in Discrete Mathematics 2005, Volume 21 |
(0)
|
2005 |
|
|
Zoltán Füredi, Zsolt Katona.
Multiply intersecting families of sets.
|
J. Comb. Theory, Ser. A 2004, Volume 106 |
(0)
|
2004 |
|
|
Zoltán Füredi, Benny Sudakov.
Extremal set systems with restricted k-wise intersections.
|
J. Comb. Theory, Ser. A 2004, Volume 105 |
(0)
|
2004 |
|
|
Zoltán Füredi, Robert P. Kurshan.
Minimal length test vectors for multiple-fault detection.
|
Theor. Comput. Sci. 2004, Volume 315 |
(0)
|
2004 |
|
|
Zoltán Füredi, Jeong-Hyun Kang.
Distance graph on Z
|
Theor. Comput. Sci. 2004, Volume 319 |
(0)
|
2004 |
|
|
Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits.
The Tura'n Density of the Hypergraph {abc, ade, bde, cde}.
|
Electr. J. Comb. 2003, Volume 10 |
(0)
|
2003 |
|
|
Maria Axenovich, Zoltán Füredi.
Exact Bounds on the Sizes of Covering Codes.
|
Des. Codes Cryptography 2003, Volume 30 |
(0)
|
2003 |
|
|
Ya-Chen Chen, Zoltán Füredi.
Hamiltonian Kneser Graphs.
|
Combinatorica 2002, Volume 22 |
(0)
|
2002 |
|
|
Zoltán Füredi, András Gyárfás, Miklós Ruszinkó.
On the maximum size of (
|
Discrete Mathematics 2002, Volume 257 |
(0)
|
2002 |
|
|
Imre Bárány, Zoltán Füredi.
On the lattice diameter of a convex polygon.
|
Discrete Mathematics 2001, Volume 241 |
(0)
|
2001 |
|
|
Zoltán Füredi, André Kündgen.
Covering a graph with cuts of minimum total size.
|
Discrete Mathematics 2001, Volume 237 |
(0)
|
2001 |
|
|
Zoltán Füredi.
Maximal t-Critical Linear Hypergraphs.
|
Graphs and Combinatorics 2001, Volume 17 |
(0)
|
2001 |
|
|
Zoltán Füredi, Douglas B. West.
Ramsey Theory and Bandwidth of Graphs.
|
Graphs and Combinatorics 2001, Volume 17 |
(0)
|
2001 |
|
|
Endre Boros, Yair Caro, Zoltán Füredi, Raphael Yuster.
Covering Non-uniform Hypergraphs.
|
J. Comb. Theory, Ser. B 2001, Volume 82 |
(0)
|
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 2001, Volume 10 |
(0)
|
2001 |
|
|
Maria Axenovich, Zoltán Füredi, Dhruv Mubayi.
On Generalized Ramsey Theory: The Bipartite Case.
|
J. Comb. Theory, Ser. B 2000, Volume 79 |
(0)
|
2000 |
|
|
Dominique de Caen, Zoltán Füredi.
The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane.
|
J. Comb. Theory, Ser. B 2000, Volume 78 |
(0)
|
2000 |
|
|
Paul Erdös, Zoltán Füredi, Bruce Rothschild, Vera T. Sós.
Induced subgraphs of given sizes.
|
Discrete Mathematics 1999, Volume 200 |
(0)
|
1999 |
|
|
Zoltán Füredi, Dhruv Mubayi.
Signed Domination in Regular Graphs and Set-Systems.
|
J. Comb. Theory, Ser. B 1999, Volume 76 |
(0)
|
1999 |
|
|
Zoltán Füredi, Miklós Ruszinkó.
An Improved Upper Bound of the Rate of Euclidean Superimposed Codes.
|
IEEE Transactions on Information Theory 1999, Volume 45 |
(0)
|
1999 |
|
|
Rodney G. Downey, Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel.
Difference Sets and Computability Theory.
|
Ann. Pure Appl. Logic 1998, Volume 93 |
(0)
|
1998 |
|
|
Zoltán Füredi.
On the Double Competition Number.
|
Discrete Applied Mathematics 1998, Volume 82 |
(0)
|
1998 |
|
|
Zoltán Füredi, Péter Komjáth.
Nonexistence of Universal Graphs Without Some Trees.
|
Combinatorica 1997, Volume 17 |
(0)
|
1997 |
|
|
Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel.
Difference Sets and Inverting the Difference Operator.
|
Combinatorica 1996, Volume 16 |
(0)
|
1996 |
|
|
Zoltán Füredi.
An Upper Bound on Zarankiewicz' Problem.
|
Combinatorics, Probability Computing 1996, Volume 5 |
(0)
|
1996 |
|
|
Zoltán Füredi.
New Asymptotics for Bipartite Turán Numbers.
|
J. Comb. Theory, Ser. A 1996, Volume 75 |
(0)
|
1996 |
|
|
Zoltán Füredi.
On r-Cover-free Families.
|
J. Comb. Theory, Ser. A 1996, Volume 73 |
(0)
|
1996 |
|
|
Zoltán Füredi.
On the Number of Edges of Quadrilateral-Free Graphs.
|
J. Comb. Theory, Ser. B 1996, Volume 68 |
(0)
|
1996 |
|
|
Zoltán Füredi.
Scrambling permutations and entropy of hypergraphs.
|
Random Struct. Algorithms 1996, Volume 8 |
(0)
|
1996 |
|
|
Paul Erdös, Zoltán Füredi, Ronald J. Gould, David S. Gunderson.
Extremal Graphs for Intersecting Triangles.
|
J. Comb. Theory, Ser. B 1995, Volume 64 |
(0)
|
1995 |
|
|
Zoltán Füredi.
Cross-Intersecting Families of Finite Sets.
|
J. Comb. Theory, Ser. A 1995, Volume 72 |
(0)
|
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 1995, Volume 64 |
(0)
|
1995 |
|
|
Zoltán Füredi, Daniel J. Kleitman.
The Prison Yard Problem.
|
Combinatorica 1994, Volume 14 |
(0)
|
1994 |
|
|
Zoltán Füredi, Michel X. Goemans, Daniel J. Kleitman.
On the Maximum Number of Triangles in Wheel-Free Graphs.
|
Combinatorics, Probability Computing 1994, Volume 3 |
(0)
|
1994 |
|
|
Zoltán Füredi.
Intersecting designs from linear programming and graphs of diameter two.
|
Discrete Mathematics 1994, Volume 127 |
(0)
|
1994 |
|
|
Zoltán Füredi, Jeff Kahn, Paul D. Seymour.
On the fractional matching polytope of a hypergraph.
|
Combinatorica 1993, Volume 13 |
(0)
|
1993 |
|
|
Paul Erdös, Zoltán Füredi, János Pach, Imre Z. Ruzsa.
The grid revisted.
|
Discrete Mathematics 1993, Volume 111 |
(0)
|
1993 |
|
|
Noga Alon, Zoltán Füredi.
Covering the Cube by Affine Hyperplanes.
|
Eur. J. Comb. 1993, Volume 14 |
(0)
|
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 1992, Volume 1 |
(0)
|
1992 |
|
|
Zoltán Füredi.
Indecomposable regular graphs and hypergraphs.
|
Discrete Mathematics 1992, Volume 101 |
(0)
|
1992 |
|
|
Zoltán Füredi, Péter Hajnal.
Davenport-Schinzel theory of matrices.
|
Discrete Mathematics 1992, Volume 103 |
(0)
|
1992 |
|
|
Martin E. Dyer, Zoltán Füredi, Colin McDiarmid.
Volumes Spanned by Random Points in the Hypercube.
|
Random Struct. Algorithms 1992, Volume 3 |
(0)
|
1992 |
|
|
Zoltán Füredi.
On a Turán type problem of Erdös.
|
Combinatorica 1991, Volume 11 |
(0)
|
1991 |
|
|
Zoltán Füredi.
The Densest Packing of Equal Circles into a Parallel Strip.
|
Discrete Computational Geometry 1991, Volume 6 |
(0)
|
1991 |
|
|
Peter Frankl, Zoltán Füredi.
A sharpening of Fisher's inequality.
|
Discrete Mathematics 1991, Volume 90 |
(0)
|
1991 |
|
|
Paul Erdös, Zoltán Füredi, Zsolt Tuza.
Saturated r-uniform hypergraphs.
|
Discrete Mathematics 1991, Volume 98 |
(0)
|
1991 |
|
|
Peter Frankl, Zoltán Füredi.
Beyond the Erdös-Ko-Rado theorem.
|
J. Comb. Theory, Ser. A 1991, Volume 56 |
(0)
|
1991 |
|
|
Paul Erdös, Peter C. Fishburn, Zoltán Füredi.
Midpoints of Diagonals of Convex
|
SIAM J. Discrete Math. 1991, Volume 4 |
(0)
|
1991 |
|
|
Zoltán Füredi.
Maximal Independent Subsets in Steiner Systems and in Planar Sets.
|
SIAM J. Discrete Math. 1991, Volume 4 |
(0)
|
1991 |
|
|
Imre Bárány, Zoltán Füredi, László Lovász.
On the number of halving planes.
|
Combinatorica 1990, Volume 10 |
(0)
|
1990 |
|
|
Zoltán Füredi.
Perfect error-correcting databases.
|
Discrete Applied Mathematics 1990, Volume 28 |
(0)
|
1990 |
|
|
Zoltán Füredi, Jeff Kahn, Daniel J. Kleitman.
Sphere coverings of the hypercube with incomparable centers.
|
Discrete Mathematics 1990, Volume 83 |
(0)
|
1990 |
|
|
Zoltán Füredi.
The maximum number of unit distances in a convex
|
J. Comb. Theory, Ser. A 1990, Volume 55 |
(0)
|
1990 |
|
|
Zoltán Füredi.
Covering pairs by
|
J. Comb. Theory, Ser. A 1990, Volume 54 |
(0)
|
1990 |
|
|
Zoltán Füredi, Jerrold R. Griggs, Ron Holzman, Daniel J. Kleitman.
Representations of families of triples over
|
J. Comb. Theory, Ser. A 1990, Volume 53 |
(0)
|
1990 |
|
|
Zoltán Füredi.
Competition Graphs and Clique Dimensions.
|
Random Struct. Algorithms 1990, Volume 1 |
(0)
|
1990 |
|
|
Imre Bárány, Zoltán Füredi, László Lovász.
On the Number of Halving Planes.
|
Symposium on Computational Geometry 1989 |
(0)
|
1989 |
|
|
Endre Boros, Zoltán Füredi, L. M. Kelly.
On Representing Sylvester- Gallai Designs.
|
Discrete Computational Geometry 1989, Volume 4 |
(0)
|
1989 |
|
|
Zoltán Füredi.
A projective plane is an outstanding 2-cover.
|
Discrete Mathematics 1989, Volume 74 |
(0)
|
1989 |
|
|
Zoltán Füredi.
Covering the complete graph by partitions.
|
Discrete Mathematics 1989, Volume 75 |
(0)
|
1989 |
|
|
Endre Boros, Zoltán Füredi, Jeff Kahn.
Maximal intersecting families and affine regular polygons in
|
J. Comb. Theory, Ser. A 1989, Volume 52 |
(0)
|
1989 |
|
|
Peter Frankl, Zoltán Füredi.
Extremal problems whose solutions are the blowups of the small witt-designs.
|
J. Comb. Theory, Ser. A 1989, Volume 52 |
(0)
|
1989 |
|
|
Zoltán Füredi, Jerrold R. Griggs, Daniel J. Kleitman.
Pair Labeelings with Given Distance.
|
SIAM J. Discrete Math. 1989, Volume 2 |
(0)
|
1989 |
|
|
Zoltán Füredi, Ivo G. Rosenberg.
Multicolored lines in a finite geometry.
|
Discrete Mathematics 1988, Volume 71 |
(0)
|
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 1988, Volume 49 |
(0)
|
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. 1988, Volume 1 |
(0)
|
1988 |
|
|
Imre Bárány, Zoltán Füredi.
Computing the Volume is Difficulte.
|
Discrete Computational Geometry 1987, Volume 2 |
(0)
|
1987 |
|
|
Zoltán Füredi, Jerrold R. Griggs, Andrew M. Odlyzko, James B. Shearer.
Ramsey-Sperner theory.
|
Discrete Mathematics 1987, Volume 63 |
(0)
|
1987 |
|
|
Peter Frankl, Zoltán Füredi.
Exact solution of some Turán-type problems.
|
J. Comb. Theory, Ser. A 1987, Volume 45 |
(0)
|
1987 |
|
|
Imre Bárány, Zoltán Füredi.
Computing the Volume Is Difficult
|
Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, 28-30 May 1986, Berkeley, California, USA 1986 |
(0)
|
1986 |
|
|
Peter Frankl, Zoltán Füredi.
Finite projective spaces and intersecting hypergraphs.
|
Combinatorica 1986, Volume 6 |
(0)
|
1986 |
|
|
Zoltán Füredi, Jerrold R. Griggs.
Families of finite sets with minimum shadows.
|
Combinatorica 1986, Volume 6 |
(0)
|
1986 |
|
|
Zoltán Füredi.
Random Polytopes in the d-Dimensional Cube.
|
Discrete Computational Geometry 1986, Volume 1 |
(0)
|
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 1986, Volume 59 |
(0)
|
1986 |
|
|
Richard P. Anstee, Zoltán Füredi.
Forbidden submatrices.
|
Discrete Mathematics 1986, Volume 62 |
(0)
|
1986 |
|
|
Peter Frankl, Zoltán Füredi.
Non-trivial intersecting families.
|
J. Comb. Theory, Ser. A 1986, Volume 41 |
(0)
|
1986 |
|
|
Peter Frankl, Zoltán Füredi.
Extremal problems concerning Kneser graphs.
|
J. Comb. Theory, Ser. B 1986, Volume 40 |
(0)
|
1986 |
|
|
Zoltán Füredi.
Set-systems with three intersections.
|
Combinatorica 1985, Volume 5 |
(0)
|
1985 |
|
|
Zoltán Füredi, Zsolt Tuza.
Hypergraphs without a large star.
|
Discrete Mathematics 1985, Volume 55 |
(0)
|
1985 |
|
|
Peter Frankl, Zoltán Füredi.
Forbidding Just One Intersection.
|
J. Comb. Theory, Ser. A 1985, Volume 39 |
(0)
|
1985 |
|
|
Zoltán Füredi.
Hypergraphs in which all disjoint pairs have distinct unions.
|
Combinatorica 1984, Volume 4 |
(0)
|
1984 |
|
|
Peter Frankl, Zoltán Füredi.
A new extremal property of Steiner triple-systems.
|
Discrete Mathematics 1984, Volume 48 |
(0)
|
1984 |
|
|
Peter Frankl, Zoltán Füredi.
An exact result for 3-graphs.
|
Discrete Mathematics 1984, Volume 50 |
(0)
|
1984 |
99/497