Peter Frankl

Period. Math. Hung., March, 2026

Critically intersecting hypergraphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2026

On the matching problem in random hypergraphs.

[BibT_eX]

[DOI]

,

Jiaxi Nie

,

Discret. Math., 2026

On r-wise t-intersecting Uniform Families.

[BibT_eX]

[DOI]

,

Comb., August, 2025

The Hajnal-Rothschild problem.

[BibT_eX]

[DOI]

,

CoRR, February, 2025

Intersection Problems and a Correlation Inequality for Integer Sequences.

[BibT_eX]

[DOI]

,

SIAM J. Discret. Math., 2025

Maximal Degrees in Subgraphs of Kneser Graphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 2025

Intersecting families with covering number three.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 2025

Non-trivial r-wise agreeing families.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2025

On the C-diversity of intersecting k-graphs.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2025

Intersecting families with covering number five.

[BibT_eX]

[DOI]

,

Discret. Math., 2025

On the maximum diversity of hypergraphs with fixed matching number.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2025

New Bounds on Families without Large Sunflowers.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2025

Turán graphs with bounded matching number.

[BibT_eX]

[DOI]

Noga Alon

,

J. Comb. Theory B, March, 2024

Intersection theorems for (-1,0,1)-vectors.

[BibT_eX]

[DOI]

,

Eur. J. Comb., March, 2024

Families with restricted matching number and multiply covered shadows.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., March, 2024

Four-vertex traces of finite sets.

[BibT_eX]

[DOI]

,

Graphs Comb., February, 2024

On the Holroyd-Talbot conjecture for sparse graphs.

[BibT_eX]

[DOI]

,

Glenn Hurlbert

Discret. Math., January, 2024

Non-trivial t-intersecting separated families.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., January, 2024

Intersecting families without unique shadow.

[BibT_eX]

[DOI]

,

Comb. Probab. Comput., January, 2024

Odd-sunflowers.

[BibT_eX]

[DOI]

,

,

Dömötör Pálvölgyi

J. Comb. Theory, Ser. A, 2024

Variations on the Bollobás set-pair theorem.

[BibT_eX]

[DOI]

Gábor Hegedüs

,

Eur. J. Comb., 2024

Improved bounds on the maximum diversity of intersecting families.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2024

Extremal Results for Graphs Avoiding a Rainbow Subgraph.

[BibT_eX]

[DOI]

,

,

,

,

,

,

,

Electron. J. Comb., 2024

Improved Bounds Concerning the Maximum Degree of Intersecting Hypergraphs.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2024

On the Maximum of the Sum of the Sizes of Non-trivial Cross-Intersecting Families.

[BibT_eX]

[DOI]

Comb., 2024

Some inequalities concerning cross-intersecting families of integer sequences.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., December, 2023

A product version of the Hilton-Milner theorem.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, November, 2023

Uniform intersecting families with large covering number.

[BibT_eX]

[DOI]

,

Eur. J. Comb., October, 2023

Piercing the Chessboard.

[BibT_eX]

[DOI]

,

,

,

SIAM J. Discret. Math., September, 2023

Intersections and distinct intersections in cross-intersecting families.

[BibT_eX]

[DOI]

,

Eur. J. Comb., May, 2023

Perfect matchings in down-sets.

[BibT_eX]

[DOI]

,

Discret. Math., May, 2023

Best possible bounds on the number of distinct differences in intersecting families.

[BibT_eX]

[DOI]

,

Sergei Kiselev

,

Eur. J. Comb., 2023

On Non-Empty Cross-Intersecting Families.

[BibT_eX]

[DOI]

Chao Shi

,

,

Jianguo Qian

Comb., December, 2022

Exchange Properties of Finite Set-Systems.

[BibT_eX]

[DOI]

,

,

Dömötör Pálvölgyi

SIAM J. Discret. Math., September, 2022

A Finite Set Intersection Theorem.

[BibT_eX]

[DOI]

J. Multiple Valued Log. Soft Comput., 2022

The Erdős Matching Conjecture and concentration inequalities.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 2022

On the maximum number of edges in hypergraphs with fixed matching and clique number.

[BibT_eX]

[DOI]

,

Erica L. L. Liu

,

Eur. J. Comb., 2022

Pseudo sunflowers.

[BibT_eX]

[DOI]

Eur. J. Comb., 2022

On the sum of sizes of overlapping families.

[BibT_eX]

[DOI]

,

Discret. Math., 2022

On the maximum number of distinct intersections in an intersecting family.

[BibT_eX]

[DOI]

,

Sergei Kiselev

,

Discret. Math., 2022

Intersection Theorems for Triangles.

[BibT_eX]

[DOI]

,

Andreas F. Holmsen

,

Discret. Comput. Geom., 2022

On Well-Connected Sets of Strings.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2022

How (Not) to Cut Your Cheese.

[BibT_eX]

[DOI]

Imre Bárány

,

Am. Math. Mon., 2021

On strengthenings of the intersecting shadow theorem.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 2021

Diversity.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 2021

On local Turán problems.

[BibT_eX]

[DOI]

,

Hao Huang

,

J. Comb. Theory A, 2021

Beyond the Erdős Matching Conjecture.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2021

Old and new applications of Katona's circle.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

Analogues of Milner's Theorem for families without long chains and of vector spaces.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

On the size of shadow-added intersecting families.

[BibT_eX]

[DOI]

Eur. J. Comb., 2021

Analogues of Katona's and Milner's theorems for two families.

[BibT_eX]

[DOI]

,

H. W. Willie Wong

Discret. Math., 2021

On the number of distinct differences in an intersecting family.

[BibT_eX]

[DOI]

Discret. Math., 2021

Almost Intersecting Families.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2021

Maximum degree and diversity in intersecting hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2020

Extremal set theory for the binomial norm.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2020

Sharp results concerning disjoint cross-intersecting families.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2020

An improved universal bound for t-intersecting families.

[BibT_eX]

[DOI]

Eur. J. Comb., 2020

On non-trivial families without a perfect matching.

[BibT_eX]

[DOI]

Eur. J. Comb., 2020

Mixed matchings in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2020

Families of finite sets satisfying intersection restrictions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Intersection theorems for (-1, 0, 1)-vectors.

[BibT_eX]

[DOI]

,

CoRR, 2020

Erdős-Ko-Rado Theorem for a Restricted Universe.

[BibT_eX]

[DOI]

Electron. J. Comb., 2020

Two problems on matchings in set families - In the footsteps of Erdős and Kleitman.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 2019

Some exact results for multiply intersecting families.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

Families of sets with no matchings of sizes 3 and 4.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2019

A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2019

Simple juntas for shifted families.

[BibT_eX]

[DOI]

,

CoRR, 2019

Incompatible Intersection Properties.

[BibT_eX]

[DOI]

,

Comb., 2019

An exact result for (0, ± 1)-vectors.

[BibT_eX]

[DOI]

Optim. Lett., 2018

A stability theorem on cube tessellations.

[BibT_eX]

[DOI]

,

J. Comput. Geom., 2018

New inequalities for families without k pairwise disjoint members.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 2018

Erdős-Ko-Rado theorem for {0, ±1}-vectors.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 2018

A degree version of the Hilton-Milner theorem.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory A, 2018

On families of sets without k pairwise disjoint members.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2018

Best possible bounds concerning the set-wise union of families.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Partition-free families of sets.

[BibT_eX]

[DOI]

Discret. Math., 2018

Counting Intersecting and Pairs of Cross-Intersecting Families.

[BibT_eX]

[DOI]

,

Comb. Probab. Comput., 2018

New inequalities for families without k pairwise disjoint members.

[BibT_eX]

[DOI]

,

CoRR, 2018

Resilient Hypergraphs with Fixed Matching Number.

[BibT_eX]

[DOI]

Comb., 2018

Decomposition of a Cube into Nearly Equal Smaller Cubes.

[BibT_eX]

[DOI]

,

Amram Meir

,

Am. Math. Mon., 2017

Families with no s pairwise disjoint sets.

[BibT_eX]

[DOI]

,

J. Lond. Math. Soc., 2017

A stability result for the Katona theorem.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Families with no matchings of size s.

[BibT_eX]

[DOI]

,

Electron. Notes Discret. Math., 2017

A size-sensitive inequality for cross-intersecting families.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2017

A note on Huang-Zhao theorem on intersecting families with large minimum degree.

[BibT_eX]

[DOI]

,

Discret. Math., 2017

A structural result for 3-graphs.

[BibT_eX]

[DOI]

Discret. Math., 2017

On the maximum number of edges in a hypergraph with given matching number.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Uniform s-Cross-Intersecting Families.

[BibT_eX]

[DOI]

,

Comb. Probab. Comput., 2017

A Stability Result for Families with Fixed Diameter.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2017

Partition-free families of sets.

[BibT_eX]

[DOI]

,

CoRR, 2017

Families of vectors without antipodal pairs.

[BibT_eX]

[DOI]

,

CoRR, 2017

Invitation to intersection problems for finite sets.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 2016

Intersection problems in the q-ary cube.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 2016

Uniform eventown problems.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 2016

Multiply union families in Nn.

[BibT_eX]

[DOI]

,

Masashi Shinohara

,

Eur. J. Comb., 2016

A note on supersaturated set systems.

[BibT_eX]

[DOI]

,

Yoshiharu Kohayakawa

,

Eur. J. Comb., 2016

Linear independence, a unifying approach to shadow theorems.

[BibT_eX]

[DOI]

Eur. J. Comb., 2016

Two problems of P. Erdős on matchings in set families.

[BibT_eX]

[DOI]

,

CoRR, 2016

Intersection theorems for {0, ±1}-vectors and s-cross-intersecting families.

[BibT_eX]

[DOI]

,

CoRR, 2016

An Erdős-Ko-Rado theorem for cross t-intersecting families.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory A, 2014

The Katona theorem for vector spaces.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 2013

Two-colorings with many monochromatic cliques in both colors.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory B, 2013

On the number of nonnegative sums.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2013

Improved bounds for Erdős' Matching Conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2013

Maximal independent sets in the covering graph of the cube.

[BibT_eX]

[DOI]

Dwight Duffus

,

,

Discret. Appl. Math., 2013

Some recent results on Ramsey-type numbers.

[BibT_eX]

[DOI]

Andrzej Dudek

,

,

Discret. Appl. Math., 2013

A new short proof of the EKR theorem.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 2012

Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels.

[BibT_eX]

[DOI]

,

,

,

,

,

J. Comb. Theory A, 2012

On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size.

[BibT_eX]

[DOI]

,

,

Andrzej Rucinski

Comb. Probab. Comput., 2012

On Matchings in Hypergraphs.

[BibT_eX]

[DOI]

,

Tomasz Luczak

,

Katarzyna Mieczkowska

Electron. J. Comb., 2012

Maximal independent sets in bipartite graphs obtained from Boolean lattices.

[BibT_eX]

[DOI]

Dwight Duffus

,

,

Eur. J. Comb., 2011

On r-Cross Intersecting Families of Sets.

[BibT_eX]

[DOI]

,

Comb. Probab. Comput., 2011

A Hilton-Milner Theorem for Vector Spaces.

[BibT_eX]

[DOI]

,

,

,

,

,

,

Electron. J. Comb., 2010

A Note on Universal and Canonically Coloured Sequences.

[BibT_eX]

[DOI]

Andrzej Dudek

,

,

Comb. Probab. Comput., 2009

A note on the jumping constant conjecture of Erdös.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory B, 2007

The Maximum Size of 3-Wise Intersecting and 3-Wise Union Families.

[BibT_eX]

[DOI]

,

Graphs Comb., 2006

Weighted Non-Trivial Multiply Intersecting Families.

[BibT_eX]

[DOI]

,

Comb., 2006

Random walks and multiply intersecting families.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 2005

The game of n-times nim.

[BibT_eX]

[DOI]

,

Discret. Math., 2003

Extremal problems on set systems.

[BibT_eX]

[DOI]

,

Random Struct. Algorithms, 2002

Weighted 3-Wise 2-Intersecting Families.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 2002

Set Systems with Restricted Intersections modulo Prime Powers.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory A, 2001

Extremal k-edge-hamiltonian Hypergraphs.

[BibT_eX]

[DOI]

,

Gyula Y. Katona

Electron. Notes Discret. Math., 2001

The Erdos-Ko-Rado Theorem for Integer Sequences.

[BibT_eX]

[DOI]

,

Comb., 1999

Some Inequalities Concerning Cross-Intersecting Families.

[BibT_eX]

[DOI]

,

Comb. Probab. Comput., 1998

Uniform Intersecting Families with Covering Number Restrictions.

[BibT_eX]

[DOI]

,

,

Comb. Probab. Comput., 1998

Covers in Uniform Intersecting Families and a Counterexample to a Conjecture of Lovász.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory A, 1996

Exponents of Uniform L-Systems.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory A, 1996

An Erdos-Ko-Rado Theorem for Direct Products.

[BibT_eX]

[DOI]

Eur. J. Comb., 1996

Uniform Intersecting Families with Covering Number Four.

[BibT_eX]

,

,

J. Comb. Theory A, 1995

Minimum Shadows in Uniform Hypergraphs and a Generalization of the Takagi Function.

[BibT_eX]

,

,

,

J. Comb. Theory A, 1995

On the section of a convex polyhedron.

[BibT_eX]

[DOI]

,

,

Junichiro Nakashima

Discret. Math., 1995

Some best possible bounds concerning the traces of finite sets.

[BibT_eX]

[DOI]

M. Watanabe

,

Graphs Comb., 1994

Density Results for Uniform Families.

[BibT_eX]

[DOI]

,

M. Watanabe

Comb., 1994

Reflecting a triangle in the plane.

[BibT_eX]

[DOI]

Imre Bárány

,

,

Graphs Comb., 1993

Weight functions on the kneser graph and the solution of an intersection problem of Sali.

[BibT_eX]

[DOI]

,

Comb., 1993

Some Best Possible Inequalities Concerning Cross-Intersecting Families.

[BibT_eX]

,

J. Comb. Theory A, 1992

The Uniformity Lemma for hypergraphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 1992

On cross-intersecting families.

[BibT_eX]

[DOI]

Discret. Math., 1992

Improved Upper Bounds Concerning the Erdös-Ko-Rado Theorem.

[BibT_eX]

[DOI]

A. Robert Calderbank

,

Comb. Probab. Comput., 1992

The convex hull of antichains in posets.

[BibT_eX]

[DOI]

Comb., 1992

Sharpening the LYM inequality.

[BibT_eX]

[DOI]

,

,

,

,

Comb., 1992

Beyond the Erdös-Ko-Rado theorem.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 1991

Multiply-intersecting families.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1991

Shadows and shifting.

[BibT_eX]

[DOI]

Graphs Comb., 1991

A sharpening of Fisher's inequality.

[BibT_eX]

[DOI]

,

Discret. Math., 1991

Canonical Antichains on the Circle and Applications.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1990

Iterated combinatorial density theorems.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory A, 1990

Intersection theorems and mod p rank of inclusion matrices.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1990

Asymptotic solution of a turán-type problem.

[BibT_eX]

[DOI]

Graphs Comb., 1990

Simplices with Given 2-Face Areas.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 1990

An intersection problem for codes.

[BibT_eX]

[DOI]

Discret. Math., 1990

Binary codes and quasi-symmetric designs.

[BibT_eX]

[DOI]

A. Robert Calderbank

,

Discret. Math., 1990

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

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 1989

Traces of antichains.

[BibT_eX]

[DOI]

Graphs Comb., 1989

Helly-type Theorems for Varieties.

[BibT_eX]

[DOI]

Eur. J. Comb., 1989

Intersecting Families of Finite Sets and Fixed-point-Free 2-Elements.

[BibT_eX]

[DOI]

Peter J. Cameron

,

,

William M. Kantor

Eur. J. Comb., 1989

A lower bound on the size of a complex generated by an antichain.

[BibT_eX]

[DOI]

Discret. Math., 1989

An extremal problem on Kr-free graphs.

[BibT_eX]

[DOI]

,

J. Graph Theory, 1988

The number of submatrices of a given type in a Hadamard matrix and related results.

[BibT_eX]

[DOI]

,

,

Richard M. Wilson

J. Comb. Theory B, 1988

The Johnson-Lindenstrauss lemma and the sphericity of some graphs.

[BibT_eX]

[DOI]

,

J. Comb. Theory B, 1988

Quantitative theorems for regular systems of equations.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory A, 1988

On the Contact Dimensions of Graphs.

[BibT_eX]

[DOI]

,

Discret. Comput. Geom., 1988

Some Ramsey - Turán type results for hypergraphs.

[BibT_eX]

[DOI]

,

Comb., 1988

Intersection theorems in permutation groups.

[BibT_eX]

[DOI]

Peter J. Cameron

,

,

Comb., 1988

Induced restricted Ramsey theorems for spaces.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory A, 1987

On subsets of abelian groups with no 3-term arithmetic progression.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory A, 1987

The Radon transform on Abelian Groups.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 1987

Exact solution of some Turán-type problems.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 1987

Erdös-Ko-Rado theorem with conditions on the maximal degree.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1987

A helly type theorem for hypersurfaces.

[BibT_eX]

[DOI]

Mikhail Deza

,

J. Comb. Theory A, 1987

Bounding one-way differences.

[BibT_eX]

[DOI]

,

,

Graphs Comb., 1987

Codes with given distances.

[BibT_eX]

[DOI]

,

,

,

Graphs Comb., 1987

The maximum number of edges in a 3-graph not containing a given star.

[BibT_eX]

[DOI]

Fan R. K. Chung

,

Graphs Comb., 1987

Open-interval graphs versus closed-interval graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 1987

Cops and robbers in graphs with large girth and Cayley graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1987

On a pursuit game on Cazley graphs.

[BibT_eX]

[DOI]

Comb., 1987

The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem.

[BibT_eX]

[DOI]

Anders Björner

,

,

Richard P. Stanley

Comb., 1987

The Erdös-Ko-Rado theorem for vector spaces.

[BibT_eX]

[DOI]

,

Richard M. Wilson

J. Comb. Theory A, 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

All rationals occur as exponents.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1986

Some intersection theorems for ordered sets and graphs.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory A, 1986

Large triangle-free subgraphs in graphs withoutK4.

[BibT_eX]

[DOI]

,

Graphs Comb., 1986

The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent.

[BibT_eX]

[DOI]

Paul Erdös

,

,

Graphs Comb., 1986

Embedding the n-cube in Lower Dimensions.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 1986

An Erdös-Ko-Rado Theorem for Integer Sequences of Given Rank.

[BibT_eX]

[DOI]

Konrad Engel

,

Eur. J. Comb., 1986

What must be contained in every oriented k-uniform hypergraph.

[BibT_eX]

[DOI]

Discret. Math., 1986

On Squashed Designs.

[BibT_eX]

[DOI]

,

Discret. Comput. Geom., 1986

Finite projective spaces and intersecting hypergraphs.

[BibT_eX]

[DOI]

,

Comb., 1986

Orthogonal vectors in the n-dimensional cube and codes with missing distances.

[BibT_eX]

[DOI]

Comb., 1986

On the chromatic number of the general Kneser-graph.

[BibT_eX]

[DOI]

J. Graph Theory, 1985

On the size of graphs with complete-factors.

[BibT_eX]

[DOI]

Jin Akiyama

,

J. Graph Theory, 1985

Forbidding Just One Intersection.

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 1985

Lower bounds for Turán's problem.

[BibT_eX]

[DOI]

,

Graphs Comb., 1985

The maximum number of disjoint pairs in a family of subsets.

[BibT_eX]

[DOI]

Noga Alon

,

Graphs Comb., 1985

Near Perfect Coverings in Graphs and Hypergraphs.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 1985

Polytopes Determined by Hypergraph Classes.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 1985

Intersection Theorems for Vector Spaces.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 1985

Good coverings of Hamming spaces with spheres.

[BibT_eX]

[DOI]

Gérard D. Cohen

,

Discret. Math., 1985

Extremal hypergraph problems and convex hulls.

[BibT_eX]

[DOI]

Péter L. Erdös

,

,

Comb., 1985

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

[BibT_eX]

[DOI]

,

J. Comb. Theory A, 1984

Injection geometries.

[BibT_eX]

[DOI]

Mikhail Deza

,

J. Comb. Theory B, 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

A new short proof for the Kruskal-Katona theorem.

[BibT_eX]

[DOI]

Discret. Math., 1984

Families of finite sets with three intersections.

[BibT_eX]

[DOI]

Comb., 1984

On disjointly representable sets.

[BibT_eX]

[DOI]

,

Comb., 1984

Hypergraphs do not jump.

[BibT_eX]

[DOI]

,

Comb., 1984

Intersecting Sperner families and their convex hulls.

[BibT_eX]

[DOI]

Péter L. Erdös

,

,

Comb., 1984

On the Trace of Finite Sets.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1983

Linear Dependencies among Subsets of a Finite Set.

[BibT_eX]

[DOI]

,

Navin M. Singhi

Eur. J. Comb., 1983

On the Number of Sets in a Null t-Design.

[BibT_eX]

[DOI]

,

Eur. J. Comb., 1983

On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer.

[BibT_eX]

[DOI]

,

Andrew M. Odlyzko

Eur. J. Comb., 1983

A probabilistic proof for the lym-inequality.

[BibT_eX]

[DOI]

Discret. Math., 1983

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

[BibT_eX]

[DOI]

,

Comb., 1983

An extremal set theoretical characterization of some Steiner systems.

[BibT_eX]

[DOI]

Comb., 1983

On Functions of Strenth t.

[BibT_eX]

[DOI]

,

,

N. M. Singhi

Comb., 1983

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

An Extremal Problem for two Families of Sets.

[BibT_eX]

[DOI]

Eur. J. Comb., 1982

On the vector space of 0-configurations.

[BibT_eX]

[DOI]

,

Comb., 1982

On a Problem of Chvátal and Erdös on Hypergraphs Containing No Generalized Simplex.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1981

A Finite Set Intersection Theorem.

[BibT_eX]

[DOI]

,

Ivo G. Rosenberg

Eur. J. Comb., 1981

On Large Vector Systems with Equal Scalar Products.

[BibT_eX]

[DOI]

Eur. J. Comb., 1981

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

[BibT_eX]

[DOI]

,

Discret. Math., 1981

Intersection theorems with geometric consequences.

[BibT_eX]

[DOI]

,

Richard M. Wilson

Comb., 1981

Every large set of equidistant (0, +1, -1)-vectors forms a sunflower.

[BibT_eX]

[DOI]

,

Comb., 1981

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

[BibT_eX]

[DOI]

,

SIAM J. Algebraic Discret. Methods, 1980

On Set Intersections.

[BibT_eX]

[DOI]

László Babai

,

J. Comb. Theory A, 1980

Extremal Problems and Coverings of the Space.

[BibT_eX]

[DOI]

Eur. J. Comb., 1980

On tilings of the binary vector space.

[BibT_eX]

[DOI]

Gérard D. Cohen

,

Discret. Math., 1980

On the maximum number of edges in a hypergraph whose linegraph contains no cycle.

[BibT_eX]

[DOI]

Jean-Claude Bermond

,

,

F. Sterboul

Discret. Math., 1980

On the number of maximal dependencies in a data base relation of fixed order.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 1980

Families of finite sets satisfying a union condition.

[BibT_eX]

[DOI]

Discret. Math., 1979

On Intersecting Families of Finite Sets.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1978

On the Maximum Number of Permutations with Given Maximal or Minimal Distance.

[BibT_eX]

[DOI]

,

Mikhail Deza

J. Comb. Theory A, 1977

On the Minimum Number of Disjoint Pairs in a Family of Finite Sets.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1977

On Sperner Families Satisfying an Additional Condition.

[BibT_eX]

[DOI]

J. Comb. Theory A, 1976

The Proof of a Conjecture of G. O. H. Katona.

[BibT_eX]

[DOI]