default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZoltán Füredi
Person information
- affiliation: Alfréd Rényi Institute of Mathematics, Hungary
- award (2018): Széchenyi Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j199]Zoltán Füredi, András Gyárfás, Zoltán Király:
Problems and results on 1-cross-intersecting set pair systems. Comb. Probab. Comput. 32(4): 691-702 (2023)- [j198]Zoltán Füredi, Ruth Luo
:
Induced Turán problems and traces of hypergraphs. Eur. J. Comb. 111: 103692 (2023) - [j197]Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Extremal Problems for Hypergraph Blowups of Trees. SIAM J. Discret. Math. 37(4): 2397-2416 (2023) - [j196]József Balogh, Zoltán Füredi, Souktik Roy:
An Upper Bound on the Size of Sidon Sets. Am. Math. Mon. 130(5): 437-445 (2023) - 2022
- [j195]Zoltán Füredi, András Gyárfás, Attila Sali:
Turán number of special four cycles in triple systems. Discret. Math. 345(1): 112667 (2022) - [j194]Zoltán Füredi, Dhruv Mubayi, Jason O'Neill, Jacques Verstraëte:
Extremal problems for pairs of triangles. J. Comb. Theory B 155: 83-110 (2022) - [j193]Zoltán Füredi, Yi Zhao:
Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition. SIAM J. Discret. Math. 36(4): 2523-2533 (2022) - 2021
- [j192]Zoltán Füredi, Ruth Luo:
Large Monochromatic Components in Almost Complete Graphs and Bipartite Graphs. Electron. J. Comb. 28(2): 2 (2021) - [j191]Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Partitioning ordered hypergraphs. J. Comb. Theory A 177: 105300 (2021) - [j190]Zoltán Füredi, Dániel Gerbner:
Hypergraphs without exponents. J. Comb. Theory A 184: 105517 (2021) - [i1]József Balogh, Zoltán Füredi, Souktik Roy:
An upper bound on the size of Sidon sets. CoRR abs/2103.15850 (2021) - 2020
- [j189]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo:
Berge Cycles in Non-Uniform Hypergraphs. Electron. J. Comb. 27(3): 3 (2020) - [j188]Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2. Discret. Appl. Math. 276: 50-59 (2020) - [j187]Zoltán Füredi, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Ordered and Convex Geometric Trees with Linear Extremal Function. Discret. Comput. Geom. 64(2): 324-338 (2020) - [j186]Zoltán Füredi, András Gyárfás:
An Extension of Mantel's Theorem to k-Graphs. Am. Math. Mon. 127(3): 263-268 (2020)
2010 – 2019
- 2019
- [j185]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo:
On 2-Connected Hypergraphs with No Long Cycles. Electron. J. Comb. 26(4): 4 (2019) - [j184]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo:
A variation of a theorem by Pósa. Discret. Math. 342(7): 1919-1923 (2019) - [j183]Michael Ferrara, Zoltán Füredi, Sogol Jahanbekam, Paul S. Wenger:
List-distinguishing Cartesian products of cliques. Discret. Math. 342(7): 2012-2022 (2019) - [j182]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo:
Avoiding long Berge cycles. J. Comb. Theory B 137: 55-64 (2019) - [j181]Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte:
Hypergraphs Not Containing a Tight Tree with a Bounded Trunk. SIAM J. Discret. Math. 33(2): 862-873 (2019) - 2018
- [j180]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo, Jacques Verstraëte:
Stability in the Erdős-Gallai Theorem on cycles and paths, II. Discret. Math. 341(5): 1253-1263 (2018) - [j179]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo:
Extensions of a theorem of Erdős on nonhamiltonian graphs. J. Graph Theory 89(2): 176-193 (2018) - [j178]Zoltán Füredi, Ida Kantor:
Kneser Ranks of Random Graphs and Minimum Difference Representations. SIAM J. Discret. Math. 32(2): 1016-1028 (2018) - 2017
- [j177]Zoltán Füredi, Zeinab Maleki:
The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs. Comb. Probab. Comput. 26(4): 525-535 (2017) - [j176]Zoltán Füredi, Gyula O. H. Katona:
Preface: Levon Khachatrian's legacy in extremal combinatorics. Discret. Appl. Math. 216: 483-488 (2017) - [j175]Zoltán Füredi, Lale Özkahya:
On 3-uniform hypergraphs without a cycle of a given length. Discret. Appl. Math. 216: 582-588 (2017) - [j174]Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo:
A stability version for a theorem of Erdős on nonhamiltonian graphs. Discret. Math. 340(11): 2688-2690 (2017) - [j173]Zoltán Füredi, Ida Kantor:
Kneser ranks of random graphs and minimum difference representations. Electron. Notes Discret. Math. 61: 499-503 (2017) - 2016
- [j172]Zoltán Füredi, Alexandr V. Kostochka, Jacques Verstraëte:
Stability in the Erdős-Gallai Theorems on cycles and paths. J. Comb. Theory B 121: 197-228 (2016) - [j171]Zoltán Füredi, Ida Kantor:
List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs. J. Graph Theory 82(2): 218-227 (2016) - 2015
- [j170]Zoltán Füredi, David S. Gunderson:
Extremal Numbers for Odd Cycles. Comb. Probab. Comput. 24(4): 641-645 (2015) - [j169]Zoltán Füredi, Dániel Gerbner, Máté Vizer:
A discrete isodiametric result: The Erdős-Ko-Rado theorem for multisets. Eur. J. Comb. 48: 224-233 (2015) - [j168]Zoltán Füredi:
A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity. J. Comb. Theory B 115: 66-71 (2015) - 2014
- [j167]Zoltán Füredi, Tao Jiang, Robert Seiver:
Exact solution of the hypergraph Turán problem for k-uniform linear paths. Comb. 34(3): 299-322 (2014) - [j166]Zoltán Füredi:
Linear trees in uniform hypergraphs. Eur. J. Comb. 35: 264-272 (2014) - [j165]Zoltán Füredi, Tao Jiang:
Hypergraph Turán numbers of linear cycles. J. Comb. Theory A 123(1): 252-270 (2014) - [j164]Zoltán Füredi, Alexandr V. Kostochka, Mohit Kumbhat:
Choosability with Separation of Complete Multipartite Graphs and Hypergraphs. J. Graph Theory 76(2): 129-137 (2014) - [p2]Béla Bollobás, Zoltán Füredi, Ida Kantor, Gyula O. H. Katona, Imre Leader:
A coding problem for pairs of subsets. Geometry, Structure and Randomness in Combinatorics 2014: 47-59 - 2013
- [j163]Zoltán Füredi, Younjin Kim:
The structure of the typical graphs of given diameter. Discret. Math. 313(2): 155-163 (2013) - [j162]Csaba Biró, Zoltán Füredi, Sogol Jahanbekam:
Large Chromatic Number and Ramsey Graphs. Graphs Comb. 29(5): 1183-1191 (2013) - [j161]Zoltán Füredi, Younjin Kim:
Cycle-Saturated Graphs with Minimum Number of Edges. J. Graph Theory 73(2): 203-215 (2013) - [p1]Zoltán Füredi:
Intersection Representations of the Complete Bipartite Graph. The Mathematics of Paul Erdős II 2013: 127-134 - 2012
- [j160]Zoltán Füredi:
2-Cancellative Hypergraphs and Codes. Comb. Probab. Comput. 21(1-2): 159-177 (2012) - [j159]Zoltán Füredi, Attila Sali:
Some new bounds on partition critical hypergraphs. Eur. J. Comb. 33(5): 844-852 (2012) - [j158]Peter Frankl, Zoltán Füredi:
A new short proof of the EKR theorem. J. Comb. Theory A 119(6): 1388-1390 (2012) - [j157]János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós:
Large Bd-Free and Union-free Subfamilies. SIAM J. Discret. Math. 26(1): 71-76 (2012) - [j156]Zoltán Füredi, Attila Sali:
Optimal Multivalued Shattering. SIAM J. Discret. Math. 26(2): 737-744 (2012) - 2011
- [j155]János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós:
Large Bd-free and union-free subfamilies. Electron. Notes Discret. Math. 38: 101-104 (2011) - [j154]Zoltán Füredi:
Linear paths and trees in uniform hypergraphs. Electron. Notes Discret. Math. 38: 377-382 (2011) - [j153]Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri:
Reverse-free codes and permutations. Electron. Notes Discret. Math. 38: 383-387 (2011) - [j152]Zoltán Füredi, Younjin Kim:
Minimum Ck-saturated graphs. Electron. Notes Discret. Math. 38: 505-510 (2011) - [j151]Zoltán Füredi, Lale Özkahya:
On even-cycle-free subgraphs of the hypercube. J. Comb. Theory A 118(6): 1816-1819 (2011) - [j150]Zoltán Füredi, Lale Özkahya:
Unavoidable subhypergraphs: a-clusters. J. Comb. Theory A 118(8): 2246-2256 (2011) - [j149]Zoltán Füredi, Ago-Erik Riet, Mykhaylo Tyomkyn:
Completing partial packings of bipartite graphs. J. Comb. Theory A 118(8): 2463-2473 (2011) - [j148]Zoltán Füredi, John E. Wetzel:
Covers for closed curves of length two. Period. Math. Hung. 63(1): 1-17 (2011) - 2010
- [j147]Zoltán Füredi, Jenö Lehel:
Tight embeddings of partial quadrilateral packings. J. Comb. Theory A 117(4): 466-474 (2010) - [j146]Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri:
On Reverse-Free Codes and Permutations. SIAM J. Discret. Math. 24(3): 964-978 (2010)
2000 – 2009
- 2009
- [j145]Zoltán Füredi, Lale Özkahya:
On 14-Cycle-Free Subgraphs of the Hypercube. Comb. Probab. Comput. 18(5): 725-729 (2009) - [j144]Zoltán Füredi, Lale Özkahya:
Unavoidable subhypergraphs: a-clusters. Electron. Notes Discret. Math. 34: 63-67 (2009) - [j143]Zoltán Füredi, Ida Kantor:
List colorings with distinct list sizes, the case of complete bipartite graphs. Electron. Notes Discret. Math. 34: 323-327 (2009) - [j142]Zoltán Füredi, Lale Özkahya:
On even-cycle-free subgraphs of the hypercube. Electron. Notes Discret. Math. 34: 515-517 (2009) - [j141]Zoltán Füredi, Attila Sali:
Partition Critical Hypergraphs. Electron. Notes Discret. Math. 34: 573-577 (2009) - 2008
- [j140]Zoltán Füredi, Miklós Ruszinkó:
Large convex cones in hypercubes. Discret. Appl. Math. 156(9): 1536-1541 (2008) - [j139]Zoltán Füredi, Ervin Györi, János Pach, Attila Sali:
Guest Editors' Foreword. Discret. Math. 308(19): 4305 (2008) - [j138]Zoltán Füredi, Jeong-Hyun Kang:
Covering the n-space by convex bodies and its chromatic number. Discret. Math. 308(19): 4495-4500 (2008) - [j137]Zoltán Füredi, Dhruv Mubayi, Oleg Pikhurko:
Quadruple systems with independent neighborhoods. J. Comb. Theory A 115(8): 1552-1560 (2008) - [j136]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. J. Graph Theory 59(1): 75-88 (2008) - 2007
- [j135]Zoltán Füredi:
Covering a Triangle with Positive and Negative Homothetic Copies. Discret. Comput. Geom. 38(2): 273-288 (2007) - [j134]Nancy Eaton, Zoltán Füredi, Alexandr V. Kostochka, Jozef Skokan:
Tree representations of graphs. Eur. J. Comb. 28(4): 1087-1098 (2007) - 2006
- [j133]Zoltán Füredi, Gyula O. H. Katona:
2-Bases of Quadruples. Comb. Probab. Comput. 15(1-2): 131-141 (2006) - [j132]Zoltán Füredi, Robert H. Sloan, Ken Takata, György Turán:
On set systems with a threshold property. Discret. Math. 306(23): 3097-3111 (2006) - [j131]Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits:
4-Books of three pages. J. Comb. Theory A 113(5): 882-891 (2006) - [j130]Zoltán Füredi, André Kündgen:
Moments of graphs in monotone families. J. Graph Theory 51(1): 37-48 (2006) - 2005
- [j129]Zoltán Füredi, András Gyárfás, Gábor Simonyi:
Connected matchings and Hadwiger's conjecture. Comb. Probab. Comput. 14(3): 435-438 (2005) - [j128]Zoltán Füredi, Miklós Simonovits:
Triple Systems Not Containing a Fano Configuration. Comb. Probab. Comput. 14(4): 467-484 (2005) - [j127]Zoltán Füredi, Miklós Ruszinkó:
Large Convex Cones in Hypercubes. Electron. Notes Discret. Math. 21: 283-284 (2005) - [j126]Zoltán Füredi, Alexandr V. Kostochka, Riste Skrekovski, Michael Stiebitz, Douglas B. West:
Nordhaus-Gaddum-type Theorems for decompositions into many parts. J. Graph Theory 50(4): 273-292 (2005) - [j125]Ya-Chen Chen, Zoltán Füredi:
Minimum vertex-diameter-2-critical graphs. J. Graph Theory 50(4): 293-315 (2005) - [j124]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. Discret. Math. 19(2): 489-500 (2005) - 2004
- [j123]Zoltán Füredi, Benny Sudakov:
Extremal set systems with restricted k-wise intersections. J. Comb. Theory A 105(1): 143-159 (2004) - [j122]Zoltán Füredi, Zsolt Katona:
Multiply intersecting families of sets. J. Comb. Theory A 106(2): 315-326 (2004) - [j121]Zoltán Füredi, Robert P. Kurshan:
Minimal length test vectors for multiple-fault detection. Theor. Comput. Sci. 315(1): 191-208 (2004) - [j120]Zoltán Füredi, Jeong-Hyun Kang:
Distance graph on Znwith norm. Theor. Comput. Sci. 319(1-3): 357-366 (2004) - 2003
- [j119]Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits:
The Tura'n Density of the Hypergraph {abc, ade, bde, cde}. Electron. J. Comb. 10 (2003) - [j118]Maria Axenovich, Zoltán Füredi:
Exact Bounds on the Sizes of Covering Codes. Des. Codes Cryptogr. 30(1): 21-38 (2003) - 2002
- [j117]Ya-Chen Chen, Zoltán Füredi:
Hamiltonian Kneser Graphs. Comb. 22(1): 147-149 (2002) - [j116]Zoltán Füredi, András Gyárfás, Miklós Ruszinkó:
On the maximum size of (p, Q)-free families. Discret. Math. 257(2-3): 385-403 (2002) - [j115]Zoltán Füredi, André Kündgen:
Turán problems for integer-weighted graphs. J. Graph Theory 40(4): 195-225 (2002) - [j114]Zoltán Füredi, Radhika Ramamurthi:
On splittable colorings of graphs and hypergraphs. J. Graph Theory 40(4): 226-237 (2002) - 2001
- [j113]Zoltán Füredi, André Kündgen:
Covering a graph with cuts of minimum total size. Discret. Math. 237(1-3): 129-148 (2001) - [j112]Imre Bárány, Zoltán Füredi:
On the lattice diameter of a convex polygon. Discret. Math. 241(1-3): 41-50 (2001) - [j111]Zoltán Füredi, András Gyárfás, Miklós Ruszinkó:
On the Maximum Size of (p, Q) - free Families. Electron. Notes Discret. Math. 10: 247-249 (2001) - [j110]Zoltán Füredi:
Maximal t-Critical Linear Hypergraphs. Graphs Comb. 17(1): 73-78 (2001) - [j109]Zoltán Füredi, Douglas B. West:
Ramsey Theory and Bandwidth of Graphs. Graphs Comb. 17(3): 463-471 (2001) - [j108]Endre Boros, Yair Caro, Zoltán Füredi, Raphael Yuster:
Covering Non-uniform Hypergraphs. J. Comb. Theory B 82(2): 270-284 (2001) - [j107]Maria Axenovich, Zoltán Füredi:
Embedding of graphs in two-irregular graphs. J. Graph Theory 36(2): 75-83 (2001) - 2000
- [j106]Dominique de Caen, Zoltán Füredi:
The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane. J. Comb. Theory B 78(2): 274-276 (2000) - [j105]Maria Axenovich, Zoltán Füredi, Dhruv Mubayi:
On Generalized Ramsey Theory: The Bipartite Case. J. Comb. Theory B 79(1): 66-86 (2000) - [j104]Zoltán Füredi, Dhruv Mubayi, Douglas B. West:
Multiple vertex coverings by specified induced subgraphs. J. Graph Theory 34(2): 180-190 (2000)
1990 – 1999
- 1999
- [j103]Paul Erdös, Zoltán Füredi, Bruce Rothschild, Vera T. Sós:
Induced subgraphs of given sizes. Discret. Math. 200(1-3): 61-77 (1999) - [j102]Zoltán Füredi, Dhruv Mubayi:
Signed Domination in Regular Graphs and Set-Systems. J. Comb. Theory B 76(2): 223-239 (1999) - [j101]Zoltán Füredi, Miklós Ruszinkó:
An Improved Upper Bound of the Rate of Euclidean Superimposed Codes. IEEE Trans. Inf. Theory 45(2): 799-802 (1999) - 1998
- [j100]Rodney G. Downey, Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel:
Difference Sets and Computability Theory. Ann. Pure Appl. Log. 93(1-3): 63-72 (1998) - [j99]Zoltán Füredi:
On the Double Competition Number. Discret. Appl. Math. 82(1-3): 251-255 (1998) - [j98]Zoltán Füredi, Peter Horák, Chandra M. Pareek, Xuding Zhu:
Minimal Oriented Graphs of Diameter 2. Graphs Comb. 14(4): 345-350 (1998) - 1997
- [j97]Zoltán Füredi, Péter Komjáth:
Nonexistence of Universal Graphs Without Some Trees. Comb. 17(2): 163-171 (1997) - [j96]Zoltán Füredi, Péter Komjáth:
On the existence of countable universal graphs. J. Graph Theory 25(1): 53-58 (1997) - 1996
- [j95]Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel:
Difference Sets and Inverting the Difference Operator. Comb. 16(1): 87-106 (1996) - [j94]Zoltán Füredi:
An Upper Bound on Zarankiewicz' Problem. Comb. Probab. Comput. 5: 29-33 (1996) - [j93]Zoltán Füredi:
On the Number of Edges of Quadrilateral-Free Graphs. J. Comb. Theory, Ser. B 68(1): 1-6 (1996) - [j92]Zoltán Füredi:
On r-Cover-free Families. J. Comb. Theory A 73(1): 172-173 (1996) - [j91]Zoltán Füredi:
New Asymptotics for Bipartite Turán Numbers. J. Comb. Theory A 75(1): 141-144 (1996) - [j90]Zoltán Füredi:
Scrambling permutations and entropy of hypergraphs. Random Struct. Algorithms 8(2): 97-104 (1996) - 1995
- [j89]Paul Erdös, Zoltán Füredi, Ronald J. Gould, David S. Gunderson:
Extremal Graphs for Intersecting Triangles. J. Comb. Theory B 64(1): 89-100 (1995) - [j88]Zoltán Füredi, Felix Lazebnik, Ákos Seress, Vasiliy A. Ustimenko, Andrew J. Woldar:
Graphs of Prescribed Girth and Bi-Degree. J. Comb. Theory B 64(2): 228-239 (1995) - [j87]Zoltán Füredi:
Cross-Intersecting Families of Finite Sets. J. Comb. Theory A 72(2): 332-339 (1995) - 1994
- [j86]Zoltán Füredi, Daniel J. Kleitman:
The Prison Yard Problem. Comb. 14(3): 287-300 (1994) - [j85]Zoltán Füredi, Michel X. Goemans, Daniel J. Kleitman:
On the Maximum Number of Triangles in Wheel-Free Graphs. Comb. Probab. Comput. 3: 63-75 (1994) - [j84]Zoltán Füredi:
Random Ramsey graphs for the four-cycle. Discret. Math. 126(1-3): 407-410 (1994) - [j83]Zoltán Füredi:
Intersecting designs from linear programming and graphs of diameter two. Discret. Math. 127(1-3): 187-207 (1994) - 1993
- [j82]Zoltán Füredi, Jeff Kahn, Paul D. Seymour:
On the fractional matching polytope of a hypergraph. Comb. 13(2): 167-180 (1993) - [j81]Paul Erdös, Zoltán Füredi, János Pach, Imre Z. Ruzsa:
The grid revisted. Discret. Math. 111(1-3): 189-196 (1993) - [j80]Noga Alon, Zoltán Füredi:
Covering the Cube by Affine Hyperplanes. Eur. J. Comb. 14(2): 79-83 (1993) - 1992
- [j79]Noga Alon, Imre Bárány, Zoltán Füredi, Daniel J. Kleitman:
Point Selections and Weak e-Nets for Convex Hulls. Comb. Probab. Comput. 1: 189-200 (1992) - [j78]Zoltán Füredi:
Indecomposable regular graphs and hypergraphs. Discret. Math. 101(1-3): 59-64 (1992) - [j77]Zoltán Füredi, Péter Hajnal:
Davenport-Schinzel theory of matrices. Discret. Math. 103(3): 233-251 (1992) - [j76]Noga Alon, Zoltán Füredi:
Spanning subgraphs of random graphs. Graphs Comb. 8(1): 91-94 (1992) - [j75]Zoltán Füredi, Richard P. Stanley:
Sets of vectors with many orthogonal paris. Graphs Comb. 8(4): 391-394 (1992) - [j74]Zoltán Füredi:
The maximum number of edges in a minimal graph of diameter 2. J. Graph Theory 16(1): 81-98 (1992) - [j73]Zoltán Füredi, Daniel J. Kleitman:
On zero-trees. J. Graph Theory 16(2): 107-120 (1992) - [j72]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
- [j71]Zoltán Füredi:
On a Turán type problem of Erdös. Comb. 11(1): 75-79 (1991) - [j70]Zoltán Füredi:
The Densest Packing of Equal Circles into a Parallel Strip. Discret. Comput. Geom. 6: 95-106 (1991) - [j69]Peter Frankl, Zoltán Füredi:
A sharpening of Fisher's inequality. Discret. Math. 90(1): 103-107 (1991) - [j68]Paul Erdös, Zoltán Füredi, Zsolt Tuza:
Saturated r-uniform hypergraphs. Discret. Math. 98(2): 95-104 (1991) - [j67]Zoltán Füredi, András Gyárfás:
Covering t-element Sets by Partitions. Eur. J. Comb. 12(6): 483-489 (1991) - [j66]Peter Frankl, Zoltán Füredi:
Beyond the Erdös-Ko-Rado theorem. J. Comb. Theory A 56(2): 182-194 (1991) - [j65]Zoltán Füredi:
Maximal Independent Subsets in Steiner Systems and in Planar Sets. SIAM J. Discret. Math. 4(2): 196-199 (1991) - [j64]Paul Erdös, Peter C. Fishburn, Zoltán Füredi:
Midpoints of Diagonals of Convex n-GONS. SIAM J. Discret. Math. 4(3): 329-341 (1991) - 1990
- [j63]Imre Bárány, Zoltán Füredi, László Lovász:
On the number of halving planes. Comb. 10(2): 175-183 (1990) - [j62]Zoltán Füredi:
Perfect error-correcting databases. Discret. Appl. Math. 28(2): 171-176 (1990) - [j61]Zoltán Füredi, Jeff Kahn, Daniel J. Kleitman:
Sphere coverings of the hypercube with incomparable centers. Discret. Math. 83(1): 129-134 (1990) - [j60]Zoltán Füredi:
Graphs of diameter 3 with the minimum number of edges. Graphs Comb. 6(4): 333-337 (1990) - [j59]Zoltán Füredi, Jerrold R. Griggs, Ron Holzman, Daniel J. Kleitman:
Representations of families of triples over GF(2). J. Comb. Theory A 53(2): 306-315 (1990) - [j58]Zoltán Füredi:
Covering pairs by q2 + q + 1 sets. J. Comb. Theory A 54(2): 248-271 (1990) - [j57]Zoltán Füredi:
The maximum number of unit distances in a convex n-gon. J. Comb. Theory A 55(2): 316-320 (1990) - [j56]Zoltán Füredi:
Competition Graphs and Clique Dimensions. Random Struct. Algorithms 1(2): 183-190 (1990) - [c4]Martin E. Dyer, Zoltán Füredi, Colin McDiarmid:
Random Volumes in the n-Cube. Polyhedral Combinatorics 1990: 33-38 - [c3]Zoltán Füredi, Jeffrey C. Lagarias, Frank Morgan:
Singularities of Minimal Surfaces and Networks and Related Extremal Problems in Minkowski Space. Discrete and Computational Geometry 1990: 95-110
1980 – 1989
- 1989
- [j55]Endre Boros, Zoltán Füredi, Leroy M. Kelly:
On Representing Sylvester- Gallai Designs. Discret. Comput. Geom. 4: 345-348 (1989) - [j54]Zoltán Füredi:
A projective plane is an outstanding 2-cover. Discret. Math. 74(3): 321-324 (1989) - [j53]Zoltán Füredi:
Covering the complete graph by partitions. Discret. Math. 75(1-3): 217-226 (1989) - [j52]Noga Alon, Zoltán Füredi:
Legitimate colorings of projective planes. Graphs Comb. 5(1): 95-106 (1989) - [j51]Zoltán Füredi, Jerrold R. Griggs, Daniel J. Kleitman:
A minimal cutset of the boolean lattice with almost all members. Graphs Comb. 5(1): 327-332 (1989) - [j50]Endre Boros, Zoltán Füredi, Jeff Kahn:
Maximal intersecting families and affine regular polygons in PG(2, q). J. Comb. Theory A 52(1): 1-9 (1989) - [j49]Peter Frankl, Zoltán Füredi:
Extremal problems whose solutions are the blowups of the small witt-designs. J. Comb. Theory A 52(1): 129-147 (1989) - [j48]Zoltán Füredi, Jerrold R. Griggs, Daniel J. Kleitman:
Pair Labeelings with Given Distance. SIAM J. Discret. Math. 2(4): 491-499 (1989) - [c2]Imre Bárány, Zoltán Füredi, László Lovász:
On the Number of Halving Planes. SCG 1989: 140-144 - 1988
- [j47]Zoltán Füredi, Ivo G. Rosenberg:
Multicolored lines in a finite geometry. Discret. Math. 71(2): 149-163 (1988) - [j46]Endre Boros, Zoltán Füredi:
Rectangular Dissections of a Square. Eur. J. Comb. 9(3): 271-280 (1988) - [j45]Zoltán Füredi:
Matchings and covers in hypergraphs. Graphs Comb. 4(1): 115-206 (1988) - [j44]Fan R. K. Chung, Zoltán Füredi, Ronald L. Graham, Paul D. Seymour:
On induced subgraphs of the cube. J. Comb. Theory A 49(1): 180-187 (1988) - [j43]Fan R. K. Chung, Zoltán Füredi, M. R. Garey, Ronald L. Graham:
On the Fractional Covering Number of Hypergraphs. SIAM J. Discret. Math. 1(1): 45-49 (1988) - 1987
- [j42]Imre Bárány, Zoltán Füredi:
Computing the Volume is Difficulte. Discret. Comput. Geom. 2: 319-326 (1987) - [j41]Zoltán Füredi, Jerrold R. Griggs, Andrew M. Odlyzko, James B. Shearer:
Ramsey-Sperner theory. Discret. Math. 63(2-3): 143-152 (1987) - [j40]Noga Alon, Zoltán Füredi:
On the kernel of intersecting families. Graphs Comb. 3(1): 91-94 (1987) - [j39]Zoltán Füredi:
The maximum number of balancing sets. Graphs Comb. 3(1): 251-254 (1987) - [j38]Peter Frankl, Zoltán Füredi, János Pach:
Bounding one-way differences. Graphs Comb. 3(1): 341-347 (1987) - [j37]Peter Frankl, Zoltán Füredi:
Exact solution of some Turán-type problems. J. Comb. Theory A 45(2): 226-262 (1987) - [j36]Zoltán Füredi:
The number of maximal independent sets in connected graphs. J. Graph Theory 11(4): 463-470 (1987) - 1986
- [j35]Peter Frankl, Zoltán Füredi:
Finite projective spaces and intersecting hypergraphs. Comb. 6(4): 335-354 (1986) - [j34]Zoltán Füredi, Jerrold R. Griggs:
Families of finite sets with minimum shadows. Comb. 6(4): 355-363 (1986) - [j33]Zoltán Füredi:
Random Polytopes in the d-Dimensional Cube. Discret. Comput. Geom. 1: 315-319 (1986) - [j32]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. Discret. Math. 59(1-2): 21-34 (1986) - [j31]Richard P. Anstee, Zoltán Füredi:
Forbidden submatrices. Discret. Math. 62(3): 225-243 (1986) - [j30]Zoltán Füredi:
t-expansive andt-wise intersecting hypergraphs. Graphs Comb. 2(1): 67-80 (1986) - [j29]Zoltán Füredi:
The chromatic index of simple hypergraphs. Graphs Comb. 2(1): 89-92 (1986) - [j28]J. Csima, Zoltán Füredi:
Colouring finite incidence structures. Graphs Comb. 2(1): 339-346 (1986) - [j27]Peter Frankl, Zoltán Füredi:
Extremal problems concerning Kneser graphs. J. Comb. Theory B 40(3): 270-284 (1986) - [j26]Peter Frankl, Zoltán Füredi:
Non-trivial intersecting families. J. Comb. Theory A 41(1): 150-153 (1986) - [c1]Imre Bárány, Zoltán Füredi:
Computing the Volume Is Difficult. STOC 1986: 442-447 - 1985
- [j25]Zoltán Füredi:
Set-systems with three intersections. Comb. 5(1): 27-31 (1985) - [j24]János Demetrovics, Zoltán Füredi, Gyula O. H. Katona:
Minimum matrix representation of closure operations. Discret. Appl. Math. 11(2): 115-128 (1985) - [j23]Zoltán Füredi, Zsolt Tuza:
Hypergraphs without a large star. Discret. Math. 55(3): 317-321 (1985) - [j22]Noga Alon, Zoltán Füredi, Meir Katchalski:
Separating Pairs of Points by Standard Boxes. Eur. J. Comb. 6(3): 205-210 (1985) - [j21]Zoltán Füredi:
A Ramsey-Sperner theorem. Graphs Comb. 1(1): 51-56 (1985) - [j20]Peter Frankl, Zoltán Füredi:
Forbidding Just One Intersection. J. Comb. Theory A 39(2): 160-176 (1985) - 1984
- [j19]Zoltán Füredi:
Hypergraphs in which all disjoint pairs have distinct unions. Comb. 4(2): 161-168 (1984) - [j18]Peter Frankl, Zoltán Füredi:
A new extremal property of Steiner triple-systems. Discret. Math. 48(2-3): 205-212 (1984) - [j17]Peter Frankl, Zoltán Füredi:
An exact result for 3-graphs. Discret. Math. 50: 323-328 (1984) - [j16]Peter Frankl, Zoltán Füredi:
Union-free Hypergraphs and Probability Theory. Eur. J. Comb. 5(2): 127-131 (1984) - [j15]Zoltán Füredi:
Geometrical Solution of an Intersection Problem for Two Hypergraphs. Eur. J. Comb. 5(2): 133-136 (1984) - [j14]Peter Frankl, Zoltán Füredi:
On Hypergraphs without Two Edges Intersecting in a Given Number of Vertices. J. Comb. Theory A 36(2): 230-236 (1984) - 1983
- [j13]Peter Frankl, Zoltán Füredi:
A new generation of the Erdös - Ko - Rado theorem. Comb. 3(3): 341-350 (1983) - [j12]Zoltán Füredi:
On finite set-systems whose every intersection is a Kernel of a star. Discret. Math. 47: 129-132 (1983) - [j11]Imre Bárány, Zoltán Füredi:
Mental Poker with Three or More Players. Inf. Control. 59(1-3): 84-93 (1983) - [j10]Zoltán Füredi:
Graphs without quadrilaterals. J. Comb. Theory B 34(2): 187-190 (1983) - 1982
- [j9]Zoltán Füredi:
Set-systems with prescribed cardinalities for pairwise intersections. Discret. Math. 40(1): 53-67 (1982) - [j8]Zoltán Füredi:
An Intersection Problem Whose Extremum Is the Finite Projective Space. J. Comb. Theory A 32(1): 66-72 (1982) - [j7]Paul 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 A 33(2): 158-166 (1982) - 1981
- [j6]Zoltán Füredi:
Maximum degree and fractional matchings in uniform hypergraphs. Comb. 1(2): 155-162 (1981) - [j5]Zoltán Füredi, János Komlós:
The eigenvalues of random symmetric matrices. Comb. 1(3): 233-241 (1981) - [j4]Peter Frankl, Zoltán Füredi:
A short proof for a theorem of Harper about Hamming-spheres. Discret. Math. 34(3): 311-313 (1981) - 1980
- [j3]Péter L. Erdös, Zoltán Füredi:
On Automorphisms of Line-graphs. Eur. J. Comb. 1(4): 341-345 (1980) - [j2]Zoltán Füredi:
On Maximal Intersecting Families of Finite Sets. J. Comb. Theory A 28(3): 282-289 (1980) - [j1]Peter Frankl, Zoltán Füredi:
The Erdös-Ko-Rado Theorem for Integer Sequences. SIAM J. Algebraic Discret. Methods 1(4): 376-381 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
