Zoltán Füredi
#28,267
Most Influential Person Now
Hungarian mathematician
Zoltán Füredi's AcademicInfluence.com Rankings
Zoltán Füredimathematics Degrees
Mathematics
#1388
World Rank
#2299
Historical Rank
Group Theory
#68
World Rank
#86
Historical Rank
Algebra
#120
World Rank
#194
Historical Rank
Measure Theory
#1252
World Rank
#1588
Historical Rank
Download Badge
Mathematics
Zoltán Füredi's Degrees
- PhD Mathematics Eötvös Loránd University
- Masters Mathematics Eötvös Loránd University
Why Is Zoltán Füredi Influential?
(Suggest an Edit or Addition)According to Wikipedia, Zoltán Füredi is a Hungarian mathematician, working in combinatorics, mainly in discrete geometry and extremal combinatorics. He was a student of Gyula O. H. Katona. He is a corresponding member of the Hungarian Academy of Sciences . He is a research professor of the Rényi Mathematical Institute of the Hungarian Academy of Sciences, and a professor at the University of Illinois Urbana-Champaign .
Zoltán Füredi's Published Works
Number of citations in a given year to any of this author's works
Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author
Published Works
- The eigenvalues of random symmetric matrices (1981) (681)
- Families of finite sets in which no set is covered by the union ofr others (1985) (450)
- Computing the volume is difficult (1986) (186)
- Matchings and covers in hypergraphs (1988) (183)
- On r-Cover-free Families (1996) (158)
- New Asymptotics for Bipartite Turán Numbers (1996) (155)
- Families of Finite Sets in Which No Set Is Covered by the Union of Two Others (1982) (155)
- Point Selections and Weak ε-Nets for Convex Hulls (1992) (155)
- A new generalization of the Erdős-Ko-Rado theorem (1983) (152)
- Maximum degree and fractional matchings in uniform hypergraphs (1981) (146)
- Davenport-Schinzel theory of matrices (1992) (146)
- On the number of halving planes (1989) (123)
- An Upper Bound on Zarankiewicz' Problem (1996) (116)
- Extremal problems whose solutions are the blowups of the small witt-designs (1989) (112)
- Graphs without quadrilaterals (1983) (112)
- Exact solution of some Turán-type problems (1987) (98)
- The number of maximal independent sets in connected graphs (1987) (97)
- The maximum number of unit distances in a convex n-gon (1990) (97)
- Forbidding Just One Intersection (1985) (96)
- On the Number of Edges of Quadrilateral-Free Graphs (1996) (95)
- The number of triangles covering the center of an n-set (1984) (94)
- Triple Systems Not Containing a Fano Configuration (2005) (94)
- Surveys in Combinatorics, 1991: “Turán Type Problems” (1991) (92)
- An exact result for 3-graphs (1984) (90)
- Covering the Cube by Affine Hyperplanes (1993) (87)
- Shadows of colored complexes. (1988) (86)
- The Greatest Angle Among n Points in the d- Dimensional Euclidean Space (1983) (85)
- The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane (2000) (83)
- Extremal Graphs for Intersecting Triangles (1995) (74)
- Arrangements of lines with a large number of triangles (1984) (72)
- On induced subgraphs of the cube (1988) (71)
- The maximum number of edges in a minimal graph of diameter 2 (1992) (70)
- A short proof for a theorem of Harper about Hamming-spheres (1981) (67)
- Empty Simplices in Euclidean Space (1987) (67)
- On the best constant for the Besicovitch covering theorem (1994) (67)
- Coloring graphs with locally few colors (1986) (65)
- Approximation of the sphere by polytopes having few vertices (1988) (62)
- On the Turán number for the hexagon (2006) (62)
- Exact solution of the hypergraph Turán problem for k-uniform linear paths (2011) (55)
- Non-trivial intersecting families (1986) (55)
- On finite set-systems whose every intersection is a Kernel of a star (1983) (54)
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity (2015) (54)
- On the fractional matching polytope of a hypergraph (1993) (53)
- Hypergraph Turán numbers of linear cycles (2013) (50)
- Union-free Hypergraphs and Probability Theory (1984) (50)
- On Triple Systems with Independent Neighbourhoods (2005) (49)
- On the dimensions of ordered sets of bounded degree (1986) (49)
- Minimum matrix representation of closure operations (1985) (48)
- Mental Poker with Three or More Players (1984) (46)
- On zero-trees (1992) (46)
- Extremal problems concerning Kneser graphs (1986) (45)
- Signed Domination in Regular Graphs and Set-Systems (1999) (45)
- Graphs of Prescribed Girth and Bi-Degree (1995) (45)
- On 3-uniform hypergraphs without a cycle of a given length (2014) (44)
- On a Turán type problem of Erdös (1991) (43)
- Solution of the Littlewood-Offord problem in high dimensions (1988) (43)
- Beyond the Erdös-Ko-Rado theorem (1991) (42)
- Traces of finite sets: extremal problems and geometric applications (1994) (39)
- Maximal Independent Subsets in Steiner Systems and in Planar Sets (1991) (39)
- On Generalized Ramsey Theory: The Bipartite Case (2000) (38)
- Families of finite sets with minimum shadows (1986) (37)
- Random Ramsey graphs for the four-cycle (1994) (37)
- A new short proof of the EKR theorem (2011) (36)
- Turán problems for integer‐weighted graphs (2002) (36)
- Geometrical Solution of an Intersection Problem for Two Hypergraphs (1984) (36)
- Volumes Spanned by Random Points in the Hypercube (1992) (36)
- The Tura'n Density of the Hypergraph {abc, ade, bde, cde} (2003) (35)
- Finite projective spaces and intersecting hypergraphs (1986) (35)
- Avoiding long Berge cycles (2018) (32)
- Cycle‐Saturated Graphs with Minimum Number of Edges (2011) (32)
- Extremal Hypergraphs and Combinatorial Geometry (1995) (29)
- Extremal Numbers for Odd Cycles (2013) (29)
- Extremal set systems with restricted k-wise intersections (2004) (29)
- On the Fractional Covering Number of Hypergraphs (1988) (28)
- On Maximal Intersecting Families of Finite Sets (1980) (28)
- Covering the complete graph by partitions (1989) (28)
- Spanning subgraphs of random graphs (1992) (27)
- Separating Pairs of Points by Standard Boxes (1985) (26)
- The Erdös-Ko-Rado Theorem for Integer Sequences (1980) (26)
- Linear trees in uniform hypergraphs (2012) (25)
- Random polytopes in thed-dimensional cube (1986) (25)
- Minimal Oriented Graphs of Diameter 2 (1998) (25)
- On even-cycle-free subgraphs of the hypercube (2009) (24)
- Saturated r-uniform hypergraphs (1991) (24)
- Discrete Convex Functions and Proof of the Six Circle Conjecture of Fejes Tóth (1984) (24)
- On the shape of the convex hull of random points (1988) (24)
- FAMILIES OF FINITE SETS WITH MISSING INTERSECTIONS (1984) (24)
- Covering the n-space by convex bodies and its chromatic number (2008) (24)
- On the existence of countable universal graphs (1997) (24)
- On Hypergraphs without Two Edges Intersecting in a Given Number of Vertices (1984) (23)
- Hypergraphs in which all disjoint pairs have distinct unions (1984) (23)
- Stability in the Erdős-Gallai Theorems on cycles and paths (2015) (23)
- Maximal intersecting families and affine regular polygons in PG(2, q) (1989) (22)
- Covering t-element Sets by Partitions (1991) (21)
- On 14-Cycle-Free Subgraphs of the Hypercube (2009) (21)
- Quadruple systems with independent neighborhoods (2008) (21)
- Unavoidable subhypergraphs: a-clusters (2009) (21)
- Scrambling permutations and entropy of hypergraphs (1996) (21)
- Distance graph on Znwith norm (2004) (21)
- Maximal triangle-free graphs with restrictions on the degrees (1994) (20)
- Singularities of Minimal Surfaces and Networks and Related Extremal Problems in Minkowski Space (1990) (20)
- Choosability with Separation of Complete Multipartite Graphs and Hypergraphs (2011) (20)
- The chromatic index of simple hypergraphs (1986) (19)
- On the lottery problem (1996) (19)
- The densest packing of equal circles into a parallel strip (1991) (19)
- Nonexistence of universal graphs without some trees (1997) (19)
- Covering Non-uniform Hypergraphs (2001) (18)
- Nordhaus–Gaddum‐type Theorems for decompositions into many parts (2005) (18)
- Bounding one-way differences (1987) (18)
- Colored packing of sets (1987) (17)
- Color critical hypergraphs and forbidden configurations (2005) (17)
- Cross-Intersecting Families of Finite Sets (1995) (17)
- A Proof and Generalizations of the Erdős-Ko-Rado Theorem Using the Method of Linearly Independent Polynomials (2006) (17)
- A minimal cutset of the boolean lattice with almost all members (1989) (17)
- Hamiltonian Kneser Graphs (2002) (16)
- An Improved Upper Bound of the Rate of Euclidean Superimposed Codes (1998) (15)
- Connected matchings and Hadwiger's conjecture (2005) (15)
- Pair Labeelings with Given Distance (1989) (15)
- Union-Free Families of Sets and Equations over Fields (1986) (15)
- 4-Books of three pages (2006) (14)
- A stability version for a theorem of Erdős on nonhamiltonian graphs (2016) (14)
- Stability in the Erdős-Gallai Theorem on cycles and paths, II (2018) (14)
- List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs (2009) (14)
- The prison yard problem (1994) (14)
- Extremal problems in finite geometry (1994) (13)
- The order dimension of two levels of the Boolean lattice (1994) (13)
- The Smallest Convex Cover for Triangles of Perimeter Two (2000) (13)
- An Extension of Mantel’s Theorem to k-Graphs (2020) (13)
- Nordhaus–Gaddum-type Theorems for decompositions into many parts (2005) (13)
- Two-Part and k-Sperner Families: New Proofs Using Permutations (2005) (12)
- Ramsey-Sperner theory (1987) (12)
- Ramsey Theory and Bandwidth of Graphs (2001) (12)
- A new extremal property of Steiner triple-systems (1984) (12)
- Extensions of a theorem of Erdős on nonhamiltonian graphs (2017) (12)
- On the Prague Dimension of Kneser Graphs (2000) (12)
- Competition Graphs and Clique Dimensions (1990) (12)
- Moments of graphs in monotone families (2006) (11)
- Inequalities for the first‐fit chromatic number (2008) (10)
- On the lattice diameter of a convex polygon (2001) (10)
- Turán problems for integer-weighted graphs (2002) (10)
- Hypergraphs without a large star (1985) (10)
- Forbidden submatrices (1986) (10)
- Reverse-free codes and permutations (2011) (9)
- Covering pairs by q2 + q + 1 sets (1990) (9)
- Graphs of diameter 3 with the minimum number of edges (1990) (9)
- Covering a graph with cuts of minimum total size (2001) (9)
- 2-Bases of Quadruples (2006) (9)
- Sets of vectors with many orthogonal paris: (1992) (9)
- Random Volumes in the n-Cube (1990) (9)
- Induced subgraphs of given sizes (1999) (8)
- Covers for closed curves of length two (2011) (8)
- t-expansive andt-wise intersecting hypergraphs (1986) (8)
- Representations of families of triples over GF(2) (1990) (8)
- The grid revisted (1993) (8)
- On the Double Competition Number (1998) (8)
- Rectangular Dissections of a Square (1988) (8)
- Sphere coverings of the hypercube with incomparable centers (1990) (7)
- An Upper Bound on the Size of Sidon Sets (2021) (7)
- Minimum vertex-diameter-2-critical graphs (2005) (7)
- Minimal Symmetric Differences of Lines in Projective Planes (2013) (7)
- A discrete isodiametric result: The Erdős-Ko-Rado theorem for multisets (2012) (7)
- Tree representations of graphs (2007) (7)
- A Ramsey-Sperner theorem (1985) (7)
- Midpoints of Diagonals of Convex n-GONS (1991) (7)
- Inequalities for the first-fit chromatic number (2008) (7)
- On the kernel of intersecting families (1987) (7)
- Large Chromatic Number and Ramsey Graphs (2011) (7)
- Extremal problems for convex geometric hypergraphs and ordered hypergraphs (2019) (7)
- On representing sylvester-gallai designs (1989) (7)
- Nearly subadditive sequences (2018) (7)
- On a theorem of Erdős and Simonovits on graphs not containing the cube (2013) (6)
- An intersection problem with 6 extremes (1983) (6)
- Minimum vertex‐diameter‐2‐critical graphs (2005) (6)
- On Reverse-Free Codes and Permutations (2010) (6)
- Ordered and Convex Geometric Trees with Linear Extremal Function (2018) (6)
- Multiply intersecting families of sets (2004) (6)
- Hypergraphs Not Containing a Tight Tree with a Bounded Trunk (2017) (6)
- On the Maximum Number of Triangles in Wheel-Free Graphs (1994) (6)
- A variation of a theorem by Pósa (2019) (5)
- Intersecting designs from linear programming and graphs of diameter two (1994) (5)
- Large Bd-free and union-free subfamilies (2010) (5)
- A sharpening of Fisher's inequality (1991) (5)
- Berge Cycles in Non-Uniform Hypergraphs (2020) (5)
- Multiple vertex coverings by specified induced subgraphs (1999) (5)
- The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs (2014) (5)
- 2-Cancellative Hypergraphs and Codes (2011) (4)
- Linear paths and trees in uniform hypergraphs (2011) (4)
- Colouring finite incidence structures (1986) (4)
- On 2-Connected Hypergraphs with No Long Cycles (2019) (4)
- Legitimate colorings of projective planes (1989) (4)
- A Turanlike Neighborhood Condition and Cliques in Graphs (1989) (4)
- Dimension versus size (1988) (4)
- On the Maximum Size of (p, Q) - free Families (2001) (3)
- Tight embeddings of partial quadrilateral packings (2010) (3)
- Perfect error-correcting databases (1990) (3)
- Set-systems with prescribed cardinalities for pairwise intersections (1982) (3)
- Minimal length test vectors for multiple-fault detection (2004) (3)
- Set systems with three intersections (1985) (3)
- Difference sets and inverting the difference operator (1996) (3)
- Indecomposable regular graphs and hypergraphs (1992) (3)
- The maximum number of balancing sets (1987) (3)
- The jump number of suborders of the power set order (1989) (3)
- Determination of dienes in hydrocarbon mixtures by reaction gas chromatography (1978) (3)
- An Intersection Problem Whose Extremum Is the Finite Projective Space (1982) (3)
- On set systems with a threshold property (2006) (2)
- Embedding of graphs in two-irregular graphs (2001) (2)
- On splittable colorings of graphs and hypergraphs (2002) (2)
- DISJOINT r-TUPLES IN AN r-GRAPH WITH GIVEN MAXIMUM DEGREE (1983) (2)
- Partitioning ordered hypergraphs (2019) (2)
- Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition (2021) (2)
- An analogue of the Erdős-Ko-Rado theorem for multisets (2013) (2)
- Completing partial packings of bipartite graphs (2010) (2)
- Large Monochromatic Components in Almost Complete Graphs and Bipartite Graphs (2020) (2)
- The extremal number for ( a , b )-paths and other hypergraph trees (2017) (2)
- Extremal problems for pairs of triangles (2020) (2)
- Covering a Triangle with Positive and Negative Homothetic Copies (2007) (1)
- Preface: Levon Khachatrian's legacy in extremal combinatorics (2017) (1)
- A projective plane is an outstanding 2-cover (1989) (1)
- Some new bounds on partition critical hypergraphs (2012) (1)
- Exact Bounds on the Sizes of Covering Codes (2003) (1)
- Spanning subgraphs of Random Graphs ( A research problem ) (1992) (1)
- Oriented graphs of diameter 2 (2003) (1)
- The structure of the typical graphs of given diameter (2013) (1)
- Kneser ranks of random graphs and minimum difference representations (2017) (1)
- Maximal τ-Critical Linear Hypergraphs (2001) (1)
- Minimum Ck-saturated graphs (2011) (1)
- Multicolored lines in a finite geometry (1988) (1)
- Optimal Multivalued Shattering (2011) (1)
- The second and the third smallest distances on the sphere (1993) (1)
- Decomposition of a convex region by lines (1991) (1)
- Partition Critical Hypergraphs (2009) (1)
- The number of well-oriented regions (1982) (0)
- Diszkrét matematika és alkalmazásai = Discrete mathematics and its applications (2007) (0)
- On Automorphisms of Line-graphs (1980) (0)
- Multiple access Euclidean channel (2007) (0)
- Turán number of special four cycles in triple systems (2021) (0)
- On r-graphs and r-multihypergraphs with given maximum degree (1991) (0)
- Exact solution of the hypergraph Turán problem for k-uniform linear paths (2014) (0)
- Three representations of graphs (2007) (0)
- On the maximum size of (p, Q)-free families (2002) (0)
- C O ] 2 4 O ct 2 01 3 Extremal numbers for odd cycles (2013) (0)
- Maximal Τ -critical Linear Hypergraphs 1 (1999) (0)
- Difference Sets and Computability Theory (1998) (0)
- Large Chromatic Number and Ramsey Graphs (2012) (0)
- Diszkrét matematika = Discrete mathematics (2009) (0)
- Positive linear combination free families ∗ (2002) (0)
- List-distinguishing Cartesian products of cliques (2017) (0)
- Hypergraphs without exponents (2019) (0)
- Guest Editors’ Foreword (2008) (0)
- The Maximal Angular Gap among Rectangular Grid Points (1998) (0)
- Intersection Representations of the Complete Bipartite Graph (2013) (0)
- Author Proof A Moments of Graphs in Monotone Families (2005) (0)
- CJM volume 73 issue 6 Cover and Front matter (2021) (0)
- Combinatorics, Geometry and Probability: On the Maximum Number of Triangles in Wheel-Free Graphs (1997) (0)
- 2-cancellative codes, an algebraic construction for a hypergraph Turan problem (2012) (0)
- Large convex cones in hypercubes (2005) (0)
- Subtended angles (2015) (0)
- Regular union and cover free families (2009) (0)
- Subtended angles (2016) (0)
This paper list is powered by the following services:
Other Resources About Zoltán Füredi
What Schools Are Affiliated With Zoltán Füredi?
Zoltán Füredi is affiliated with the following schools:
