Zoltán Füredi

Electron. J. Comb., 2025

2024

Minimal abundant packings and choosability with separation.

[BibT_eX]

[DOI]

Mohit Kumbhat

Des. Codes Cryptogr., December, 2024

2023

Extremal Problems for Hypergraph Blowups of Trees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., December, 2023

Induced Turán problems and traces of hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., June, 2023

An Upper Bound on the Size of Sidon Sets.

[BibT_eX]

[DOI]

József Balogh

Souktik Roy

Am. Math. Mon., May, 2023

Problems and results on 1-cross-intersecting set pair systems.

[BibT_eX]

[DOI]

Zoltán Király

Comb. Probab. Comput., 2023

2022

Shadows of 3-Uniform Hypergraphs under a Minimum Degree Condition.

[BibT_eX]

[DOI]

Yi Zhao

SIAM J. Discret. Math., 2022

Extremal problems for pairs of triangles.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

Turán number of special four cycles in triple systems.

[BibT_eX]

[DOI]

Discret. Math., 2022

2021

Partitioning ordered hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2021

Hypergraphs without exponents.

[BibT_eX]

[DOI]

Dániel Gerbner

J. Comb. Theory A, 2021

Large Monochromatic Components in Almost Complete Graphs and Bipartite Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

2020

An Extension of Mantel's Theorem to k-Graphs.

[BibT_eX]

[DOI]

Am. Math. Mon., 2020

Ordered and Convex Geometric Trees with Linear Extremal Function.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2020

Hypergraphs not containing a tight tree with a bounded trunk II: 3-trees with a trunk of size 2.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Berge Cycles in Non-Uniform Hypergraphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

2019

Hypergraphs Not Containing a Tight Tree with a Bounded Trunk.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2019

Avoiding long Berge cycles.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

A variation of a theorem by Pósa.

[BibT_eX]

[DOI]

Discret. Math., 2019

List-distinguishing Cartesian products of cliques.

[BibT_eX]

[DOI]

Discret. Math., 2019

On 2-Connected Hypergraphs with No Long Cycles.

[BibT_eX]

[DOI]

Electron. J. Comb., 2019

2018

Extensions of a theorem of Erdős on nonhamiltonian graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

Stability in the Erdős-Gallai Theorem on cycles and paths, II.

[BibT_eX]

[DOI]

Discret. Math., 2018

2017

Kneser ranks of random graphs and minimum difference representations.

[BibT_eX]

[DOI]

Ida Kantor

Electron. Notes Discret. Math., 2017

A stability version for a theorem of Erdős on nonhamiltonian graphs.

[BibT_eX]

[DOI]

Discret. Math., 2017

On 3-uniform hypergraphs without a cycle of a given length.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Preface: Levon Khachatrian's legacy in extremal combinatorics.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

The Minimum Number of Triangular Edges and a Symmetrization Method for Multiple Graphs.

[BibT_eX]

[DOI]

Zeinab Maleki

Comb. Probab. Comput., 2017

2016

Stability in the Erdős-Gallai Theorems on cycles and paths.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2016

2015

A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

A discrete isodiametric result: The Erdős-Ko-Rado theorem for multisets.

[BibT_eX]

[DOI]

Dániel Gerbner

Máté Vizer

Eur. J. Comb., 2015

Extremal Numbers for Odd Cycles.

[BibT_eX]

[DOI]

David S. Gunderson

Comb. Probab. Comput., 2015

2014

Choosability with Separation of Complete Multipartite Graphs and Hypergraphs.

[BibT_eX]

[DOI]

Mohit Kumbhat

J. Graph Theory, 2014

Hypergraph Turán numbers of linear cycles.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2014

Linear trees in uniform hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Exact solution of the hypergraph Turán problem for k-uniform linear paths.

[BibT_eX]

[DOI]

Robert Seiver

Comb., 2014

A coding problem for pairs of subsets.

[BibT_eX]

[DOI]

Proceedings of the Geometry, Structure and Randomness in Combinatorics, 2014

2013

Cycle-Saturated Graphs with Minimum Number of Edges.

[BibT_eX]

[DOI]

Younjin Kim

J. Graph Theory, 2013

Large Chromatic Number and Ramsey Graphs.

[BibT_eX]

[DOI]

Csaba Biró

Sogol Jahanbekam

Graphs Comb., 2013

The structure of the typical graphs of given diameter.

[BibT_eX]

[DOI]

Younjin Kim

Discret. Math., 2013

Intersection Representations of the Complete Bipartite Graph.

[BibT_eX]

[DOI]

Proceedings of the Mathematics of Paul Erdős II, 2013

2012

Optimal Multivalued Shattering.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

Large Bd-Free and Union-free Subfamilies.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

A new short proof of the EKR theorem.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2012

Some new bounds on partition critical hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

2-Cancellative Hypergraphs and Codes.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2012

2011

Covers for closed curves of length two.

[BibT_eX]

[DOI]

John E. Wetzel

Period. Math. Hung., 2011

Completing partial packings of bipartite graphs.

[BibT_eX]

[DOI]

Ago-Erik Riet

Mykhaylo Tyomkyn

J. Comb. Theory A, 2011

Reverse-free codes and permutations.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Minimum Ck-saturated graphs.

[BibT_eX]

[DOI]

Younjin Kim

Electron. Notes Discret. Math., 2011

Linear paths and trees in uniform hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

Large Bd-free and union-free subfamilies.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2010

Tight embeddings of partial quadrilateral packings.

[BibT_eX]

[DOI]

Jenö Lehel

J. Comb. Theory A, 2010

2009

Partition Critical Hypergraphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

On even-cycle-free subgraphs of the hypercube.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Unavoidable subhypergraphs: a-clusters.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

List colorings with distinct list sizes, the case of complete bipartite graphs.

[BibT_eX]

[DOI]

Ida Kantor

Electron. Notes Discret. Math., 2009

On 14-Cycle-Free Subgraphs of the Hypercube.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2009

2008

Inequalities for the first-fit chromatic number.

[BibT_eX]

[DOI]

J. Graph Theory, 2008

Quadruple systems with independent neighborhoods.

[BibT_eX]

[DOI]

Oleg Pikhurko

J. Comb. Theory A, 2008

Covering the n-space by convex bodies and its chromatic number.

[BibT_eX]

[DOI]

Jeong-Hyun Kang

Discret. Math., 2008

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Discret. Math., 2008

2007

Tree representations of graphs.

[BibT_eX]

[DOI]

Nancy Eaton

Jozef Skokan

Eur. J. Comb., 2007

Covering a Triangle with Positive and Negative Homothetic Copies.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2007

2006

Moments of graphs in monotone families.

[BibT_eX]

[DOI]

André Kündgen

J. Graph Theory, 2006

4-Books of three pages.

[BibT_eX]

[DOI]

Oleg Pikhurko

Miklós Simonovits

J. Comb. Theory A, 2006

On set systems with a threshold property.

[BibT_eX]

[DOI]

Discret. Math., 2006

2-Bases of Quadruples.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2006

2005

Two-Part and k-Sperner Families: New Proofs Using Permutations.

[BibT_eX]

[DOI]

Péter L. Erdös

SIAM J. Discret. Math., 2005

Nordhaus-Gaddum-type Theorems for decompositions into many parts.

[BibT_eX]

[DOI]

Riste Skrekovski

Michael Stiebitz

Douglas B. West

J. Graph Theory, 2005

Minimum vertex-diameter-2-critical graphs.

[BibT_eX]

[DOI]

Ya-Chen Chen

J. Graph Theory, 2005

Large Convex Cones in Hypercubes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Triple Systems Not Containing a Fano Configuration.

[BibT_eX]

[DOI]

Miklós Simonovits

Comb. Probab. Comput., 2005

Connected matchings and Hadwiger's conjecture.

[BibT_eX]

[DOI]

Gábor Simonyi

Comb. Probab. Comput., 2005

2004

Distance graph on Znwith norm.

[BibT_eX]

[DOI]

Jeong-Hyun Kang

Theor. Comput. Sci., 2004

Minimal length test vectors for multiple-fault detection.

[BibT_eX]

[DOI]

Robert P. Kurshan

Theor. Comput. Sci., 2004

Extremal set systems with restricted k-wise intersections.

[BibT_eX]

[DOI]

Benny Sudakov

J. Comb. Theory A, 2004

Multiply intersecting families of sets.

[BibT_eX]

[DOI]

Zsolt Katona

J. Comb. Theory A, 2004

2003

Exact Bounds on the Sizes of Covering Codes.

[BibT_eX]

[DOI]

Maria Axenovich

Des. Codes Cryptogr., 2003

The Tura'n Density of the Hypergraph {abc, ade, bde, cde}.

[BibT_eX]

[DOI]

Oleg Pikhurko

Miklós Simonovits

Electron. J. Comb., 2003

2002

On splittable colorings of graphs and hypergraphs.

[BibT_eX]

[DOI]

Radhika Ramamurthi

J. Graph Theory, 2002

Turán problems for integer-weighted graphs.

[BibT_eX]

[DOI]

André Kündgen

J. Graph Theory, 2002

On the maximum size of (p, Q)-free families.

[BibT_eX]

[DOI]

Discret. Math., 2002

Hamiltonian Kneser Graphs.

[BibT_eX]

[DOI]

Ya-Chen Chen

Comb., 2002

2001

Embedding of graphs in two-irregular graphs.

[BibT_eX]

[DOI]

Maria Axenovich

J. Graph Theory, 2001

Covering Non-uniform Hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2001

Ramsey Theory and Bandwidth of Graphs.

[BibT_eX]

[DOI]

Douglas B. West

Graphs Comb., 2001

Maximal t-Critical Linear Hypergraphs.

[BibT_eX]

[DOI]

Graphs Comb., 2001

On the Maximum Size of (p, Q) - free Families.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2001

Covering a graph with cuts of minimum total size.

[BibT_eX]

[DOI]

André Kündgen

Discret. Math., 2001

On the lattice diameter of a convex polygon.

[BibT_eX]

[DOI]

Discret. Math., 2001

2000

Multiple vertex coverings by specified induced subgraphs.

[BibT_eX]

[DOI]

Douglas B. West

J. Graph Theory, 2000

The Maximum Size of 3-Uniform Hypergraphs Not Containing a Fano Plane.

[BibT_eX]

[DOI]

Dominique de Caen

J. Comb. Theory B, 2000

On Generalized Ramsey Theory: The Bipartite Case.

[BibT_eX]

[DOI]

Maria Axenovich

J. Comb. Theory B, 2000

1999

An Improved Upper Bound of the Rate of Euclidean Superimposed Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

Signed Domination in Regular Graphs and Set-Systems.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

Induced subgraphs of given sizes.

[BibT_eX]

[DOI]

Discret. Math., 1999

1998

Minimal Oriented Graphs of Diameter 2.

[BibT_eX]

[DOI]

Graphs Comb., 1998

On the Double Competition Number.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1998

Difference Sets and Computability Theory.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1998

1997

On the existence of countable universal graphs.

[BibT_eX]

[DOI]

Péter Komjáth

J. Graph Theory, 1997

Nonexistence of Universal Graphs Without Some Trees.

[BibT_eX]

[DOI]

Péter Komjáth

Comb., 1997

1996

Scrambling permutations and entropy of hypergraphs.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1996

On the Number of Edges of Quadrilateral-Free Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1996

On r-Cover-free Families.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1996

New Asymptotics for Bipartite Turán Numbers.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1996

An Upper Bound on Zarankiewicz' Problem.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1996

Difference Sets and Inverting the Difference Operator.

[BibT_eX]

[DOI]

Carl G. Jockusch Jr.

Lee A. Rubel

Comb., 1996

1995

Graphs of Prescribed Girth and Bi-Degree.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

Cross-Intersecting Families of Finite Sets.

[BibT_eX]

J. Comb. Theory A, 1995

Extremal Graphs for Intersecting Triangles.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1995

1994

Random Ramsey graphs for the four-cycle.

[BibT_eX]

[DOI]

Discret. Math., 1994

Intersecting designs from linear programming and graphs of diameter two.

[BibT_eX]

[DOI]

Discret. Math., 1994

On the Maximum Number of Triangles in Wheel-Free Graphs.

[BibT_eX]

[DOI]

Michel X. Goemans

Comb. Probab. Comput., 1994

The Prison Yard Problem.

[BibT_eX]

[DOI]

Comb., 1994

1993

Covering the Cube by Affine Hyperplanes.

[BibT_eX]

[DOI]

Eur. J. Comb., 1993

The grid revisted.

[BibT_eX]

[DOI]

Discret. Math., 1993

On the fractional matching polytope of a hypergraph.

[BibT_eX]

[DOI]

Jeff Kahn

Paul D. Seymour

Comb., 1993

1992

Volumes Spanned by Random Points in the Hypercube.

[BibT_eX]

[DOI]

Martin E. Dyer

Colin McDiarmid

Random Struct. Algorithms, 1992

On zero-trees.

[BibT_eX]

[DOI]

J. Graph Theory, 1992

The maximum number of edges in a minimal graph of diameter 2.

[BibT_eX]

[DOI]

J. Graph Theory, 1992

Sets of vectors with many orthogonal paris.

[BibT_eX]

[DOI]

Richard P. Stanley

Graphs Comb., 1992

Spanning subgraphs of random graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1992

Davenport-Schinzel theory of matrices.

[BibT_eX]

[DOI]

Péter Hajnal

Discret. Math., 1992

Indecomposable regular graphs and hypergraphs.

[BibT_eX]

[DOI]

Discret. Math., 1992

Point Selections and Weak e-Nets for Convex Hulls.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1992

1991

Maximal Independent Subsets in Steiner Systems and in Planar Sets.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1991

Midpoints of Diagonals of Convex n-GONS.

[BibT_eX]

[DOI]

Paul Erdös

Peter C. Fishburn

SIAM J. Discret. Math., 1991

Beyond the Erdös-Ko-Rado theorem.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1991

Covering t-element Sets by Partitions.

[BibT_eX]

[DOI]

Eur. J. Comb., 1991

A sharpening of Fisher's inequality.

[BibT_eX]

[DOI]

Discret. Math., 1991

Saturated r-uniform hypergraphs.

[BibT_eX]

[DOI]

Paul Erdös

Zsolt Tuza

Discret. Math., 1991

The Densest Packing of Equal Circles into a Parallel Strip.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1991

On a Turán type problem of Erdös.

[BibT_eX]

[DOI]

Comb., 1991

1990

Competition Graphs and Clique Dimensions.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1990

Representations of families of triples over GF(2).

[BibT_eX]

[DOI]

J. Comb. Theory A, 1990

Covering pairs by q2 + q + 1 sets.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1990

The maximum number of unit distances in a convex n-gon.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1990

Graphs of diameter 3 with the minimum number of edges.

[BibT_eX]

[DOI]

Graphs Comb., 1990

Sphere coverings of the hypercube with incomparable centers.

[BibT_eX]

[DOI]

Jeff Kahn

Discret. Math., 1990

Perfect error-correcting databases.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1990

Singularities of Minimal Surfaces and Networks and Related Extremal Problems in Minkowski Space.

[BibT_eX]

[DOI]

Jeffrey C. Lagarias

Frank Morgan

Proceedings of the Discrete and Computational Geometry: Papers from the DIMACS Special Year, 1990

Random Volumes in the n-Cube.

[BibT_eX]

[DOI]

Martin E. Dyer

Colin McDiarmid

Proceedings of the Polyhedral Combinatorics, 1990

1989

Pair Labeelings with Given Distance.

[BibT_eX]

[DOI]

Jerrold R. Griggs

SIAM J. Discret. Math., 1989

Extremal problems whose solutions are the blowups of the small witt-designs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1989

Maximal intersecting families and affine regular polygons in PG(2, q).

[BibT_eX]

[DOI]

Endre Boros

Jeff Kahn

J. Comb. Theory A, 1989

A minimal cutset of the boolean lattice with almost all members.

[BibT_eX]

[DOI]

Jerrold R. Griggs

Graphs Comb., 1989

Legitimate colorings of projective planes.

[BibT_eX]

[DOI]

Graphs Comb., 1989

Covering the complete graph by partitions.

[BibT_eX]

[DOI]

Discret. Math., 1989

A projective plane is an outstanding 2-cover.

[BibT_eX]

[DOI]

Discret. Math., 1989

On Representing Sylvester- Gallai Designs.

[BibT_eX]

[DOI]

Endre Boros

Leroy M. Kelly

Discret. Comput. Geom., 1989

On the Number of Halving Planes.

[BibT_eX]

[DOI]

László Lovász

Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988

On the Fractional Covering Number of Hypergraphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1988

On induced subgraphs of the cube.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1988

Matchings and covers in hypergraphs.

[BibT_eX]

[DOI]

Graphs Comb., 1988

Rectangular Dissections of a Square.

[BibT_eX]

[DOI]

Endre Boros

Eur. J. Comb., 1988

Multicolored lines in a finite geometry.

[BibT_eX]

[DOI]

Ivo G. Rosenberg

Discret. Math., 1988

1987

The number of maximal independent sets in connected graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1987

Exact solution of some Turán-type problems.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1987

The maximum number of balancing sets.

[BibT_eX]

[DOI]

Graphs Comb., 1987

Bounding one-way differences.

[BibT_eX]

[DOI]

János Pach

Graphs Comb., 1987

On the kernel of intersecting families.

[BibT_eX]

[DOI]

Graphs Comb., 1987

Ramsey-Sperner theory.

[BibT_eX]

[DOI]

Discret. Math., 1987

Computing the Volume is Difficulte.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1987

1986

Extremal problems concerning Kneser graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1986

Non-trivial intersecting families.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1986

The chromatic index of simple hypergraphs.

[BibT_eX]

[DOI]

Graphs Comb., 1986

t-expansive andt-wise intersecting hypergraphs.

[BibT_eX]

[DOI]

Graphs Comb., 1986

Colouring finite incidence structures.

[BibT_eX]

[DOI]

J. Csima

Graphs Comb., 1986

Coloring graphs with locally few colors.

[BibT_eX]

[DOI]

Discret. Math., 1986

Forbidden submatrices.

[BibT_eX]

[DOI]

Richard P. Anstee

Discret. Math., 1986

Random Polytopes in the d-Dimensional Cube.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1986

Families of finite sets with minimum shadows.

[BibT_eX]

[DOI]

Jerrold R. Griggs

Comb., 1986

Finite projective spaces and intersecting hypergraphs.

[BibT_eX]

[DOI]

Comb., 1986

Computing the Volume Is Difficult

[BibT_eX]

[DOI]

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985

Forbidding Just One Intersection.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1985

A Ramsey-Sperner theorem.

[BibT_eX]

[DOI]

Graphs Comb., 1985

Separating Pairs of Points by Standard Boxes.

[BibT_eX]

[DOI]

Meir Katchalski

Eur. J. Comb., 1985

Hypergraphs without a large star.

[BibT_eX]

[DOI]

Zsolt Tuza

Discret. Math., 1985

Minimum matrix representation of closure operations.

[BibT_eX]

[DOI]

János Demetrovics

Discret. Appl. Math., 1985

Set-systems with three intersections.

[BibT_eX]

[DOI]

Comb., 1985

1984

On Hypergraphs without Two Edges Intersecting in a Given Number of Vertices.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1984

Geometrical Solution of an Intersection Problem for Two Hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1984

Union-free Hypergraphs and Probability Theory.

[BibT_eX]

[DOI]

Eur. J. Comb., 1984

An exact result for 3-graphs.

[BibT_eX]

[DOI]

Discret. Math., 1984

A new extremal property of Steiner triple-systems.

[BibT_eX]

[DOI]

Discret. Math., 1984

Hypergraphs in which all disjoint pairs have distinct unions.

[BibT_eX]

[DOI]

Comb., 1984

1983

Graphs without quadrilaterals.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1983

Mental Poker with Three or More Players

[BibT_eX]

[DOI]

Inf. Control., 1983

On finite set-systems whose every intersection is a Kernel of a star.

[BibT_eX]

[DOI]

Discret. Math., 1983

A new generation of the Erdös - Ko - Rado theorem.

[BibT_eX]

[DOI]

Comb., 1983

1982

An Intersection Problem Whose Extremum Is the Finite Projective Space.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1982

Families of Finite Sets in Which No Set Is Covered by the Union of Two Others.

[BibT_eX]

[DOI]

Paul Erdös

J. Comb. Theory A, 1982

Set-systems with prescribed cardinalities for pairwise intersections.

[BibT_eX]

[DOI]

Discret. Math., 1982

1981

A short proof for a theorem of Harper about Hamming-spheres.

[BibT_eX]

[DOI]

Discret. Math., 1981

The eigenvalues of random symmetric matrices.

[BibT_eX]

[DOI]

János Komlós

Comb., 1981

Maximum degree and fractional matchings in uniform hypergraphs.

[BibT_eX]

[DOI]

Comb., 1981

1980

The Erdös-Ko-Rado Theorem for Integer Sequences.

[BibT_eX]

[DOI]

SIAM J. Algebraic Discret. Methods, 1980

On Maximal Intersecting Families of Finite Sets.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1980

On Automorphisms of Line-graphs.

[BibT_eX]

[DOI]

Péter L. Erdös