dblp.uni-trier.dewww.uni-trier.de

Zoltán Füredi Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2008
111EEZoltán Füredi, Miklós Ruszinkó: Large convex cones in hypercubes. Discrete Applied Mathematics 156(9): 1536-1541 (2008)
110EEZoltán Füredi, Ervin Györi, János Pach, Attila Sali: Guest Editors' Foreword. Discrete Mathematics 308(19): 4305 (2008)
109EEZoltán Füredi, Jeong-Hyun Kang: Covering the n-space by convex bodies and its chromatic number. Discrete Mathematics 308(19): 4495-4500 (2008)
108EEZoltán Füredi, Dhruv Mubayi, Oleg Pikhurko: Quadruple systems with independent neighborhoods. J. Comb. Theory, Ser. A 115(8): 1552-1560 (2008)
107EEZoltá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
106EEZoltán Füredi: Covering a Triangle with Positive and Negative Homothetic Copies. Discrete & Computational Geometry 38(2): 273-288 (2007)
105EENancy Eaton, Zoltán Füredi, Alexandr V. Kostochka, Jozef Skokan: Tree representations of graphs. Eur. J. Comb. 28(4): 1087-1098 (2007)
2006
104EEZoltán Füredi, Gyula O. H. Katona: 2-Bases of Quadruples. Combinatorics, Probability & Computing 15(1-2): 131-141 (2006)
103EEZoltá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)
102EEZoltán Füredi, Oleg Pikhurko, Miklós Simonovits: 4-Books of three pages. J. Comb. Theory, Ser. A 113(5): 882-891 (2006)
101EEZoltán Füredi, André Kündgen: Moments of graphs in monotone families. Journal of Graph Theory 51(1): 37-48 (2006)
2005
100EEZoltá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)
99EEZoltán Füredi, Miklós Simonovits: Triple Systems Not Containing a Fano Configuration. Combinatorics, Probability & Computing 14(4): 467-484 (2005)
98EEZoltán Füredi, Miklós Ruszinkó: Large Convex Cones in Hypercubes. Electronic Notes in Discrete Mathematics 21: 283-284 (2005)
97EEZoltá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)
96EEYa-Chen Chen, Zoltán Füredi: Minimum vertex-diameter-2-critical graphs. Journal of Graph Theory 50(4): 293-315 (2005)
95EEPé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
94EEZoltán Füredi, Benny Sudakov: Extremal set systems with restricted k-wise intersections. J. Comb. Theory, Ser. A 105(1): 143-159 (2004)
93EEZoltán Füredi, Zsolt Katona: Multiply intersecting families of sets. J. Comb. Theory, Ser. A 106(2): 315-326 (2004)
92EEZoltán Füredi, Robert P. Kurshan: Minimal length test vectors for multiple-fault detection. Theor. Comput. Sci. 315(1): 191-208 (2004)
91EEZoltán Füredi, Jeong-Hyun Kang: Distance graph on Znwith norm. Theor. Comput. Sci. 319(1-3): 357-366 (2004)
2003
90EEMaria Axenovich, Zoltán Füredi: Exact Bounds on the Sizes of Covering Codes. Des. Codes Cryptography 30(1): 21-38 (2003)
89EEZoltá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
88EEYa-Chen Chen, Zoltán Füredi: Hamiltonian Kneser Graphs. Combinatorica 22(1): 147-149 (2002)
87EEZoltá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
86EEZoltán Füredi, André Kündgen: Covering a graph with cuts of minimum total size. Discrete Mathematics 237(1-3): 129-148 (2001)
85EEImre Bárány, Zoltán Füredi: On the lattice diameter of a convex polygon. Discrete Mathematics 241(1-3): 41-50 (2001)
84EEZoltá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)
83EEZoltán Füredi: Maximal t-Critical Linear Hypergraphs. Graphs and Combinatorics 17(1): 73-78 (2001)
82EEZoltán Füredi, Douglas B. West: Ramsey Theory and Bandwidth of Graphs. Graphs and Combinatorics 17(3): 463-471 (2001)
81EEEndre Boros, Yair Caro, Zoltán Füredi, Raphael Yuster: Covering Non-uniform Hypergraphs. J. Comb. Theory, Ser. B 82(2): 270-284 (2001)
2000
80EEDominique 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)
79EEMaria 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
78EEPaul 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)
76EEZoltá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)
74EEZoltá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)
70EEZoltán Füredi: On r-Cover-free Families. J. Comb. Theory, Ser. A 73(1): 172-173 (1996)
69EEZoltán Füredi: New Asymptotics for Bipartite Turán Numbers. J. Comb. Theory, Ser. A 75(1): 141-144 (1996)
68EEZoltá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)
65EEPaul 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)
64EEZoltá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)
61EEZoltá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)
59EEPaul Erdös, Zoltán Füredi, János Pach, Imre Z. Ruzsa: The grid revisted. Discrete Mathematics 111(1-3): 189-196 (1993)
58EENoga 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)
56EEZoltán Füredi: Indecomposable regular graphs and hypergraphs. Discrete Mathematics 101(1-3): 59-64 (1992)
55EEZoltá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)
51EEPeter Frankl, Zoltán Füredi: A sharpening of Fisher's inequality. Discrete Mathematics 90(1): 103-107 (1991)
50EEPaul Erdös, Zoltán Füredi, Zsolt Tuza: Saturated r-uniform hypergraphs. Discrete Mathematics 98(2): 95-104 (1991)
49EEPeter 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)
45EEZoltán Füredi: Perfect error-correcting databases. Discrete Applied Mathematics 28(2): 171-176 (1990)
44EEZoltán Füredi, Jeff Kahn, Daniel J. Kleitman: Sphere coverings of the hypercube with incomparable centers. Discrete Mathematics 83(1): 129-134 (1990)
43EEZoltá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)
42EEZoltán Füredi: Covering pairs by q2 + q + 1 sets. J. Comb. Theory, Ser. A 54(2): 248-271 (1990)
41EEZoltá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
39EEImre 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)
37EEZoltán Füredi: A projective plane is an outstanding 2-cover. Discrete Mathematics 74(3): 321-324 (1989)
36EEZoltán Füredi: Covering the complete graph by partitions. Discrete Mathematics 75(1-3): 217-226 (1989)
35EEEndre 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)
34EEPeter 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
32EEZoltán Füredi, Ivo G. Rosenberg: Multicolored lines in a finite geometry. Discrete Mathematics 71(2): 149-163 (1988)
31EEFan 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)
28EEZoltán Füredi, Jerrold R. Griggs, Andrew M. Odlyzko, James B. Shearer: Ramsey-Sperner theory. Discrete Mathematics 63(2-3): 143-152 (1987)
27EEPeter 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)
22EEPaul 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)
21EERichard P. Anstee, Zoltán Füredi: Forbidden submatrices. Discrete Mathematics 62(3): 225-243 (1986)
20EEPeter Frankl, Zoltán Füredi: Non-trivial intersecting families. J. Comb. Theory, Ser. A 41(1): 150-153 (1986)
19EEPeter 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)
17EEZoltá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)
14EEPeter Frankl, Zoltán Füredi: A new extremal property of Steiner triple-systems. Discrete Mathematics 48(2-3): 205-212 (1984)
13EEPeter 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)
10EEZoltá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)
8EEZoltán Füredi: Graphs without quadrilaterals. J. Comb. Theory, Ser. B 34(2): 187-190 (1983)
1982
7EEZoltá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)
2EEPeter 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)

Coauthor Index

1Noga Alon [57] [58]
2Richard P. Anstee [21]
3Maria Axenovich [79] [90]
4Imre Bárány [9] [26] [29] [39] [46] [57] [85]
5Endre Boros [35] [38] [81]
6Dominique de Caen (D. de Caen) [80]
7Yair Caro [81]
8Ya-Chen Chen [88] [96]
9Fan R. K. Chung (Fan Chung Graham) [30] [31]
10Rodney G. Downey (Rod Downey) [75]
11Martin E. Dyer [54]
12Nancy Eaton [105]
13Paul Erdös [22] [47] [50] [59] [65] [78]
14Péter L. Erdös [5] [95]
15Peter C. Fishburn [47]
16Peter Frankl [2] [5] [11] [12] [13] [14] [16] [19] [20] [25] [27] [34] [49] [51]
17M. R. Garey (Michael R. Garey) [30]
18Michel X. Goemans [62]
19Ronald J. Gould [65]
20Ronald L. Graham [30] [31]
21Jerrold R. Griggs [24] [28] [33] [43]
22David S. Gunderson [65]
23András Gyárfás [84] [87] [100] [107]
24Ervin Györi [110]
25András Hajnal [22]
26Péter Hajnal [55]
27Ron Holzman [43]
28Carl G. Jockusch Jr. [72] [75]
29Jeff Kahn [35] [44] [60]
30Jeong-Hyun Kang [91] [109]
31Gyula O. H. Katona [95] [104]
32Zsolt Katona [93]
33L. M. Kelly [38]
34Daniel J. Kleitman [33] [43] [44] [57] [62] [63]
35Péter Komjáth [22] [73]
36János Komlós [3]
37Alexandr V. Kostochka [97] [105]
38André Kündgen [86] [101]
39Robert P. Kurshan [92]
40Felix Lazebnik [64]
41László Lovász [39] [46]
42Colin McDiarmid (Colin J. H. McDiarmid) [54]
43Dhruv Mubayi [76] [79] [108]
44Andrew M. Odlyzko [28]
45János Pach [59] [110]
46Oleg Pikhurko [89] [102] [108]
47Vojtech Rödl [22]
48Ivo G. Rosenberg [32]
49Bruce Rothschild (B. L. Rothschild) [78]
50Lee A. Rubel [72] [75]
51Miklós Ruszinkó [77] [84] [87] [98] [111]
52Imre Z. Ruzsa [59]
53Attila Sali [110]
54Gábor N. Sárközy [107]
55Stanley M. Selkow [107]
56Ákos Seress [22] [64]
57Paul D. Seymour [31] [60]
58James B. Shearer [28]
59Miklós Simonovits [89] [99] [102]
60Gábor Simonyi [100]
61Jozef Skokan [105]
62Riste Skrekovski [97]
63Robert H. Sloan [103]
64Vera T. Sós [78]
65Michael Stiebitz [97]
66Benny Sudakov [94]
67Ken Takata [103]
68György Turán [103]
69Zsolt Tuza [17] [50]
70Vasiliy A. Ustimenko [64]
71Douglas B. West [82] [97]
72Andrew J. Woldar [64]
73Raphael Yuster [81]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)