Search the dblp DataBase
Zoltán Füredi :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Imre Bárány , Zoltán Füredi Computing the Volume Is Difficult [Citation Graph (1, 0)][DBLP ] STOC, 1986, pp:442-447 [Conf ] Imre Bárány , Zoltán Füredi , László Lovász On the Number of Halving Planes. [Citation Graph (0, 0)][DBLP ] Symposium on Computational Geometry, 1989, pp:140-144 [Conf ] Rodney G. Downey , Zoltán Füredi , Carl G. Jockusch Jr. , Lee A. Rubel Difference Sets and Computability Theory. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1998, v:93, n:1-3, pp:63-72 [Journal ] Imre Bárány , Zoltán Füredi , László Lovász On the number of halving planes. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1990, v:10, n:2, pp:175-183 [Journal ] Ya-Chen Chen , Zoltán Füredi Hamiltonian Kneser Graphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 2002, v:22, n:1, pp:147-149 [Journal ] Peter Frankl , Zoltán Füredi A new generation of the Erdös - Ko - Rado theorem. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1983, v:3, n:3, pp:341-350 [Journal ] Peter Frankl , Zoltán Füredi Finite projective spaces and intersecting hypergraphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1986, v:6, n:4, pp:335-354 [Journal ] Zoltán Füredi Maximum degree and fractional matchings in uniform hypergraphs. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1981, v:1, n:2, pp:155-162 [Journal ] Zoltán Füredi Hypergraphs in which all disjoint pairs have distinct unions. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1984, v:4, n:2, pp:161-168 [Journal ] Zoltán Füredi Set-systems with three intersections. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1985, v:5, n:1, pp:27-31 [Journal ] Zoltán Füredi On a Turán type problem of Erdös. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1991, v:11, n:1, pp:75-79 [Journal ] Zoltán Füredi , Jerrold R. Griggs Families of finite sets with minimum shadows. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1986, v:6, n:4, pp:355-363 [Journal ] Zoltán Füredi , Carl G. Jockusch Jr. , Lee A. Rubel Difference Sets and Inverting the Difference Operator. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1996, v:16, n:1, pp:87-106 [Journal ] Zoltán Füredi , János Komlós The eigenvalues of random symmetric matrices. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1981, v:1, n:3, pp:233-241 [Journal ] Zoltán Füredi , Daniel J. Kleitman The Prison Yard Problem. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1994, v:14, n:3, pp:287-300 [Journal ] Zoltán Füredi , Péter Komjáth Nonexistence of Universal Graphs Without Some Trees. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1997, v:17, n:2, pp:163-171 [Journal ] Zoltán Füredi , Jeff Kahn , Paul D. Seymour On the fractional matching polytope of a hypergraph. [Citation Graph (0, 0)][DBLP ] Combinatorica, 1993, v:13, n:2, pp:167-180 [Journal ] Zoltán Füredi , Oleg Pikhurko , Miklós Simonovits The Tura'n Density of the Hypergraph {abc, ade, bde, cde}. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2003, v:10, n:, pp:- [Journal ] Noga Alon , Imre Bárány , Zoltán Füredi , Daniel J. Kleitman Point Selections and Weak e-Nets for Convex Hulls. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 1992, v:1, n:, pp:189-200 [Journal ] Zoltán Füredi An Upper Bound on Zarankiewicz' Problem. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:29-33 [Journal ] Zoltán Füredi , Michel X. Goemans , Daniel J. Kleitman On the Maximum Number of Triangles in Wheel-Free Graphs. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 1994, v:3, n:, pp:63-75 [Journal ] Zoltán Füredi , András Gyárfás , Gábor Simonyi Connected matchings and Hadwiger's conjecture. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2005, v:14, n:3, pp:435-438 [Journal ] Zoltán Füredi , Miklós Simonovits Triple Systems Not Containing a Fano Configuration. [Citation Graph (0, 0)][DBLP ] Combinatorics, Probability & Computing, 2005, v:14, n:4, pp:467-484 [Journal ] Zoltán Füredi On the Double Competition Number. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 1998, v:82, n:1-3, pp:251-255 [Journal ] Maria Axenovich , Zoltán Füredi Exact Bounds on the Sizes of Covering Codes. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 2003, v:30, n:1, pp:21-38 [Journal ] Imre Bárány , Zoltán Füredi Computing the Volume is Difficulte. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1987, v:2, n:, pp:319-326 [Journal ] Endre Boros , Zoltán Füredi , L. M. Kelly On Representing Sylvester- Gallai Designs. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1989, v:4, n:, pp:345-348 [Journal ] Zoltán Füredi Random Polytopes in the d-Dimensional Cube. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1986, v:1, n:, pp:315-319 [Journal ] Zoltán Füredi The Densest Packing of Equal Circles into a Parallel Strip. [Citation Graph (0, 0)][DBLP ] Discrete & Computational Geometry, 1991, v:6, n:, pp:95-106 [Journal ] Imre Bárány , Zoltán Füredi On the lattice diameter of a convex polygon. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:241, n:1-3, pp:41-50 [Journal ] Zoltán Füredi , András Gyárfás , Miklós Ruszinkó On the maximum size of (p, Q )-free families. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2002, v:257, n:2-3, pp:385-403 [Journal ] Zoltán Füredi , André Kündgen Covering a graph with cuts of minimum total size. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2001, v:237, n:1-3, pp:129-148 [Journal ] Zoltán Füredi , Robert H. Sloan , Ken Takata , György Turán On set systems with a threshold property. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 2006, v:306, n:23, pp:3097-3111 [Journal ] Noga Alon , Zoltán Füredi Covering the Cube by Affine Hyperplanes. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 1993, v:14, n:2, pp:79-83 [Journal ] Nancy Eaton , Zoltán Füredi , Alexandr V. Kostochka , Jozef Skokan Tree representations of graphs. [Citation Graph (0, 0)][DBLP ] Eur. J. Comb., 2007, v:28, n:4, pp:1087-1098 [Journal ] Zoltán Füredi Maximal t-Critical Linear Hypergraphs. [Citation Graph (0, 0)][DBLP ] Graphs and Combinatorics, 2001, v:17, n:1, pp:73-78 [Journal ] Zoltán Füredi , Douglas B. West Ramsey Theory and Bandwidth of Graphs. [Citation Graph (0, 0)][DBLP ] Graphs and Combinatorics, 2001, v:17, n:3, pp:463-471 [Journal ] Imre Bárány , Zoltán Füredi Mental Poker with Three or More Players [Citation Graph (0, 0)][DBLP ] Information and Control, 1983, v:59, n:1-3, pp:84-93 [Journal ] Maria Axenovich , Zoltán Füredi , Dhruv Mubayi On Generalized Ramsey Theory: The Bipartite Case. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2000, v:79, n:1, pp:66-86 [Journal ] Endre Boros , Yair Caro , Zoltán Füredi , Raphael Yuster Covering Non-uniform Hypergraphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2001, v:82, n:2, pp:270-284 [Journal ] Endre Boros , Zoltán Füredi , Jeff Kahn Maximal intersecting families and affine regular polygons in PG (2, q ). [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1989, v:52, n:1, pp:1-9 [Journal ] Dominique de Caen , Zoltán Füredi The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 2000, v:78, n:2, pp:274-276 [Journal ] Fan R. K. Chung , Zoltán Füredi , Ronald L. Graham , Paul D. Seymour On induced subgraphs of the cube. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1988, v:49, n:1, pp:180-187 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1982, v:33, n:2, pp:158-166 [Journal ] Paul Erdös , Zoltán Füredi , Ronald J. Gould , David S. Gunderson Extremal Graphs for Intersecting Triangles. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1995, v:64, n:1, pp:89-100 [Journal ] Peter Frankl , Zoltán Füredi On Hypergraphs without Two Edges Intersecting in a Given Number of Vertices. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1984, v:36, n:2, pp:230-236 [Journal ] Peter Frankl , Zoltán Füredi Forbidding Just One Intersection. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1985, v:39, n:2, pp:160-176 [Journal ] Peter Frankl , Zoltán Füredi Non-trivial intersecting families. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1986, v:41, n:1, pp:150-153 [Journal ] Peter Frankl , Zoltán Füredi Extremal problems concerning Kneser graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1986, v:40, n:3, pp:270-284 [Journal ] Peter Frankl , Zoltán Füredi Exact solution of some Turán-type problems. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1987, v:45, n:2, pp:226-262 [Journal ] Peter Frankl , Zoltán Füredi Extremal problems whose solutions are the blowups of the small witt-designs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1989, v:52, n:1, pp:129-147 [Journal ] Peter Frankl , Zoltán Füredi Beyond the Erdös-Ko-Rado theorem. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1991, v:56, n:2, pp:182-194 [Journal ] Zoltán Füredi On Maximal Intersecting Families of Finite Sets. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1980, v:28, n:3, pp:282-289 [Journal ] Zoltán Füredi An Intersection Problem Whose Extremum Is the Finite Projective Space. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1982, v:32, n:1, pp:66-72 [Journal ] Zoltán Füredi Graphs without quadrilaterals. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1983, v:34, n:2, pp:187-190 [Journal ] Zoltán Füredi The maximum number of unit distances in a convex n -gon. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1990, v:55, n:2, pp:316-320 [Journal ] Zoltán Füredi Covering pairs by q 2 + q + 1 sets. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1990, v:54, n:2, pp:248-271 [Journal ] Zoltán Füredi Cross-Intersecting Families of Finite Sets. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1995, v:72, n:2, pp:332-339 [Journal ] Zoltán Füredi New Asymptotics for Bipartite Turán Numbers. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1996, v:75, n:1, pp:141-144 [Journal ] Zoltán Füredi On r-Cover-free Families. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1996, v:73, n:1, pp:172-173 [Journal ] Zoltán Füredi On the Number of Edges of Quadrilateral-Free Graphs. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1996, v:68, n:1, pp:1-6 [Journal ] Zoltán Füredi , Jerrold R. Griggs , Ron Holzman , Daniel J. Kleitman Representations of families of triples over GF (2). [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1990, v:53, n:2, pp:306-315 [Journal ] Zoltán Füredi , Zsolt Katona Multiply intersecting families of sets. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 2004, v:106, n:2, pp:315-326 [Journal ] Zoltán Füredi , Felix Lazebnik , Ákos Seress , Vasiliy A. Ustimenko , Andrew J. Woldar Graphs of Prescribed Girth and Bi-Degree. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1995, v:64, n:2, pp:228-239 [Journal ] Zoltán Füredi , Dhruv Mubayi Signed Domination in Regular Graphs and Set-Systems. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1999, v:76, n:2, pp:223-239 [Journal ] Zoltán Füredi , Benny Sudakov Extremal set systems with restricted k-wise intersections. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 2004, v:105, n:1, pp:143-159 [Journal ] Zoltán Füredi , Oleg Pikhurko , Miklós Simonovits 4-Books of three pages. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 2006, v:113, n:5, pp:882-891 [Journal ] Martin E. Dyer , Zoltán Füredi , Colin McDiarmid Volumes Spanned by Random Points in the Hypercube. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1992, v:3, n:1, pp:91-106 [Journal ] Zoltán Füredi Competition Graphs and Clique Dimensions. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1990, v:1, n:2, pp:183-190 [Journal ] Zoltán Füredi Scrambling permutations and entropy of hypergraphs. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 1996, v:8, n:2, pp:97-104 [Journal ] Fan R. K. Chung , Zoltán Füredi , M. R. Garey , Ronald L. Graham On the Fractional Covering Number of Hypergraphs. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1988, v:1, n:1, pp:45-49 [Journal ] Paul Erdös , Peter C. Fishburn , Zoltán Füredi Midpoints of Diagonals of Convex n -GONS. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1991, v:4, n:3, pp:329-341 [Journal ] Péter L. Erdös , Zoltán Füredi , Gyula O. H. Katona Two-Part and k -Sperner Families: New Proofs Using Permutations. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2005, v:19, n:2, pp:489-500 [Journal ] Zoltán Füredi Maximal Independent Subsets in Steiner Systems and in Planar Sets. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1991, v:4, n:2, pp:196-199 [Journal ] Zoltán Füredi , Jerrold R. Griggs , Daniel J. Kleitman Pair Labeelings with Given Distance. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 1989, v:2, n:4, pp:491-499 [Journal ] Zoltán Füredi , Robert P. Kurshan Minimal length test vectors for multiple-fault detection. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:315, n:1, pp:191-208 [Journal ] Zoltán Füredi , Jeong-Hyun Kang Distance graph on Zn with norm. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2004, v:319, n:1-3, pp:357-366 [Journal ] Zoltán Füredi , Miklós Ruszinkó An Improved Upper Bound of the Rate of Euclidean Superimposed Codes. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 1999, v:45, n:2, pp:799-802 [Journal ] Ya-Chen Chen , Zoltán Füredi Minimum vertex-diameter-2-critical graphs. [Citation Graph (0, 0)][DBLP ] Journal of Graph Theory, 2005, v:50, n:4, pp:293-315 [Journal ] Zoltán Füredi , Alexandr V. Kostochka , Riste Skrekovski , Michael Stiebitz , Douglas B. West Nordhaus-Gaddum-type Theorems for decompositions into many parts. [Citation Graph (0, 0)][DBLP ] Journal of Graph Theory, 2005, v:50, n:4, pp:273-292 [Journal ] Zoltán Füredi , André Kündgen Moments of graphs in monotone families. [Citation Graph (0, 0)][DBLP ] Journal of Graph Theory, 2006, v:51, n:1, pp:37-48 [Journal ] Peter Frankl , Zoltán Füredi A short proof for a theorem of Harper about Hamming-spheres. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1981, v:34, n:3, pp:311-313 [Journal ] Zoltán Füredi Set-systems with prescribed cardinalities for pairwise intersections. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1982, v:40, n:1, pp:53-67 [Journal ] Zoltán Füredi , Zsolt Tuza Hypergraphs without a large star. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1985, v:55, n:3, pp:317-321 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1986, v:59, n:1-2, pp:21-34 [Journal ] Zoltán Füredi , Jerrold R. Griggs , Andrew M. Odlyzko , James B. Shearer Ramsey-Sperner theory. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1987, v:63, n:2-3, pp:143-152 [Journal ] Richard P. Anstee , Zoltán Füredi Forbidden submatrices. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1986, v:62, n:3, pp:225-243 [Journal ] Zoltán Füredi On finite set-systems whose every intersection is a Kernel of a star. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1983, v:47, n:, pp:129-132 [Journal ] Peter Frankl , Zoltán Füredi A new extremal property of Steiner triple-systems. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1984, v:48, n:2-3, pp:205-212 [Journal ] Peter Frankl , Zoltán Füredi An exact result for 3-graphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1984, v:50, n:, pp:323-328 [Journal ] Zoltán Füredi , Ivo G. Rosenberg Multicolored lines in a finite geometry. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1988, v:71, n:2, pp:149-163 [Journal ] Zoltán Füredi A projective plane is an outstanding 2-cover. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1989, v:74, n:3, pp:321-324 [Journal ] Zoltán Füredi Covering the complete graph by partitions. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1989, v:75, n:1-3, pp:217-226 [Journal ] Paul Erdös , Zoltán Füredi , Bruce Rothschild , Vera T. Sós Induced subgraphs of given sizes. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1999, v:200, n:1-3, pp:61-77 [Journal ] Zoltán Füredi , Jeff Kahn , Daniel J. Kleitman Sphere coverings of the hypercube with incomparable centers. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1990, v:83, n:1, pp:129-134 [Journal ] Peter Frankl , Zoltán Füredi A sharpening of Fisher's inequality. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1991, v:90, n:1, pp:103-107 [Journal ] Paul Erdös , Zoltán Füredi , Zsolt Tuza Saturated r-uniform hypergraphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1991, v:98, n:2, pp:95-104 [Journal ] Zoltán Füredi Indecomposable regular graphs and hypergraphs. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1992, v:101, n:1-3, pp:59-64 [Journal ] Zoltán Füredi , Péter Hajnal Davenport-Schinzel theory of matrices. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1992, v:103, n:3, pp:233-251 [Journal ] Paul Erdös , Zoltán Füredi , János Pach , Imre Z. Ruzsa The grid revisted. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1993, v:111, n:1-3, pp:189-196 [Journal ] Zoltán Füredi Intersecting designs from linear programming and graphs of diameter two. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1994, v:127, n:1-3, pp:187-207 [Journal ] 2-Bases of Quadruples. [Citation Graph (, )][DBLP ] On 14-Cycle-Free Subgraphs of the Hypercube. [Citation Graph (, )][DBLP ] Large convex cones in hypercubes. [Citation Graph (, )][DBLP ] Perfect error-correcting databases. [Citation Graph (, )][DBLP ] Covering a Triangle with Positive and Negative Homothetic Copies. [Citation Graph (, )][DBLP ] Covering the n-space by convex bodies and its chromatic number. [Citation Graph (, )][DBLP ] Guest Editors' Foreword. [Citation Graph (, )][DBLP ] Search in 0.005secs, Finished in 0.612secs