Zoltán Füredi

207 papers A* 1Journal 201Unranked 3
YearRankTypeTitle / Venue / Authors
2025 J jnl
Turán Number for Bushes.
Electron. J. Comb.
Alexandr V. Kostochka, Zoltán Füredi
2024 J jnl
Minimal abundant packings and choosability with separation.
Des. Codes Cryptogr.
Zoltán Füredi, Alexandr V. Kostochka, Mohit Kumbhat
2023 J jnl
An Upper Bound on the Size of Sidon Sets.
Am. Math. Mon.
József Balogh, Zoltán Füredi, Souktik Roy
2023 J jnl
Extremal Problems for Hypergraph Blowups of Trees.
SIAM J. Discret. Math.
Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
2023 J jnl
Induced Turán problems and traces of hypergraphs.
Eur. J. Comb.
Zoltán Füredi, Ruth Luo
2023 J jnl
Problems and results on 1-cross-intersecting set pair systems.
Comb. Probab. Comput.
Zoltán Füredi, András Gyárfás, Zoltán Király
2022 J jnl
Extremal problems for pairs of triangles.
J. Comb. Theory B
Zoltán Füredi, Dhruv Mubayi, Jason O'Neill, Jacques Verstraëte
2022 J jnl
Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition.
SIAM J. Discret. Math.
Zoltán Füredi, Yi Zhao
2022 J jnl
Turán number of special four cycles in triple systems.
Discret. Math.
Zoltán Füredi, András Gyárfás, Attila Sali
2021 J jnl
An upper bound on the size of Sidon sets.
CoRR
József Balogh, Zoltán Füredi, Souktik Roy
2021 J jnl
Hypergraphs without exponents.
J. Comb. Theory A
Zoltán Füredi, Dániel Gerbner
2021 J jnl
Large Monochromatic Components in Almost Complete Graphs and Bipartite Graphs.
Electron. J. Comb.
Zoltán Füredi, Ruth Luo
2021 J jnl
Partitioning ordered hypergraphs.
J. Comb. Theory A
Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
2020 J jnl
An Extension of Mantel's Theorem to k-Graphs.
Am. Math. Mon.
Zoltán Füredi, András Gyárfás
2020 J jnl
Berge Cycles in Non-Uniform Hypergraphs.
Electron. J. Comb.
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
2020 J jnl
Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2.
Discret. Appl. Math.
Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
2020 J jnl
Ordered and Convex Geometric Trees with Linear Extremal Function.
Discret. Comput. Geom.
Zoltán Füredi, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
2019 J jnl
A variation of a theorem by Pósa.
Discret. Math.
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
2019 J jnl
Avoiding long Berge cycles.
J. Comb. Theory B
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
2019 J jnl
Hypergraphs Not Containing a Tight Tree with a Bounded Trunk.
SIAM J. Discret. Math.
Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
2019 J jnl
List-distinguishing Cartesian products of cliques.
Discret. Math.
Michael Ferrara, Zoltán Füredi, Sogol Jahanbekam, Paul S. Wenger
2019 J jnl
On 2-Connected Hypergraphs with No Long Cycles.
Electron. J. Comb.
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
2018 J jnl
Extensions of a theorem of Erdős on nonhamiltonian graphs.
J. Graph Theory
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
2018 J jnl
Kneser Ranks of Random Graphs and Minimum Difference Representations.
SIAM J. Discret. Math.
Zoltán Füredi, Ida Kantor
2018 J jnl
Stability in the Erdős-Gallai Theorem on cycles and paths, II.
Discret. Math.
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo, Jacques Verstraëte
2017 J jnl
A stability version for a theorem of Erdős on nonhamiltonian graphs.
Discret. Math.
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
2017 J jnl
Kneser ranks of random graphs and minimum difference representations.
Electron. Notes Discret. Math.
Zoltán Füredi, Ida Kantor
2017 J jnl
On 3-uniform hypergraphs without a cycle of a given length.
Discret. Appl. Math.
Zoltán Füredi, Lale özkahya
2017 J jnl
Preface: Levon Khachatrian's legacy in extremal combinatorics.
Discret. Appl. Math.
Zoltán Füredi, Gyula O. H. Katona
2017 J jnl
The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs.
Comb. Probab. Comput.
Zoltán Füredi, Zeinab Maleki
2016 J jnl
List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs.
J. Graph Theory
Zoltán Füredi, Ida Kantor
2016 J jnl
Stability in the Erdős-Gallai Theorems on cycles and paths.
J. Comb. Theory B
Zoltán Füredi, Alexandr V. Kostochka, Jacques Verstraëte
2015 J jnl
A discrete isodiametric result: The Erdős-Ko-Rado theorem for multisets.
Eur. J. Comb.
Zoltán Füredi, Dániel Gerbner, Máté Vizer
2015 J jnl
A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity.
J. Comb. Theory B
Zoltán Füredi
2015 J jnl
Extremal Numbers for Odd Cycles.
Comb. Probab. Comput.
Zoltán Füredi, David S. Gunderson
2014 — ch.
A coding problem for pairs of subsets.
Geometry, Structure and Randomness in Combinatorics
Béla Bollobás, Zoltán Füredi, Ida Kantor, Gyula O. H. Katona, Imre Leader
2014 J jnl
Choosability with Separation of Complete Multipartite Graphs and Hypergraphs.
J. Graph Theory
Zoltán Füredi, Alexandr V. Kostochka, Mohit Kumbhat
2014 J jnl
Exact solution of the hypergraph Turán problem for k-uniform linear paths.
Comb.
Zoltán Füredi, Tao Jiang, Robert Seiver
2014 J jnl
Hypergraph Turán numbers of linear cycles.
J. Comb. Theory A
Zoltán Füredi, Tao Jiang
2014 J jnl
Linear trees in uniform hypergraphs.
Eur. J. Comb.
Zoltán Füredi
2013 J jnl
Cycle-Saturated Graphs with Minimum Number of Edges.
J. Graph Theory
Zoltán Füredi, Younjin Kim
2013 — ch.
Intersection Representations of the Complete Bipartite Graph.
The Mathematics of Paul Erdős II
Zoltán Füredi
2013 J jnl
Large Chromatic Number and Ramsey Graphs.
Graphs Comb.
Csaba Biró, Zoltán Füredi, Sogol Jahanbekam
2013 J jnl
The structure of the typical graphs of given diameter.
Discret. Math.
Zoltán Füredi, Younjin Kim
2012 J jnl
2-Cancellative Hypergraphs and Codes.
Comb. Probab. Comput.
Zoltán Füredi
2012 J jnl
A new short proof of the EKR theorem.
J. Comb. Theory A
Peter Frankl, Zoltán Füredi
2012 J jnl
Large B
SIAM J. Discret. Math.
János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós
2012 J jnl
Optimal Multivalued Shattering.
SIAM J. Discret. Math.
Zoltán Füredi, Attila Sali
2012 J jnl
Some new bounds on partition critical hypergraphs.
Eur. J. Comb.
Zoltán Füredi, Attila Sali
2011 J jnl
Completing partial packings of bipartite graphs.
J. Comb. Theory A
Zoltán Füredi, Ago-Erik Riet, Mykhaylo Tyomkyn
2011 J jnl
Covers for closed curves of length two.
Period. Math. Hung.
Zoltán Füredi, John E. Wetzel
2011 J jnl
Large Bd-free and union-free subfamilies.
Electron. Notes Discret. Math.
János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós
2011 J jnl
Linear paths and trees in uniform hypergraphs.
Electron. Notes Discret. Math.
Zoltán Füredi
2011 J jnl
Minimum Ck-saturated graphs.
Electron. Notes Discret. Math.
Zoltán Füredi, Younjin Kim
2011 J jnl
On even-cycle-free subgraphs of the hypercube.
J. Comb. Theory A
Zoltán Füredi, Lale özkahya
2011 J jnl
Reverse-free codes and permutations.
Electron. Notes Discret. Math.
Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri
2011 J jnl
Unavoidable subhypergraphs: a-clusters.
J. Comb. Theory A
Zoltán Füredi, Lale özkahya
2010 J jnl
On Reverse-Free Codes and Permutations.
SIAM J. Discret. Math.
Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri
2010 J jnl
Tight embeddings of partial quadrilateral packings.
J. Comb. Theory A
Zoltán Füredi, Jenö Lehel
2009 J jnl
List colorings with distinct list sizes, the case of complete bipartite graphs.
Electron. Notes Discret. Math.
Zoltán Füredi, Ida Kantor
2009 J jnl
On 14-Cycle-Free Subgraphs of the Hypercube.
Comb. Probab. Comput.
Zoltán Füredi, Lale özkahya
2009 J jnl
On even-cycle-free subgraphs of the hypercube.
Electron. Notes Discret. Math.
Zoltán Füredi, Lale özkahya
2009 J jnl
Partition Critical Hypergraphs.
Electron. Notes Discret. Math.
Zoltán Füredi, Attila Sali
2009 J jnl
Unavoidable subhypergraphs: a-clusters.
Electron. Notes Discret. Math.
Zoltán Füredi, Lale özkahya
2008 J jnl
Covering the n-space by convex bodies and its chromatic number.
Discret. Math.
Zoltán Füredi, Jeong-Hyun Kang
2008 J jnl
Guest Editors' Foreword.
Discret. Math.
Zoltán Füredi, Ervin Györi, János Pach, Attila Sali
2008 J jnl
Inequalities for the first-fit chromatic number.
J. Graph Theory
Zoltán Füredi, András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow
2008 J jnl
Large convex cones in hypercubes.
Discret. Appl. Math.
Zoltán Füredi, Miklós Ruszinkó
2008 J jnl
Quadruple systems with independent neighborhoods.
J. Comb. Theory A
Zoltán Füredi, Dhruv Mubayi, Oleg Pikhurko
2007 J jnl
Covering a Triangle with Positive and Negative Homothetic Copies.
Discret. Comput. Geom.
Zoltán Füredi
2007 J jnl
Tree representations of graphs.
Eur. J. Comb.
Nancy Eaton, Zoltán Füredi, Alexandr V. Kostochka, Jozef Skokan
2006 J jnl
2-Bases of Quadruples.
Comb. Probab. Comput.
Zoltán Füredi, Gyula O. H. Katona
2006 J jnl
4-Books of three pages.
J. Comb. Theory A
Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits
2006 J jnl
Moments of graphs in monotone families.
J. Graph Theory
Zoltán Füredi, André Kündgen
2006 J jnl
On set systems with a threshold property.
Discret. Math.
Zoltán Füredi, Robert H. Sloan, Ken Takata, György Turán
2005 J jnl
Connected matchings and Hadwiger's conjecture.
Comb. Probab. Comput.
Zoltán Füredi, András Gyárfás, Gábor Simonyi
2005 J jnl
Large Convex Cones in Hypercubes.
Electron. Notes Discret. Math.
Zoltán Füredi, Miklós Ruszinkó
2005 J jnl
Minimum vertex-diameter-2-critical graphs.
J. Graph Theory
Ya-Chen Chen, Zoltán Füredi
2005 J jnl
Nordhaus-Gaddum-type Theorems for decompositions into many parts.
J. Graph Theory
Zoltán Füredi, Alexandr V. Kostochka, Riste Skrekovski, Michael Stiebitz, Douglas B. West
2005 J jnl
Triple Systems Not Containing a Fano Configuration.
Comb. Probab. Comput.
Zoltán Füredi, Miklós Simonovits
2005 J jnl
Two-Part and
SIAM J. Discret. Math.
Péter L. Erdös, Zoltán Füredi, Gyula O. H. Katona
2004 J jnl
Distance graph on Z
Theor. Comput. Sci.
Zoltán Füredi, Jeong-Hyun Kang
2004 J jnl
Extremal set systems with restricted k-wise intersections.
J. Comb. Theory A
Zoltán Füredi, Benny Sudakov
2004 J jnl
Minimal length test vectors for multiple-fault detection.
Theor. Comput. Sci.
Zoltán Füredi, Robert P. Kurshan
2004 J jnl
Multiply intersecting families of sets.
J. Comb. Theory A
Zoltán Füredi, Zsolt Katona
2003 J jnl
Exact Bounds on the Sizes of Covering Codes.
Des. Codes Cryptogr.
Maria Axenovich, Zoltán Füredi
2003 J jnl
The Tura'n Density of the Hypergraph {abc, ade, bde, cde}.
Electron. J. Comb.
Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits
2002 J jnl
Hamiltonian Kneser Graphs.
Comb.
Ya-Chen Chen, Zoltán Füredi
2002 J jnl
On splittable colorings of graphs and hypergraphs.
J. Graph Theory
Zoltán Füredi, Radhika Ramamurthi
2002 J jnl
On the maximum size of (
Discret. Math.
Zoltán Füredi, András Gyárfás, Miklós Ruszinkó
2002 J jnl
Turán problems for integer-weighted graphs.
J. Graph Theory
Zoltán Füredi, André Kündgen
2001 J jnl
Covering Non-uniform Hypergraphs.
J. Comb. Theory B
Endre Boros, Yair Caro, Zoltán Füredi, Raphael Yuster
2001 J jnl
Covering a graph with cuts of minimum total size.
Discret. Math.
Zoltán Füredi, André Kündgen
2001 J jnl
Embedding of graphs in two-irregular graphs.
J. Graph Theory
Maria Axenovich, Zoltán Füredi
2001 J jnl
Maximal t-Critical Linear Hypergraphs.
Graphs Comb.
Zoltán Füredi
2001 J jnl
On the Maximum Size of (p, Q) - free Families.
Electron. Notes Discret. Math.
Zoltán Füredi, András Gyárfás, Miklós Ruszinkó
2001 J jnl
On the lattice diameter of a convex polygon.
Discret. Math.
Imre Bárány, Zoltán Füredi
2001 J jnl
Ramsey Theory and Bandwidth of Graphs.
Graphs Comb.
Zoltán Füredi, Douglas B. West
2000 J jnl
Multiple vertex coverings by specified induced subgraphs.
J. Graph Theory
Zoltán Füredi, Dhruv Mubayi, Douglas B. West
2000 J jnl
On Generalized Ramsey Theory: The Bipartite Case.
J. Comb. Theory B
Maria Axenovich, Zoltán Füredi, Dhruv Mubayi
2000 J jnl
The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane.
J. Comb. Theory B
Dominique de Caen, Zoltán Füredi
1999 J jnl
An Improved Upper Bound of the Rate of Euclidean Superimposed Codes.
IEEE Trans. Inf. Theory
Zoltán Füredi, Miklós Ruszinkó
1999 J jnl
Induced subgraphs of given sizes.
Discret. Math.
Paul Erdös, Zoltán Füredi, Bruce Rothschild, Vera T. Sós
1999 J jnl
Signed Domination in Regular Graphs and Set-Systems.
J. Comb. Theory B
Zoltán Füredi, Dhruv Mubayi
1998 J jnl
Difference Sets and Computability Theory.
Ann. Pure Appl. Log.
Rodney G. Downey, Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel
1998 J jnl
Minimal Oriented Graphs of Diameter 2.
Graphs Comb.
Zoltán Füredi, Peter Horák, Chandra M. Pareek, Xuding Zhu
1998 J jnl
On the Double Competition Number.
Discret. Appl. Math.
Zoltán Füredi
1997 J jnl
Nonexistence of Universal Graphs Without Some Trees.
Comb.
Zoltán Füredi, Péter Komjáth
1997 J jnl
On the existence of countable universal graphs.
J. Graph Theory
Zoltán Füredi, Péter Komjáth
1996 J jnl
An Upper Bound on Zarankiewicz' Problem.
Comb. Probab. Comput.
Zoltán Füredi
1996 J jnl
Difference Sets and Inverting the Difference Operator.
Comb.
Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel
1996 J jnl
New Asymptotics for Bipartite Turán Numbers.
J. Comb. Theory A
Zoltán Füredi
1996 J jnl
On r-Cover-free Families.
J. Comb. Theory A
Zoltán Füredi
1996 J jnl
On the Number of Edges of Quadrilateral-Free Graphs.
J. Comb. Theory, Ser. B
Zoltán Füredi
1996 J jnl
Scrambling permutations and entropy of hypergraphs.
Random Struct. Algorithms
Zoltán Füredi
1995 J jnl
Cross-Intersecting Families of Finite Sets.
J. Comb. Theory A
Zoltán Füredi
1995 J jnl
Extremal Graphs for Intersecting Triangles.
J. Comb. Theory B
Paul Erdös, Zoltán Füredi, Ronald J. Gould, David S. Gunderson
1995 J jnl
Graphs of Prescribed Girth and Bi-Degree.
J. Comb. Theory B
Zoltán Füredi, Felix Lazebnik, Ákos Seress, Vasiliy A. Ustimenko, Andrew J. Woldar
1994 J jnl
Intersecting designs from linear programming and graphs of diameter two.
Discret. Math.
Zoltán Füredi
1994 J jnl
On the Maximum Number of Triangles in Wheel-Free Graphs.
Comb. Probab. Comput.
Zoltán Füredi, Michel X. Goemans, Daniel J. Kleitman
1994 J jnl
Random Ramsey graphs for the four-cycle.
Discret. Math.
Zoltán Füredi
1994 J jnl
The Prison Yard Problem.
Comb.
Zoltán Füredi, Daniel J. Kleitman
1993 J jnl
Covering the Cube by Affine Hyperplanes.
Eur. J. Comb.
Noga Alon, Zoltán Füredi
1993 J jnl
On the fractional matching polytope of a hypergraph.
Comb.
Zoltán Füredi, Jeff Kahn, Paul D. Seymour
1993 J jnl
The grid revisted.
Discret. Math.
Paul Erdös, Zoltán Füredi, János Pach, Imre Z. Ruzsa
1992 J jnl
Davenport-Schinzel theory of matrices.
Discret. Math.
Zoltán Füredi, Péter Hajnal
1992 J jnl
Indecomposable regular graphs and hypergraphs.
Discret. Math.
Zoltán Füredi
1992 J jnl
On zero-trees.
J. Graph Theory
Zoltán Füredi, Daniel J. Kleitman
1992 J jnl
Point Selections and Weak e-Nets for Convex Hulls.
Comb. Probab. Comput.
Noga Alon, Imre Bárány, Zoltán Füredi, Daniel J. Kleitman
1992 J jnl
Sets of vectors with many orthogonal paris.
Graphs Comb.
Zoltán Füredi, Richard P. Stanley
1992 J jnl
Spanning subgraphs of random graphs.
Graphs Comb.
Noga Alon, Zoltán Füredi
1992 J jnl
The maximum number of edges in a minimal graph of diameter 2.
J. Graph Theory
Zoltán Füredi
1992 J jnl
Volumes Spanned by Random Points in the Hypercube.
Random Struct. Algorithms
Martin E. Dyer, Zoltán Füredi, Colin McDiarmid
1991 J jnl
A sharpening of Fisher's inequality.
Discret. Math.
Peter Frankl, Zoltán Füredi
1991 J jnl
Beyond the Erdös-Ko-Rado theorem.
J. Comb. Theory A
Peter Frankl, Zoltán Füredi
1991 J jnl
Covering t-element Sets by Partitions.
Eur. J. Comb.
Zoltán Füredi, András Gyárfás
1991 J jnl
Maximal Independent Subsets in Steiner Systems and in Planar Sets.
SIAM J. Discret. Math.
Zoltán Füredi
1991 J jnl
Midpoints of Diagonals of Convex
SIAM J. Discret. Math.
Paul Erdös, Peter C. Fishburn, Zoltán Füredi
1991 J jnl
On a Turán type problem of Erdös.
Comb.
Zoltán Füredi
1991 J jnl
Saturated r-uniform hypergraphs.
Discret. Math.
Paul Erdös, Zoltán Füredi, Zsolt Tuza
1991 J jnl
The Densest Packing of Equal Circles into a Parallel Strip.
Discret. Comput. Geom.
Zoltán Füredi
1990 J jnl
Competition Graphs and Clique Dimensions.
Random Struct. Algorithms
Zoltán Füredi
1990 J jnl
Covering pairs by
J. Comb. Theory A
Zoltán Füredi
1990 J jnl
Graphs of diameter 3 with the minimum number of edges.
Graphs Comb.
Zoltán Füredi
1990 J jnl
On the number of halving planes.
Comb.
Imre Bárány, Zoltán Füredi, László Lovász
1990 J jnl
Perfect error-correcting databases.
Discret. Appl. Math.
Zoltán Füredi
1990 — conf
Random Volumes in the n-Cube.
Polyhedral Combinatorics
Martin E. Dyer, Zoltán Füredi, Colin McDiarmid
1990 J jnl
Representations of families of triples over
J. Comb. Theory A
Zoltán Füredi, Jerrold R. Griggs, Ron Holzman, Daniel J. Kleitman
1990 — conf
Singularities of Minimal Surfaces and Networks and Related Extremal Problems in Minkowski Space.
Discrete and Computational Geometry
Zoltán Füredi, Jeffrey C. Lagarias, Frank Morgan
1990 J jnl
Sphere coverings of the hypercube with incomparable centers.
Discret. Math.
Zoltán Füredi, Jeff Kahn, Daniel J. Kleitman
1990 J jnl
The maximum number of unit distances in a convex
J. Comb. Theory A
Zoltán Füredi
1989 J jnl
A minimal cutset of the boolean lattice with almost all members.
Graphs Comb.
Zoltán Füredi, Jerrold R. Griggs, Daniel J. Kleitman
1989 J jnl
A projective plane is an outstanding 2-cover.
Discret. Math.
Zoltán Füredi
1989 J jnl
Covering the complete graph by partitions.
Discret. Math.
Zoltán Füredi
1989 J jnl
Extremal problems whose solutions are the blowups of the small witt-designs.
J. Comb. Theory A
Peter Frankl, Zoltán Füredi
1989 J jnl
Legitimate colorings of projective planes.
Graphs Comb.
Noga Alon, Zoltán Füredi
1989 J jnl
Maximal intersecting families and affine regular polygons in
J. Comb. Theory A
Endre Boros, Zoltán Füredi, Jeff Kahn
1989 J jnl
On Representing Sylvester- Gallai Designs.
Discret. Comput. Geom.
Endre Boros, Zoltán Füredi, Leroy M. Kelly
1989 — conf
On the Number of Halving Planes.
SCG
Imre Bárány, Zoltán Füredi, László Lovász
1989 J jnl
Pair Labeelings with Given Distance.
SIAM J. Discret. Math.
Zoltán Füredi, Jerrold R. Griggs, Daniel J. Kleitman
1988 J jnl
Matchings and covers in hypergraphs.
Graphs Comb.
Zoltán Füredi
1988 J jnl
Multicolored lines in a finite geometry.
Discret. Math.
Zoltán Füredi, Ivo G. Rosenberg
1988 J jnl
On induced subgraphs of the cube.
J. Comb. Theory A
Fan R. K. Chung, Zoltán Füredi, Ronald L. Graham, Paul D. Seymour
1988 J jnl
On the Fractional Covering Number of Hypergraphs.
SIAM J. Discret. Math.
Fan R. K. Chung, Zoltán Füredi, M. R. Garey, Ronald L. Graham
1988 J jnl
Rectangular Dissections of a Square.
Eur. J. Comb.
Endre Boros, Zoltán Füredi
1987 J jnl
Bounding one-way differences.
Graphs Comb.
Peter Frankl, Zoltán Füredi, János Pach
1987 J jnl
Computing the Volume is Difficulte.
Discret. Comput. Geom.
Imre Bárány, Zoltán Füredi
1987 J jnl
Exact solution of some Turán-type problems.
J. Comb. Theory A
Peter Frankl, Zoltán Füredi
1987 J jnl
On the kernel of intersecting families.
Graphs Comb.
Noga Alon, Zoltán Füredi
1987 J jnl
Ramsey-Sperner theory.
Discret. Math.
Zoltán Füredi, Jerrold R. Griggs, Andrew M. Odlyzko, James B. Shearer
1987 J jnl
The maximum number of balancing sets.
Graphs Comb.
Zoltán Füredi
1987 J jnl
The number of maximal independent sets in connected graphs.
J. Graph Theory
Zoltán Füredi
1986 J jnl
Coloring graphs with locally few colors.
Discret. Math.
Paul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress
1986 J jnl
Colouring finite incidence structures.
Graphs Comb.
J. Csima, Zoltán Füredi
1986 A* conf
Computing the Volume Is Difficult
STOC
Imre Bárány, Zoltán Füredi
1986 J jnl
Extremal problems concerning Kneser graphs.
J. Comb. Theory B
Peter Frankl, Zoltán Füredi
1986 J jnl
Families of finite sets with minimum shadows.
Comb.
Zoltán Füredi, Jerrold R. Griggs
1986 J jnl
Finite projective spaces and intersecting hypergraphs.
Comb.
Peter Frankl, Zoltán Füredi
1986 J jnl
Forbidden submatrices.
Discret. Math.
Richard P. Anstee, Zoltán Füredi
1986 J jnl
Non-trivial intersecting families.
J. Comb. Theory A
Peter Frankl, Zoltán Füredi
1986 J jnl
Random Polytopes in the d-Dimensional Cube.
Discret. Comput. Geom.
Zoltán Füredi
1986 J jnl
The chromatic index of simple hypergraphs.
Graphs Comb.
Zoltán Füredi
1985 J jnl
A Ramsey-Sperner theorem.
Graphs Comb.
Zoltán Füredi
1985 J jnl
Forbidding Just One Intersection.
J. Comb. Theory A
Peter Frankl, Zoltán Füredi
1985 J jnl
Hypergraphs without a large star.
Discret. Math.
Zoltán Füredi, Zsolt Tuza
1985 J jnl
Minimum matrix representation of closure operations.
Discret. Appl. Math.
János Demetrovics, Zoltán Füredi, Gyula O. H. Katona
1985 J jnl
Separating Pairs of Points by Standard Boxes.
Eur. J. Comb.
Noga Alon, Zoltán Füredi, Meir Katchalski
1985 J jnl
Set-systems with three intersections.
Comb.
Zoltán Füredi
1984 J jnl
A new extremal property of Steiner triple-systems.
Discret. Math.
Peter Frankl, Zoltán Füredi
1984 J jnl
An exact result for 3-graphs.
Discret. Math.
Peter Frankl, Zoltán Füredi
1984 J jnl
Geometrical Solution of an Intersection Problem for Two Hypergraphs.
Eur. J. Comb.
Zoltán Füredi
1984 J jnl
Hypergraphs in which all disjoint pairs have distinct unions.
Comb.
Zoltán Füredi
1984 J jnl
On Hypergraphs without Two Edges Intersecting in a Given Number of Vertices.
J. Comb. Theory A
Peter Frankl, Zoltán Füredi
1984 J jnl
Union-free Hypergraphs and Probability Theory.
Eur. J. Comb.
Peter Frankl, Zoltán Füredi
1983 J jnl
A new generation of the Erdös - Ko - Rado theorem.
Comb.
Peter Frankl, Zoltán Füredi
1983 J jnl
Graphs without quadrilaterals.
J. Comb. Theory B
Zoltán Füredi
1983 J jnl
Mental Poker with Three or More Players
Inf. Control.
Imre Bárány, Zoltán Füredi
1983 J jnl
On finite set-systems whose every intersection is a Kernel of a star.
Discret. Math.
Zoltán Füredi
1982 J jnl
An Intersection Problem Whose Extremum Is the Finite Projective Space.
J. Comb. Theory A
Zoltán Füredi
1982 J jnl
Families of Finite Sets in Which No Set Is Covered by the Union of Two Others.
J. Comb. Theory A
Paul Erdös, Peter Frankl, Zoltán Füredi
1982 J jnl
Set-systems with prescribed cardinalities for pairwise intersections.
Discret. Math.
Zoltán Füredi
1981 J jnl
A short proof for a theorem of Harper about Hamming-spheres.
Discret. Math.
Peter Frankl, Zoltán Füredi
1981 J jnl
Maximum degree and fractional matchings in uniform hypergraphs.
Comb.
Zoltán Füredi
1981 J jnl
The eigenvalues of random symmetric matrices.
Comb.
Zoltán Füredi, János Komlós
1980 J jnl
On Automorphisms of Line-graphs.
Eur. J. Comb.
Péter L. Erdös, Zoltán Füredi
1980 J jnl
On Maximal Intersecting Families of Finite Sets.
J. Comb. Theory A
Zoltán Füredi
1980 J jnl
The Erdös-Ko-Rado Theorem for Integer Sequences.
SIAM J. Algebraic Discret. Methods
Peter Frankl, Zoltán Füredi