Zoltan Fueredi

From MaRDI portal
Person:787137

Available identifiers

zbMath Open furedi.zoltanWikidataQ218916 ScholiaQ218916MaRDI QIDQ787137

List of research outcomes

PublicationDate of PublicationType
Problems and results on 1-cross-intersecting set pair systems2023-11-08Paper
Extremal Problems for Hypergraph Blowups of Trees2023-10-26Paper
Induced Turán problems and traces of hypergraphs2023-07-18Paper
Tur\' an number for bushes2023-07-10Paper
An Upper Bound on the Size of Sidon Sets2023-05-11Paper
Extremal problems for pairs of triangles2022-04-27Paper
Extremal problems for convex geometric hypergraphs and ordered hypergraphs2022-01-12Paper
https://portal.mardi4nfdi.de/entity/Q51638402021-11-09Paper
Turán number of special four cycles in triple systems2021-10-27Paper
Hypergraphs without exponents2021-08-25Paper
Avoiding long Berge cycles. II: Exact bounds for all \(n\)2021-07-23Paper
Large monochromatic components in almost complete graphs and bipartite graphs2021-06-21Paper
Nearly subadditive sequences2020-12-18Paper
Tight paths in convex geometric hypergraphs2020-10-20Paper
Partitioning ordered hypergraphs2020-10-07Paper
Ordered and convex geometric trees with linear extremal function2020-09-01Paper
Berge cycles in non-uniform hypergraphs2020-07-30Paper
Hypergraphs not containing a tight tree with a bounded trunk. II: 3-trees with a trunk of size 22020-04-01Paper
An Extension of Mantel’s Theorem to k-Graphs2020-02-25Paper
Almost similar configurations2019-11-22Paper
On 2-connected hypergraphs with no long cycles2019-11-15Paper
Hypergraphs Not Containing a Tight Tree with a Bounded Trunk2019-08-29Paper
Avoiding long Berge cycles2019-07-17Paper
A variation of a theorem by Pósa2019-06-18Paper
List-distinguishing Cartesian products of cliques2019-06-18Paper
Extensions of a theorem of Erdős on nonhamiltonian graphs2018-10-31Paper
Extremal problems on ordered and convex geometric hypergraphs2018-07-13Paper
Kneser Ranks of Random Graphs and Minimum Difference Representations2018-05-18Paper
Stability in the Erdős-Gallai theorem on cycles and paths. II2018-04-05Paper
Kneser ranks of random graphs and minimum difference representations2018-01-18Paper
The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs2017-10-10Paper
The linear Tur\'an number of the k-fan2017-10-09Paper
Extremal Numbers for Odd Cycles2017-10-04Paper
A stability version for a theorem of Erdős on nonhamiltonian graphs2017-09-05Paper
On 3-uniform hypergraphs without a cycle of a given length2017-03-15Paper
Stability in the Erdős-Gallai theorems on cycles and paths2016-10-12Paper
Subtended angles2016-09-15Paper
List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs2016-06-10Paper
A coding problem for pairs of subsets2015-10-20Paper
A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity2015-08-21Paper
A discrete isodiametric result: the Erdős-Ko-Rado theorem for multisets2015-06-02Paper
Tur\'an numbers of hypergraph trees2015-05-12Paper
Minimal Symmetric Differences of Lines in Projective Planes2014-11-26Paper
Exact solution of the hypergraph Turán problem for \(k\)-uniform linear paths2014-08-14Paper
On a theorem of Erd\H{o}s and Simonovits on graphs not containing the cube2014-08-12Paper
Linear trees in uniform hypergraphs2014-07-29Paper
An analogue of the Erdős-Ko-Rado theorem for multisets2014-06-11Paper
Choosability with Separation of Complete Multipartite Graphs and Hypergraphs2014-05-28Paper
The History of Degenerate (Bipartite) Extremal Graph Problems2014-05-19Paper
Hypergraph Turán numbers of linear cycles2014-01-31Paper
Uniform hypergraphs containing no grids2014-01-08Paper
Large B_d-free and union-free subfamilies2013-11-01Paper
https://portal.mardi4nfdi.de/entity/Q28573742013-11-01Paper
https://portal.mardi4nfdi.de/entity/Q28573752013-11-01Paper
https://portal.mardi4nfdi.de/entity/Q28573962013-11-01Paper
On even-cycle-free subgraphs of the hypercube2013-10-10Paper
Unavoidable subhypergraphs: a-clusters2013-10-10Paper
List colorings with distinct list sizes, the case of complete bipartite graphs2013-10-10Paper
Partition Critical Hypergraphs2013-10-10Paper
Large chromatic number and Ramsey graphs2013-09-26Paper
Cycle-Saturated Graphs with Minimum Number of Edges2013-05-21Paper
The structure of the typical graphs of given diameter2013-01-03Paper
Optimal Multivalued Shattering2012-09-12Paper
Large $B_d$-Free and Union-free Subfamilies2012-08-22Paper
A new short proof of the EKR theorem2012-06-04Paper
2-Cancellative Hypergraphs and Codes2012-05-14Paper
Some new bounds on partition critical hypergraphs2012-05-04Paper
The number of graphs of given diameter2012-04-20Paper
Covers for closed curves of length two2012-02-13Paper
Unavoidable subhypergraphs: \(\mathbf a\)-clusters2011-10-21Paper
Completing partial packings of bipartite graphs2011-10-21Paper
On even-cycle-free subgraphs of the hypercube2011-06-17Paper
On Reverse-Free Codes and Permutations2011-06-17Paper
https://portal.mardi4nfdi.de/entity/Q35766722010-07-30Paper
On 14-Cycle-Free Subgraphs of the Hypercube2010-04-22Paper
Tight embeddings of partial quadrilateral packings2010-04-21Paper
Quadruple systems with independent neighborhoods2008-12-08Paper
Inequalities for the first-fit chromatic number2008-10-08Paper
Large convex cones in hypercubes2008-09-29Paper
Covering the \(n\)-space by convex bodies and its chromatic number2008-09-04Paper
Covering a triangle with positive and negative homothetic copies2007-12-19Paper
On the Maximum Size of (p, Q)—free Families2007-05-29Paper
Large Convex Cones in Hypercubes2007-05-29Paper
Tree representations of graphs2007-04-10Paper
https://portal.mardi4nfdi.de/entity/Q34248832007-03-05Paper
On set systems with a threshold property2006-12-14Paper
On the Turán number for the hexagon2006-08-04Paper
4-books of three pages2006-08-04Paper
Two-Part and k-Sperner Families: New Proofs Using Permutations2006-06-01Paper
Moments of graphs in monotone families2006-03-24Paper
2-Bases of Quadruples2006-03-13Paper
Nordhaus–Gaddum‐type Theorems for decompositions into many parts2005-12-08Paper
Minimum vertex‐diameter‐2‐critical graphs2005-12-08Paper
On Triple Systems with Independent Neighbourhoods2005-11-14Paper
Triple Systems Not Containing a Fano Configuration2005-10-18Paper
Connected matchings and Hadwiger's conjecture2005-06-07Paper
Distance graph on \(\mathbb Z^n\) with \(\ell_{1}\) norm2004-08-10Paper
Minimal length test vectors for multiple-fault detection2004-08-06Paper
Multiply intersecting families of sets2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44647362004-05-27Paper
Extremal set systems with restricted \(k\)-wise intersections.2004-03-14Paper
Exact bounds on the sizes of covering codes2003-09-07Paper
Ramsey theory and bandwidth of graphs2003-05-11Paper
The Turán density of the hypergraph \(\{abc,ade,bde,cde\}\)2003-05-07Paper
Embedding of graphs in two-irregular graphs2002-12-11Paper
On generalized Ramsey theory: The bipartite case2002-12-10Paper
Covering non-uniform hypergraphs2002-12-10Paper
On the maximum size of \((p,Q)\)-free families2002-12-02Paper
Turán problems for integer-weighted graphs2002-09-29Paper
On splittable colorings of graphs and hypergraphs2002-09-29Paper
On the lattice diameter of a convex polygon2002-08-07Paper
Hamiltonian Kneser graphs2002-06-25Paper
Maximal \(\tau\)-critical linear hypergraphs2002-02-25Paper
Covering a graph with cuts of minimum total size2001-07-23Paper
Multiple vertex coverings by specified induced subgraphs2001-02-18Paper
https://portal.mardi4nfdi.de/entity/Q49450582000-10-23Paper
The smallest convex cover for triangles of perimeter two2000-09-13Paper
The maximum size of 3-uniform hypergraphs not containing a Fano plane2000-06-25Paper
Induced subgraphs of given sizes2000-01-30Paper
Signed domination in regular graphs and set-systems1999-12-20Paper
An improved upper bound of the rate of Euclidean superimposed codes1999-11-21Paper
The maximal angular gap among rectangular grid points1999-10-31Paper
Minimal oriented graphs of diameter 21999-08-02Paper
Difference sets and computability theory1999-06-24Paper
On the lottery problem1999-05-16Paper
https://portal.mardi4nfdi.de/entity/Q43805801998-07-15Paper
Nonexistence of universal graphs without some trees1998-05-06Paper
On the double competition number1998-04-13Paper
https://portal.mardi4nfdi.de/entity/Q43523251998-02-16Paper
https://portal.mardi4nfdi.de/entity/Q43478961997-08-11Paper
On the existence of countable universal graphs1997-05-19Paper
On the number of edges of quadrilateral-free graphs1997-03-23Paper
https://portal.mardi4nfdi.de/entity/Q56890011997-03-11Paper
https://portal.mardi4nfdi.de/entity/Q48782861996-11-05Paper
New asymptotics for bipartite Turán numbers1996-07-24Paper
An Upper Bound on Zarankiewicz' Problem1996-07-01Paper
Difference sets and inverting the difference operator1996-06-23Paper
Cross-intersecting families of finite sets1996-06-18Paper
On \(r\)-cover-free families1996-05-13Paper
https://portal.mardi4nfdi.de/entity/Q48660841996-04-10Paper
Scrambling permutations and entropy of hypergraphs1996-03-20Paper
Graphs of prescribed girth and bi-degree1995-09-20Paper
The prison yard problem1995-08-01Paper
https://portal.mardi4nfdi.de/entity/Q43266401995-07-13Paper
Extremal graphs for intersecting triangles1995-07-04Paper
On the Maximum Number of Triangles in Wheel-Free Graphs1995-03-09Paper
On the Best Constant for the Besicovitch Covering Theorem1994-12-11Paper
The order dimension of two levels of the Boolean lattices1994-11-10Paper
https://portal.mardi4nfdi.de/entity/Q42846141994-08-29Paper
The grid revisited1994-08-22Paper
Point Selections and Weak ε-Nets for Convex Hulls1994-05-30Paper
Intersecting designs from linear programming and graphs of diameter two1994-05-05Paper
https://portal.mardi4nfdi.de/entity/Q31371881994-04-13Paper
Random Ramsey graphs for the four-cycle1994-04-04Paper
Maximal triangle‐free graphs with restrictions on the degrees1994-01-26Paper
On the fractional matching polytope of a hypergraph1993-09-15Paper
https://portal.mardi4nfdi.de/entity/Q40329911993-05-18Paper
Covering the cube by affine hyperplanes1993-05-16Paper
The second and the third smallest distances on the sphere1993-05-04Paper
Sets of vectors with many orthogonal pairs1993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q40284711993-03-28Paper
https://portal.mardi4nfdi.de/entity/Q40243241993-03-09Paper
Indecomposable regular graphs and hypergraphs1993-01-16Paper
Davenport-Schinzel theory of matrices1992-12-06Paper
https://portal.mardi4nfdi.de/entity/Q40113121992-09-27Paper
On zero-trees1992-09-27Paper
Spanning subgraphs of random graphs1992-08-03Paper
Saturated \(r\)-uniform hypergraphs1992-06-28Paper
Volumes Spanned by Random Points in the Hypercube1992-06-28Paper
The maximum number of edges in a minimal graph of diameter 21992-06-28Paper
On a Turán type problem of Erdős1992-06-27Paper
Covering \(t\)-element sets by partitions1992-06-27Paper
https://portal.mardi4nfdi.de/entity/Q39733701992-06-26Paper
Beyond the Erdős-Ko-Rado theorem1992-06-25Paper
A sharpening of Fisher's inequality1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39721241992-06-25Paper
Competition graphs and clique dimensions1992-06-25Paper
Midpoints of Diagonals of Convex n-Gons1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q39781091992-06-25Paper
Maximal Independent Subsets in Steiner Systems and in Planar Sets1992-06-25Paper
Maximal intersecting families and affine regular polygons in \(PG(2,q)\)1992-06-25Paper
Representations of families of triples over \(GF(2)\)1992-06-25Paper
Matchings and covers in hypergraphs1992-06-25Paper
The maximum number of unit distances in a convex \(n\)-gon1992-06-25Paper
Perfect error-correcting databases1992-06-25Paper
Sphere coverings of the hypercube with incomparable centers1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q34704821992-01-01Paper
Decomposition of a convex region by lines1991-01-01Paper
The densest packing of equal circles into a parallel strip1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33489321991-01-01Paper
Covering pairs by \(q^ 2+q+1\) sets1990-01-01Paper
Graphs of diameter 3 with the minimum number of edges1990-01-01Paper
On the number of halving planes1990-01-01Paper
Legitimate colorings of projective planes1989-01-01Paper
Extremal problems whose solutions are the blowups of the small Witt- designs1989-01-01Paper
A projective plane is an outstanding 2-cover1989-01-01Paper
On representing Sylvester-Gallai designs1989-01-01Paper
Covering the complete graph by partitions1989-01-01Paper
A minimal cutset of the Boolean lattice with almost all members1989-01-01Paper
Pair Labellings with Given Distance1989-01-01Paper
On the shape of the convex hull of random points1988-01-01Paper
Rectangular dissections of a square1988-01-01Paper
On induced subgraphs of the cube1988-01-01Paper
Dimension versus size1988-01-01Paper
Multicolored lines in a finite geometry1988-01-01Paper
Solution of the Littlewood-Offord problem in high dimensions1988-01-01Paper
On the Fractional Covering Number of Hypergraphs1988-01-01Paper
Shadows of colored complexes.1988-01-01Paper
Approximation of the Sphere by Polytopes having Few Vertices1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38280351988-01-01Paper
The maximum number of balancing sets1987-01-01Paper
Computing the volume is difficult1987-01-01Paper
On the kernel of intersecting families1987-01-01Paper
Exact solution of some Turán-type problems1987-01-01Paper
Bounding one-way differences1987-01-01Paper
Ramsey-Sperner theory1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37664161987-01-01Paper
Empty Simplices in Euclidean Space1987-01-01Paper
The number of maximal independent sets in connected graphs1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38295651987-01-01Paper
Extremal problems concerning Kneser-graphs1986-01-01Paper
Non-trivial intersecting families1986-01-01Paper
Union-free families of sets and equations over fields1986-01-01Paper
The chromatic index of simple hypergraphs1986-01-01Paper
Coloring graphs with locally few colors1986-01-01Paper
t-expansive and t-wise intersecting hypergraphs1986-01-01Paper
Random polytopes in the d-dimensional cube1986-01-01Paper
Colouring finite incidence structures1986-01-01Paper
Families of finite sets with minimum shadows1986-01-01Paper
Finite projective spaces and intersecting hypergraphs1986-01-01Paper
Forbidden submatrices1986-01-01Paper
On the dimensions of ordered sets of bounded degree1986-01-01Paper
Hypergraphs without a large star1985-01-01Paper
Set systems with three intersections1985-01-01Paper
Forbidding just one intersection1985-01-01Paper
Minimum matrix representation of closure operations1985-01-01Paper
A Ramsey-Sperner theorem1985-01-01Paper
Families of finite sets in which no set is covered by the union of \(r\) others1985-01-01Paper
Separating pairs of points of standard boxes1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36847601985-01-01Paper
Dependencies in composite databases1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37926871985-01-01Paper
Hypergraphs in which all disjoint pairs have distinct unions1984-01-01Paper
On hypergraphs without two edges intersecting in a given number of vertices1984-01-01Paper
An exact result for 3-graphs1984-01-01Paper
Geometrical solution of an intersection problem for two hypergraphs1984-01-01Paper
Union-free hypergraphs and probability theory1984-01-01Paper
A new extremal property of Steiner triple-systems1984-01-01Paper
The number of triangles covering the center of an \(n\)-set1984-01-01Paper
Discrete Convex Functions and Proof of the Six Circle Conjecture of Fejes Tóth1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32221971984-01-01Paper
Arrangements of Lines with a Large Number of Triangles1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36935281984-01-01Paper
On finite set-systems whose every intersection is a kernel of a star1983-01-01Paper
An intersection problem with 6 extremes1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39630471983-01-01Paper
A new generalization of the Erdős-Ko-Rado theorem1983-01-01Paper
Graphs without quadrilaterals1983-01-01Paper
Mental poker with three or more players1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33133061983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33133071983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33176901983-01-01Paper
DISJOINT r-TUPLES IN AN r-GRAPH WITH GIVEN MAXIMUM DEGREE1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36761741983-01-01Paper
An intersection problem whose extremum is the finite projective space1982-01-01Paper
Set-systems with prescribed cardinalities for pairwise intersections1982-01-01Paper
Families of finite sets in which no set is covered by the union of two others1982-01-01Paper
The number of well-oriented regions1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39675371982-01-01Paper
A short proof for a theorem of Harper about Hamming-spheres1981-01-01Paper
Maximum degree and fractional matchings in uniform hypergraphs1981-01-01Paper
The eigenvalues of random symmetric matrices1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38955111981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39297421981-01-01Paper
On maximal intersecting families of finite sets1980-01-01Paper
On automorphisms of line-graphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39021101980-01-01Paper
The Erdös-Ko-Rado Theorem for Integer Sequences1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39608861979-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Zoltan Fueredi