Peter Frankl

According to our database1, Peter Frankl authored at least 171 papers between 1975 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Families of sets with no matchings of sizes 3 and 4.
Eur. J. Comb., 2019

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

A stability theorem on cube tessellations.
JoCG, 2018

New inequalities for families without k pairwise disjoint members.
J. Comb. Theory, Ser. A, 2018

Erdős-Ko-Rado theorem for {0, ±1}-vectors.
J. Comb. Theory, Ser. A, 2018

A degree version of the Hilton-Milner theorem.
J. Comb. Theory, Ser. A, 2018

On families of sets without k pairwise disjoint members.
J. Comb. Theory, Ser. B, 2018

Best possible bounds concerning the set-wise union of families.
Eur. J. Comb., 2018

Partition-free families of sets.
Discrete Mathematics, 2018

Counting Intersecting and Pairs of Cross-Intersecting Families.
Combinatorics, Probability & Computing, 2018

Resilient Hypergraphs with Fixed Matching Number.
Combinatorica, 2018

2017
Families with no s pairwise disjoint sets.
J. London Math. Society, 2017

A stability result for the Katona theorem.
J. Comb. Theory, Ser. B, 2017

Families with no matchings of size s.
Electronic Notes in Discrete Mathematics, 2017

A size-sensitive inequality for cross-intersecting families.
Eur. J. Comb., 2017

A note on Huang-Zhao theorem on intersecting families with large minimum degree.
Discrete Mathematics, 2017

A structural result for 3-graphs.
Discrete Mathematics, 2017

On the maximum number of edges in a hypergraph with given matching number.
Discrete Applied Mathematics, 2017

Uniform s-Cross-Intersecting Families.
Combinatorics, Probability & Computing, 2017

A Stability Result for Families with Fixed Diameter.
Combinatorics, Probability & Computing, 2017

2016
Invitation to intersection problems for finite sets.
J. Comb. Theory, Ser. A, 2016

Intersection problems in the q-ary cube.
J. Comb. Theory, Ser. A, 2016

Uniform eventown problems.
Eur. J. Comb., 2016

Multiply union families in Nn.
Eur. J. Comb., 2016

A note on supersaturated set systems.
Eur. J. Comb., 2016

Linear independence, a unifying approach to shadow theorems.
Eur. J. Comb., 2016

2014
An Erdős-Ko-Rado theorem for cross t-intersecting families.
J. Comb. Theory, Ser. A, 2014

2013
The Katona theorem for vector spaces.
J. Comb. Theory, Ser. A, 2013

Two-colorings with many monochromatic cliques in both colors.
J. Comb. Theory, Ser. B, 2013

On the number of nonnegative sums.
J. Comb. Theory, Ser. B, 2013

Improved bounds for Erdős' Matching Conjecture.
J. Comb. Theory, Ser. A, 2013

Maximal independent sets in the covering graph of the cube.
Discrete Applied Mathematics, 2013

Some recent results on Ramsey-type numbers.
Discrete Applied Mathematics, 2013

2012
A new short proof of the EKR theorem.
J. Comb. Theory, Ser. A, 2012

Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels.
J. Comb. Theory, Ser. A, 2012

On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size.
Combinatorics, Probability & Computing, 2012

On Matchings in Hypergraphs.
Electr. J. Comb., 2012

2011
Maximal independent sets in bipartite graphs obtained from Boolean lattices.
Eur. J. Comb., 2011

On r-Cross Intersecting Families of Sets.
Combinatorics, Probability & Computing, 2011

2010
A Hilton-Milner Theorem for Vector Spaces.
Electr. J. Comb., 2010

2009
A Note on Universal and Canonically Coloured Sequences.
Combinatorics, Probability & Computing, 2009

2008
Extremal k-edge-hamiltonian hypergraphs.
Discrete Mathematics, 2008

2007
A note on the jumping constant conjecture of Erdös.
J. Comb. Theory, Ser. B, 2007

2006
The Maximum Size of 3-Wise Intersecting and 3-Wise Union Families.
Graphs and Combinatorics, 2006

Weighted Non-Trivial Multiply Intersecting Families.
Combinatorica, 2006

2005
Random walks and multiply intersecting families.
J. Comb. Theory, Ser. A, 2005

2003
The game of n-times nim.
Discrete Mathematics, 2003

2002
Extremal problems on set systems.
Random Struct. Algorithms, 2002

Weighted 3-Wise 2-Intersecting Families.
J. Comb. Theory, Ser. A, 2002

2001
Set Systems with Restricted Intersections modulo Prime Powers.
J. Comb. Theory, Ser. A, 2001

Extremal k-edge-hamiltonian Hypergraphs.
Electronic Notes in Discrete Mathematics, 2001

2000
Extremal k-edge-hamiltonian Hypergraphs.
Electronic Notes in Discrete Mathematics, 2000

1999
The Erdos-Ko-Rado Theorem for Integer Sequences.
Combinatorica, 1999

1998
Some Inequalities Concerning Cross-Intersecting Families.
Combinatorics, Probability & Computing, 1998

Uniform Intersecting Families with Covering Number Restrictions.
Combinatorics, Probability & Computing, 1998

1996
Covers in Uniform Intersecting Families and a Counterexample to a Conjecture of Lovász.
J. Comb. Theory, Ser. A, 1996

Exponents of Uniform L-Systems.
J. Comb. Theory, Ser. A, 1996

An Erdos-Ko-Rado Theorem for Direct Products.
Eur. J. Comb., 1996

1995
Uniform Intersecting Families with Covering Number Four.
J. Comb. Theory, Ser. A, 1995

Minimum Shadows in Uniform Hypergraphs and a Generalization of the Takagi Function.
J. Comb. Theory, Ser. A, 1995

On the section of a convex polyhedron.
Discrete Mathematics, 1995

1994
Some best possible bounds concerning the traces of finite sets.
Graphs and Combinatorics, 1994

Density Results for Uniform Families.
Combinatorica, 1994

1993
Reflecting a triangle in the plane.
Graphs and Combinatorics, 1993

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

1992
Some Best Possible Inequalities Concerning Cross-Intersecting Families.
J. Comb. Theory, Ser. A, 1992

The Uniformity Lemma for hypergraphs.
Graphs and Combinatorics, 1992

On cross-intersecting families.
Discrete Mathematics, 1992

Improved Upper Bounds Concerning the Erdös-Ko-Rado Theorem.
Combinatorics, Probability & Computing, 1992

The convex hull of antichains in posets.
Combinatorica, 1992

Sharpening the LYM inequality.
Combinatorica, 1992

1991
Beyond the Erdös-Ko-Rado theorem.
J. Comb. Theory, Ser. A, 1991

Multiply-intersecting families.
J. Comb. Theory, Ser. B, 1991

Shadows and shifting.
Graphs and Combinatorics, 1991

A sharpening of Fisher's inequality.
Discrete Mathematics, 1991

1990
Canonical Antichains on the Circle and Applications.
SIAM J. Discrete Math., 1990

Iterated combinatorial density theorems.
J. Comb. Theory, Ser. A, 1990

Intersection theorems and mod p rank of inclusion matrices.
J. Comb. Theory, Ser. A, 1990

Asymptotic solution of a turán-type problem.
Graphs and Combinatorics, 1990

Simplices with Given 2-Face Areas.
Eur. J. Comb., 1990

An intersection problem for codes.
Discrete Mathematics, 1990

Binary codes and quasi-symmetric designs.
Discrete Mathematics, 1990

1989
Extremal problems whose solutions are the blowups of the small witt-designs.
J. Comb. Theory, Ser. A, 1989

Traces of antichains.
Graphs and Combinatorics, 1989

Helly-type Theorems for Varieties.
Eur. J. Comb., 1989

Intersecting Families of Finite Sets and Fixed-point-Free 2-Elements.
Eur. J. Comb., 1989

A lower bound on the size of a complex generated by an antichain.
Discrete Mathematics, 1989

1988
An extremal problem on Kr-free graphs.
Journal of Graph Theory, 1988

The number of submatrices of a given type in a Hadamard matrix and related results.
J. Comb. Theory, Ser. B, 1988

The Johnson-Lindenstrauss lemma and the sphericity of some graphs.
J. Comb. Theory, Ser. B, 1988

Quantitative theorems for regular systems of equations.
J. Comb. Theory, Ser. A, 1988

On the Contact Dimensions of Graphs.
Discrete & Computational Geometry, 1988

Some Ramsey - Turán type results for hypergraphs.
Combinatorica, 1988

Intersection theorems in permutation groups.
Combinatorica, 1988

1987
Induced restricted Ramsey theorems for spaces.
J. Comb. Theory, Ser. A, 1987

On subsets of abelian groups with no 3-term arithmetic progression.
J. Comb. Theory, Ser. A, 1987

The Radon transform on Abelian Groups.
J. Comb. Theory, Ser. A, 1987

Exact solution of some Turán-type problems.
J. Comb. Theory, Ser. A, 1987

Erdös-Ko-Rado theorem with conditions on the maximal degree.
J. Comb. Theory, Ser. A, 1987

A helly type theorem for hypersurfaces.
J. Comb. Theory, Ser. A, 1987

Bounding one-way differences.
Graphs and Combinatorics, 1987

Codes with given distances.
Graphs and Combinatorics, 1987

The maximum number of edges in a 3-graph not containing a given star.
Graphs and Combinatorics, 1987

Open-interval graphs versus closed-interval graphs.
Discrete Mathematics, 1987

Cops and robbers in graphs with large girth and Cayley graphs.
Discrete Applied Mathematics, 1987

On a pursuit game on Cazley graphs.
Combinatorica, 1987

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

1986
The Erdös-Ko-Rado theorem for vector spaces.
J. Comb. Theory, Ser. A, 1986

Extremal problems concerning Kneser graphs.
J. Comb. Theory, Ser. B, 1986

Non-trivial intersecting families.
J. Comb. Theory, Ser. A, 1986

All rationals occur as exponents.
J. Comb. Theory, Ser. A, 1986

Some intersection theorems for ordered sets and graphs.
J. Comb. Theory, Ser. A, 1986

Large triangle-free subgraphs in graphs withoutK4.
Graphs and Combinatorics, 1986

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

Embedding the n-cube in Lower Dimensions.
Eur. J. Comb., 1986

An Erdös-Ko-Rado Theorem for Integer Sequences of Given Rank.
Eur. J. Comb., 1986

What must be contained in every oriented k-uniform hypergraph.
Discrete Mathematics, 1986

On Squashed Designs.
Discrete & Computational Geometry, 1986

Finite projective spaces and intersecting hypergraphs.
Combinatorica, 1986

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

Complexity classes in communication complexity theory (preliminary version)
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985
On the chromatic number of the general Kneser-graph.
Journal of Graph Theory, 1985

On the size of graphs with complete-factors.
Journal of Graph Theory, 1985

Forbidding Just One Intersection.
J. Comb. Theory, Ser. A, 1985

Lower bounds for Turán's problem.
Graphs and Combinatorics, 1985

The maximum number of disjoint pairs in a family of subsets.
Graphs and Combinatorics, 1985

Near Perfect Coverings in Graphs and Hypergraphs.
Eur. J. Comb., 1985

Polytopes Determined by Hypergraph Classes.
Eur. J. Comb., 1985

Intersection Theorems for Vector Spaces.
Eur. J. Comb., 1985

Good coverings of Hamming spaces with spheres.
Discrete Mathematics, 1985

Extremal hypergraph problems and convex hulls.
Combinatorica, 1985

Geometrical Realization of Set Systems and Probabilistic Communication Complexity
Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

1984
On Hypergraphs without Two Edges Intersecting in a Given Number of Vertices.
J. Comb. Theory, Ser. A, 1984

Injection geometries.
J. Comb. Theory, Ser. B, 1984

Union-free Hypergraphs and Probability Theory.
Eur. J. Comb., 1984

An exact result for 3-graphs.
Discrete Mathematics, 1984

A new extremal property of Steiner triple-systems.
Discrete Mathematics, 1984

A new short proof for the Kruskal-Katona theorem.
Discrete Mathematics, 1984

Families of finite sets with three intersections.
Combinatorica, 1984

On disjointly representable sets.
Combinatorica, 1984

Hypergraphs do not jump.
Combinatorica, 1984

Intersecting Sperner families and their convex hulls.
Combinatorica, 1984

1983
On the Trace of Finite Sets.
J. Comb. Theory, Ser. A, 1983

Linear Dependencies among Subsets of a Finite Set.
Eur. J. Comb., 1983

On the Number of Sets in a Null t-Design.
Eur. J. Comb., 1983

On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer.
Eur. J. Comb., 1983

A probabilistic proof for the lym-inequality.
Discrete Mathematics, 1983

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

An extremal set theoretical characterization of some Steiner systems.
Combinatorica, 1983

On Functions of Strenth t.
Combinatorica, 1983

1982
Families of Finite Sets in Which No Set Is Covered by the Union of Two Others.
J. Comb. Theory, Ser. A, 1982

An Extremal Problem for two Families of Sets.
Eur. J. Comb., 1982

On the vector space of 0-configurations.
Combinatorica, 1982

1981
On a Problem of Chvátal and Erdös on Hypergraphs Containing No Generalized Simplex.
J. Comb. Theory, Ser. A, 1981

A Finite Set Intersection Theorem.
Eur. J. Comb., 1981

On Large Vector Systems with Equal Scalar Products.
Eur. J. Comb., 1981

A short proof for a theorem of Harper about Hamming-spheres.
Discrete Mathematics, 1981

Intersection theorems with geometric consequences.
Combinatorica, 1981

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

1980
The Erdös-Ko-Rado Theorem for Integer Sequences.
SIAM J. Matrix Analysis Applications, 1980

On Set Intersections.
J. Comb. Theory, Ser. A, 1980

Extremal Problems and Coverings of the Space.
Eur. J. Comb., 1980

On tilings of the binary vector space.
Discrete Mathematics, 1980

On the maximum number of edges in a hypergraph whose linegraph contains no cycle.
Discrete Mathematics, 1980

On the number of maximal dependencies in a data base relation of fixed order.
Discrete Mathematics, 1980

1979
Families of finite sets satisfying a union condition.
Discrete Mathematics, 1979

1978
On Intersecting Families of Finite Sets.
J. Comb. Theory, Ser. A, 1978

1977
On the Maximum Number of Permutations with Given Maximal or Minimal Distance.
J. Comb. Theory, Ser. A, 1977

On the Minimum Number of Disjoint Pairs in a Family of Finite Sets.
J. Comb. Theory, Ser. A, 1977

1976
On Sperner Families Satisfying an Additional Condition.
J. Comb. Theory, Ser. A, 1976

1975
The Proof of a Conjecture of G. O. H. Katona.
J. Comb. Theory, Ser. A, 1975


  Loading...