Zoltán Füredi

ORCID

Publication Activity (10 Years)

Years Active: 1980-2023
Publications (10 Years): 33

Top Venues

Discret. Math.

SIAM J. Discret. Math.

J. Comb. Theory, Ser. B

Comb. Probab. Comput.

Publications

Zoltán Füredi, Ruth Luo
Induced Turán problems and traces of hypergraphs. Eur. J. Comb. 111 (2023)
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) (2023)
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) (2023)
József Balogh, Zoltán Füredi, Souktik Roy
An Upper Bound on the Size of Sidon Sets. Am. Math. Mon. 130 (5) (2023)
Zoltán Füredi, Yi Zhao
Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition. SIAM J. Discret. Math. 36 (4) (2022)
Zoltán Füredi, Dhruv Mubayi, Jason O'Neill, Jacques Verstraëte
Extremal problems for pairs of triangles. J. Comb. Theory, Ser. B 155 (2022)
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) (2022)
Zoltán Füredi, Tao Jiang, Alexandr V. Kostochka, Dhruv Mubayi, Jacques Verstraëte
Partitioning ordered hypergraphs. J. Comb. Theory, Ser. A 177 (2021)
József Balogh, Zoltán Füredi, Souktik Roy
An upper bound on the size of Sidon sets. CoRR (2021)
Zoltán Füredi, Dániel Gerbner
Hypergraphs without exponents. J. Comb. Theory, Ser. A 184 (2021)
Zoltán Füredi, Ruth Luo
Large Monochromatic Components in Almost Complete Graphs and Bipartite Graphs. Electron. J. Comb. 28 (2) (2021)
Zoltán Füredi, András Gyárfás
An Extension of Mantel's Theorem to k-Graphs. Am. Math. Mon. 127 (3) (2020)
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) (2020)
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
Berge Cycles in Non-Uniform Hypergraphs. Electron. J. Comb. 27 (3) (2020)
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 (2020)
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) (2019)
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
A variation of a theorem by Pósa. Discret. Math. 342 (7) (2019)
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
Avoiding long Berge cycles. J. Comb. Theory, Ser. B 137 (2019)
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
On 2-Connected Hypergraphs with No Long Cycles. Electron. J. Comb. 26 (4) (2019)
Michael Ferrara, Zoltán Füredi, Sogol Jahanbekam, Paul S. Wenger
List-distinguishing Cartesian products of cliques. Discret. Math. 342 (7) (2019)
Zoltán Füredi, Ida Kantor
Kneser Ranks of Random Graphs and Minimum Difference Representations. SIAM J. Discret. Math. 32 (2) (2018)
Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
Extensions of a theorem of Erdős on nonhamiltonian graphs. J. Graph Theory 89 (2) (2018)
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) (2018)
Zoltán Füredi, Gyula O. H. Katona
Preface: Levon Khachatrian's legacy in extremal combinatorics. Discret. Appl. Math. 216 (2017)
Zoltán Füredi, Lale Özkahya
On 3-uniform hypergraphs without a cycle of a given length. Discret. Appl. Math. 216 (2017)
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) (2017)
Zoltán Füredi, Ida Kantor
Kneser ranks of random graphs and minimum difference representations. Electron. Notes Discret. Math. 61 (2017)
Zoltán Füredi, Zeinab Maleki
The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs. Comb. Probab. Comput. 26 (4) (2017)
Zoltán Füredi, Alexandr V. Kostochka, Jacques Verstraëte
Stability in the Erdős-Gallai Theorems on cycles and paths. J. Comb. Theory, Ser. B 121 (2016)
Zoltán Füredi, Ida Kantor
List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs. J. Graph Theory 82 (2) (2016)
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 (2015)
Zoltán Füredi
A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity. J. Comb. Theory, Ser. B 115 (2015)
Zoltán Füredi, David S. Gunderson
Extremal Numbers for Odd Cycles. Comb. Probab. Comput. 24 (4) (2015)
Zoltán Füredi, Alexandr V. Kostochka, Mohit Kumbhat
Choosability with Separation of Complete Multipartite Graphs and Hypergraphs. J. Graph Theory 76 (2) (2014)
Zoltán Füredi, Tao Jiang
Hypergraph Turán numbers of linear cycles. J. Comb. Theory, Ser. A 123 (1) (2014)
Zoltán Füredi
Linear trees in uniform hypergraphs. Eur. J. Comb. 35 (2014)
Zoltán Füredi, Tao Jiang, Robert Seiver
Exact solution of the hypergraph Turán problem for k-uniform linear paths. Comb. 34 (3) (2014)
Csaba Biró, Zoltán Füredi, Sogol Jahanbekam
Large Chromatic Number and Ramsey Graphs. Graphs Comb. 29 (5) (2013)
Zoltán Füredi, Younjin Kim
The structure of the typical graphs of given diameter. Discret. Math. 313 (2) (2013)
Zoltán Füredi, Younjin Kim
Cycle-Saturated Graphs with Minimum Number of Edges. J. Graph Theory 73 (2) (2013)
Zoltán Füredi
2-Cancellative Hypergraphs and Codes. Comb. Probab. Comput. 21 (1-2) (2012)
János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós
-Free and Union-free Subfamilies. SIAM J. Discret. Math. 26 (1) (2012)
Zoltán Füredi, Attila Sali
Some new bounds on partition critical hypergraphs. Eur. J. Comb. 33 (5) (2012)
Peter Frankl, Zoltán Füredi
A new short proof of the EKR theorem. J. Comb. Theory, Ser. A 119 (6) (2012)
Zoltán Füredi, Attila Sali
Optimal Multivalued Shattering. SIAM J. Discret. Math. 26 (2) (2012)
Zoltán Füredi
Linear paths and trees in uniform hypergraphs. Electron. Notes Discret. Math. 38 (2011)
Zoltán Füredi, Ago-Erik Riet, Mykhaylo Tyomkyn
Completing partial packings of bipartite graphs. J. Comb. Theory, Ser. A 118 (8) (2011)
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 (2011)
Zoltán Füredi, Lale Özkahya
Unavoidable subhypergraphs: a-clusters. J. Comb. Theory, Ser. A 118 (8) (2011)
Zoltán Füredi, John E. Wetzel
Covers for closed curves of length two. Period. Math. Hung. 63 (1) (2011)
Zoltán Füredi, Younjin Kim
Minimum Ck-saturated graphs. Electron. Notes Discret. Math. 38 (2011)
Zoltán Füredi, Lale Özkahya
On even-cycle-free subgraphs of the hypercube. J. Comb. Theory, Ser. A 118 (6) (2011)
Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri
Reverse-free codes and permutations. Electron. Notes Discret. Math. 38 (2011)
Zoltán Füredi, Jenö Lehel
Tight embeddings of partial quadrilateral packings. J. Comb. Theory, Ser. A 117 (4) (2010)
Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri
On Reverse-Free Codes and Permutations. SIAM J. Discret. Math. 24 (3) (2010)
Zoltán Füredi, Attila Sali
Partition Critical Hypergraphs. Electron. Notes Discret. Math. 34 (2009)
Zoltán Füredi, Lale Özkahya
Unavoidable subhypergraphs: a-clusters. Electron. Notes Discret. Math. 34 (2009)
Zoltán Füredi, Lale Özkahya
On 14-Cycle-Free Subgraphs of the Hypercube. Comb. Probab. Comput. 18 (5) (2009)
Zoltán Füredi, Lale Özkahya
On even-cycle-free subgraphs of the hypercube. Electron. Notes Discret. Math. 34 (2009)
Zoltán Füredi, Ida Kantor
List colorings with distinct list sizes, the case of complete bipartite graphs. Electron. Notes Discret. Math. 34 (2009)
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) (2008)
Zoltán Füredi, Dhruv Mubayi, Oleg Pikhurko
Quadruple systems with independent neighborhoods. J. Comb. Theory, Ser. A 115 (8) (2008)
Zoltán Füredi, Ervin Györi, János Pach, Attila Sali
Guest Editors' Foreword. Discret. Math. 308 (19) (2008)
Zoltán Füredi, Miklós Ruszinkó
Large convex cones in hypercubes. Discret. Appl. Math. 156 (9) (2008)
Zoltán Füredi, Jeong-Hyun Kang
Covering the n-space by convex bodies and its chromatic number. Discret. Math. 308 (19) (2008)
Nancy Eaton, Zoltán Füredi, Alexandr V. Kostochka, Jozef Skokan
Tree representations of graphs. Eur. J. Comb. 28 (4) (2007)
Zoltán Füredi
Covering a Triangle with Positive and Negative Homothetic Copies. Discret. Comput. Geom. 38 (2) (2007)
Zoltán Füredi, Oleg Pikhurko, Miklós Simonovits
4-Books of three pages. J. Comb. Theory, Ser. A 113 (5) (2006)
Zoltán Füredi, Gyula O. H. Katona
2-Bases of Quadruples. Comb. Probab. Comput. 15 (1-2) (2006)
Zoltán Füredi, Robert H. Sloan, Ken Takata, György Turán
On set systems with a threshold property. Discret. Math. 306 (23) (2006)
Zoltán Füredi, André Kündgen
Moments of graphs in monotone families. J. Graph Theory 51 (1) (2006)
Ya-Chen Chen, Zoltán Füredi
Minimum vertex-diameter-2-critical graphs. J. Graph Theory 50 (4) (2005)
Zoltán Füredi, Miklós Simonovits
Triple Systems Not Containing a Fano Configuration. Comb. Probab. Comput. 14 (4) (2005)
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) (2005)
Zoltán Füredi, Miklós Ruszinkó
Large Convex Cones in Hypercubes. Electron. Notes Discret. Math. 21 (2005)
Péter L. Erdös, Zoltán Füredi, Gyula O. H. Katona
-Sperner Families: New Proofs Using Permutations. SIAM J. Discret. Math. 19 (2) (2005)
Zoltán Füredi, András Gyárfás, Gábor Simonyi
Connected matchings and Hadwiger's conjecture. Comb. Probab. Comput. 14 (3) (2005)
Zoltán Füredi, Benny Sudakov
Extremal set systems with restricted k-wise intersections. J. Comb. Theory, Ser. A 105 (1) (2004)
Zoltán Füredi, Robert P. Kurshan
Minimal length test vectors for multiple-fault detection. Theor. Comput. Sci. 315 (1) (2004)
Zoltán Füredi, Jeong-Hyun Kang
with norm. Theor. Comput. Sci. 319 (1-3) (2004)
Zoltán Füredi, Zsolt Katona
Multiply intersecting families of sets. J. Comb. Theory, Ser. A 106 (2) (2004)
Maria Axenovich, Zoltán Füredi
Exact Bounds on the Sizes of Covering Codes. Des. Codes Cryptogr. 30 (1) (2003)
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)
Zoltán Füredi, Radhika Ramamurthi
On splittable colorings of graphs and hypergraphs. J. Graph Theory 40 (4) (2002)
Ya-Chen Chen, Zoltán Füredi
Hamiltonian Kneser Graphs. Comb. 22 (1) (2002)
Zoltán Füredi, András Gyárfás, Miklós Ruszinkó
)-free families. Discret. Math. 257 (2-3) (2002)
Zoltán Füredi, André Kündgen
Turán problems for integer-weighted graphs. J. Graph Theory 40 (4) (2002)
Zoltán Füredi, Douglas B. West
Ramsey Theory and Bandwidth of Graphs. Graphs Comb. 17 (3) (2001)
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 (2001)
Maria Axenovich, Zoltán Füredi
Embedding of graphs in two-irregular graphs. J. Graph Theory 36 (2) (2001)
Zoltán Füredi
Maximal t-Critical Linear Hypergraphs. Graphs Comb. 17 (1) (2001)
Imre Bárány, Zoltán Füredi
On the lattice diameter of a convex polygon. Discret. Math. 241 (1-3) (2001)
Endre Boros, Yair Caro, Zoltán Füredi, Raphael Yuster
Covering Non-uniform Hypergraphs. J. Comb. Theory, Ser. B 82 (2) (2001)
Zoltán Füredi, André Kündgen
Covering a graph with cuts of minimum total size. Discret. Math. 237 (1-3) (2001)
Zoltán Füredi, Dhruv Mubayi, Douglas B. West
Multiple vertex coverings by specified induced subgraphs. J. Graph Theory 34 (2) (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 78 (2) (2000)
Maria Axenovich, Zoltán Füredi, Dhruv Mubayi
On Generalized Ramsey Theory: The Bipartite Case. J. Comb. Theory, Ser. B 79 (1) (2000)
Zoltán Füredi, Dhruv Mubayi
Signed Domination in Regular Graphs and Set-Systems. J. Comb. Theory, Ser. B 76 (2) (1999)
Paul Erdös, Zoltán Füredi, Bruce Rothschild, Vera T. Sós
Induced subgraphs of given sizes. Discret. Math. 200 (1-3) (1999)
Zoltán Füredi, Miklós Ruszinkó
An Improved Upper Bound of the Rate of Euclidean Superimposed Codes. IEEE Trans. Inf. Theory 45 (2) (1999)

Zoltán Füredi.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Zoltán Füredi