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
- 2024
[j200]Zoltán Füredi, Alexandr V. Kostochka, Mohit Kumbhat:
Minimal abundant packings and choosability with separation. Des. Codes Cryptogr. 92(12): 4189-4194 (2024)- 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]