Peter Frankl

265 papers A* 2A 1Journal 262
YearRankTypeTitle / Venue / Authors
2026 J jnl
Critically intersecting hypergraphs.
Eur. J. Comb.
Peter Frankl
2026 J jnl
On the matching problem in random hypergraphs.
Discret. Math.
Peter Frankl, Jiaxi Nie, Jian Wang
2026 J jnl
On the maximum size of substructures with fixed matching number.
Period. Math. Hung.
Peter Frankl
2025 J jnl
Intersecting families with covering number five.
Discret. Math.
Peter Frankl, Jian Wang
2025 J jnl
Intersecting families with covering number three.
J. Comb. Theory B
Peter Frankl, Jian Wang
2025 J jnl
Intersection Problems and a Correlation Inequality for Integer Sequences.
SIAM J. Discret. Math.
Peter Frankl, Andrey Kupavskii
2025 J jnl
Maximal Degrees in Subgraphs of Kneser Graphs.
J. Graph Theory
Peter Frankl, Andrey Kupavskii
2025 J jnl
New Bounds on Families without Large Sunflowers.
Electron. J. Comb.
Peter Frankl, Jian Wang
2025 J jnl
Non-trivial r-wise agreeing families.
Eur. J. Comb.
Peter Frankl, Andrey Kupavskii
2025 J jnl
On r-wise t-intersecting Uniform Families.
Comb.
Peter Frankl, Jian Wang
2025 J jnl
On the C-diversity of intersecting k-graphs.
Eur. J. Comb.
Peter Frankl, Jian Wang
2025 J jnl
On the maximum diversity of hypergraphs with fixed matching number.
Discret. Appl. Math.
Peter Frankl, Jian Wang
2025 J jnl
The Hajnal-Rothschild problem.
CoRR
Peter Frankl, Andrey Kupavskii
2024 J jnl
Extremal Results for Graphs Avoiding a Rainbow Subgraph.
Electron. J. Comb.
Zhen He, Peter Frankl, Ervin Györi, Zequn Lv, Nika Salia, Casey Tompkins, Kitti Varga, Xiutao Zhu
2024 J jnl
Families with restricted matching number and multiply covered shadows.
Discret. Math.
Peter Frankl, Baolong Shang, Jian Wang, Jie You
2024 J jnl
Four-vertex traces of finite sets.
Graphs Comb.
Peter Frankl, Jian Wang
2024 J jnl
Improved Bounds Concerning the Maximum Degree of Intersecting Hypergraphs.
Electron. J. Comb.
Peter Frankl, Jian Wang
2024 J jnl
Improved bounds on the maximum diversity of intersecting families.
Eur. J. Comb.
Peter Frankl, Jian Wang
2024 J jnl
Intersecting families without unique shadow.
Comb. Probab. Comput.
Peter Frankl, Jian Wang
2024 J jnl
Intersection theorems for (-1,0,1)-vectors.
Eur. J. Comb.
Peter Frankl, Andrey Kupavskii
2024 J jnl
Non-trivial t-intersecting separated families.
Discret. Appl. Math.
Peter Frankl, Erica L. L. Liu, Jian Wang, Zhe Yang
2024 J jnl
Odd-sunflowers.
J. Comb. Theory, Ser. A
Peter Frankl, János Pach, Dömötör Pálvölgyi
2024 J jnl
On the Holroyd-Talbot conjecture for sparse graphs.
Discret. Math.
Peter Frankl, Glenn Hurlbert
2024 J jnl
On the Maximum of the Sum of the Sizes of Non-trivial Cross-Intersecting Families.
Comb.
Peter Frankl
2024 J jnl
Turán graphs with bounded matching number.
J. Comb. Theory B
Noga Alon, Peter Frankl
2024 J jnl
Variations on the Bollobás set-pair theorem.
Eur. J. Comb.
Gábor Hegedüs, Peter Frankl
2023 J jnl
A product version of the Hilton-Milner theorem.
J. Comb. Theory A
Peter Frankl, Jian Wang
2023 J jnl
Best possible bounds on the number of distinct differences in intersecting families.
Eur. J. Comb.
Peter Frankl, Sergei Kiselev, Andrey Kupavskii
2023 J jnl
Intersections and distinct intersections in cross-intersecting families.
Eur. J. Comb.
Peter Frankl, Jian Wang
2023 J jnl
Perfect matchings in down-sets.
Discret. Math.
Peter Frankl, Andrey Kupavskii
2023 J jnl
Piercing the Chessboard.
SIAM J. Discret. Math.
Gergely Ambrus, Imre Bárány, Peter Frankl, Dániel Varga
2023 J jnl
Some inequalities concerning cross-intersecting families of integer sequences.
Discret. Math.
Peter Frankl, Erica L. L. Liu, Jian Wang, Zhe Yang
2023 J jnl
Uniform intersecting families with large covering number.
Eur. J. Comb.
Peter Frankl, Andrey Kupavskii
2022 J jnl
A Finite Set Intersection Theorem.
J. Multiple Valued Log. Soft Comput.
Peter Frankl
2022 A conf
A Variant of the VC-Dimension with Applications to Depth-3 Circuits.
ITCS
Peter Frankl, Svyatoslav Gryaznov, Navid Talebanfard
2022 J jnl
Exchange Properties of Finite Set-Systems.
SIAM J. Discret. Math.
Peter Frankl, János Pach, Dömötör Pálvölgyi
2022 J jnl
Intersection Theorems for Triangles.
Discret. Comput. Geom.
Peter Frankl, Andreas F. Holmsen, Andrey Kupavskii
2022 J jnl
On Non-Empty Cross-Intersecting Families.
Comb.
Chao Shi, Peter Frankl, Jianguo Qian
2022 J jnl
On Well-Connected Sets of Strings.
Electron. J. Comb.
Peter Frankl, János Pach
2022 J jnl
On the maximum number of distinct intersections in an intersecting family.
Discret. Math.
Peter Frankl, Sergei Kiselev, Andrey Kupavskii
2022 J jnl
On the maximum number of edges in hypergraphs with fixed matching and clique number.
Eur. J. Comb.
Peter Frankl, Erica L. L. Liu, Jian Wang
2022 J jnl
On the sum of sizes of overlapping families.
Discret. Math.
Peter Frankl, Jian Wang
2022 J jnl
Perfect matchings in down-sets.
CoRR
Peter Frankl, Andrey Kupavskii
2022 J jnl
Pseudo sunflowers.
Eur. J. Comb.
Peter Frankl
2022 J jnl
The Erdős Matching Conjecture and concentration inequalities.
J. Comb. Theory B
Peter Frankl, Andrey Kupavskii
2022 J jnl
Turán graphs with bounded matching number.
CoRR
Noga Alon, Peter Frankl
2021 J jnl
A Variant of the VC-dimension with Applications to Depth-3 Circuits.
CoRR
Peter Frankl, Svyatoslav Gryaznov, Navid Talebanfard
2021 J jnl
Almost Intersecting Families.
Electron. J. Comb.
Peter Frankl, Andrey Kupavskii
2021 J jnl
Analogues of Katona's and Milner's theorems for two families.
Discret. Math.
Peter Frankl, H. W. Willie Wong
2021 J jnl
Analogues of Milner's Theorem for families without long chains and of vector spaces.
Eur. J. Comb.
Peter Frankl
2021 J jnl
Best possible bounds on the number of distinct differences in intersecting families.
CoRR
Peter Frankl, Sergei Kiselev, Andrey Kupavskii
2021 J jnl
Beyond the Erdős Matching Conjecture.
Eur. J. Comb.
Peter Frankl, Andrey Kupavskii
2021 J jnl
Diversity.
J. Comb. Theory A
Peter Frankl, Andrey Kupavskii
2021 J jnl
How (Not) to Cut Your Cheese.
Am. Math. Mon.
Imre Bárány, Peter Frankl
2021 J jnl
Old and new applications of Katona's circle.
Eur. J. Comb.
Peter Frankl
2021 J jnl
On local Turán problems.
J. Comb. Theory A
Peter Frankl, Hao Huang, Vojtech Rödl
2021 J jnl
On strengthenings of the intersecting shadow theorem.
J. Comb. Theory A
Peter Frankl, Gyula O. H. Katona
2021 J jnl
On the maximum number of distinct intersections in an intersecting family.
CoRR
Peter Frankl, Sergei Kiselev, Andrey Kupavskii
2021 J jnl
On the number of distinct differences in an intersecting family.
Discret. Math.
Peter Frankl
2021 J jnl
On the size of shadow-added intersecting families.
Eur. J. Comb.
Peter Frankl
2021 J jnl
Uniform intersecting families with large covering number.
CoRR
Peter Frankl, Andrey Kupavskii
2020 J jnl
Almost intersecting families.
CoRR
Peter Frankl, Andrey Kupavskii
2020 J jnl
An improved universal bound for t-intersecting families.
Eur. J. Comb.
Peter Frankl
2020 J jnl
Erdős-Ko-Rado Theorem for a Restricted Universe.
Electron. J. Comb.
Peter Frankl
2020 J jnl
Extremal set theory for the binomial norm.
J. Comb. Theory A
Peter Frankl
2020 J jnl
Families of finite sets satisfying intersection restrictions.
Discret. Appl. Math.
Peter Frankl
2020 J jnl
Intersection theorems for (-1, 0, 1)-vectors.
CoRR
Peter Frankl, Andrey Kupavskii
2020 J jnl
Intersection theorems for triangles.
CoRR
Peter Frankl, Andreas F. Holmsen, Andrey Kupavskii
2020 J jnl
Maximal degrees in subgraphs of Kneser graphs.
CoRR
Peter Frankl, Andrey Kupavskii
2020 J jnl
Maximum degree and diversity in intersecting hypergraphs.
J. Comb. Theory B
Peter Frankl
2020 J jnl
Mixed matchings in graphs.
Discret. Math.
Peter Frankl
2020 J jnl
On non-trivial families without a perfect matching.
Eur. J. Comb.
Peter Frankl
2020 J jnl
Sharp results concerning disjoint cross-intersecting families.
Eur. J. Comb.
Peter Frankl, Andrey Kupavskii
2019 J jnl
A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families.
Comb. Probab. Comput.
Peter Frankl
2019 J jnl
Beyond the Erdős Matching Conjecture.
CoRR
Peter Frankl, Andrey Kupavskii
2019 J jnl
Families of sets with no matchings of sizes 3 and 4.
Eur. J. Comb.
Peter Frankl, Andrey Kupavskii
2019 J jnl
Incompatible Intersection Properties.
Comb.
Peter Frankl, Andrey Kupavskii
2019 J jnl
Sharp results concerning disjoint cross-intersecting families.
CoRR
Peter Frankl, Andrey Kupavskii
2019 J jnl
Simple juntas for shifted families.
CoRR
Peter Frankl, Andrey Kupavskii
2019 J jnl
Some exact results for multiply intersecting families.
J. Comb. Theory B
Peter Frankl
2019 J jnl
Two problems on matchings in set families - In the footsteps of Erdős and Kleitman.
J. Comb. Theory B
Peter Frankl, Andrey Kupavskii
2018 J jnl
A degree version of the Hilton-Milner theorem.
J. Comb. Theory A
Peter Frankl, Jie Han, Hao Huang, Yi Zhao
2018 J jnl
A stability theorem on cube tessellations.
J. Comput. Geom.
János Pach, Peter Frankl
2018 J jnl
An exact result for (0, ± 1)-vectors.
Optim. Lett.
Peter Frankl
2018 J jnl
Best possible bounds concerning the set-wise union of families.
Eur. J. Comb.
Peter Frankl
2018 J jnl
Counting Intersecting and Pairs of Cross-Intersecting Families.
Comb. Probab. Comput.
Peter Frankl, Andrey Kupavskii
2018 J jnl
Diversity.
CoRR
Peter Frankl, Andrey Kupavskii
2018 J jnl
Erdős-Ko-Rado theorem for {0, ±1}-vectors.
J. Comb. Theory A
Peter Frankl, Andrey Kupavskii
2018 J jnl
Incompatible intersection properties.
CoRR
Peter Frankl, Andrey Kupavskii
2018 J jnl
New inequalities for families without
J. Comb. Theory A
Peter Frankl, Andrey Kupavskii
2018 J jnl
New inequalities for families without k pairwise disjoint members.
CoRR
Peter Frankl, Andrey Kupavskii
2018 J jnl
On families of sets without
J. Comb. Theory B
Peter Frankl
2018 J jnl
Partition-free families of sets.
Discret. Math.
Peter Frankl
2018 J jnl
Resilient Hypergraphs with Fixed Matching Number.
Comb.
Peter Frankl
2017 J jnl
A Stability Result for Families with Fixed Diameter.
Comb. Probab. Comput.
Peter Frankl
2017 J jnl
A note on Huang-Zhao theorem on intersecting families with large minimum degree.
Discret. Math.
Peter Frankl, Norihide Tokushige
2017 J jnl
A size-sensitive inequality for cross-intersecting families.
Eur. J. Comb.
Peter Frankl, Andrey Kupavskii
2017 J jnl
A stability result for the Katona theorem.
J. Comb. Theory B
Peter Frankl
2017 J jnl
A structural result for 3-graphs.
Discret. Math.
Peter Frankl
2017 J jnl
Counting intersecting and pairs of cross-intersecting families.
CoRR
Peter Frankl, Andrey Kupavskii
2017 J jnl
Decomposition of a Cube into Nearly Equal Smaller Cubes.
Am. Math. Mon.
Peter Frankl, Amram Meir, János Pach
2017 J jnl
Families of sets with no matchings of sizes 3 and 4.
CoRR
Peter Frankl, Andrey Kupavskii
2017 J jnl
Families of vectors without antipodal pairs.
CoRR
Peter Frankl, Andrey Kupavskii
2017 J jnl
Families with no matchings of size s.
Electron. Notes Discret. Math.
Peter Frankl, Andrey Kupavskii
2017 J jnl
Families with no s pairwise disjoint sets.
J. Lond. Math. Soc.
Peter Frankl, Andrey Kupavskii
2017 J jnl
On the maximum number of edges in a hypergraph with given matching number.
Discret. Appl. Math.
Peter Frankl
2017 J jnl
Partition-free families of sets.
CoRR
Peter Frankl, Andrey Kupavskii
2017 J jnl
Uniform s-Cross-Intersecting Families.
Comb. Probab. Comput.
Peter Frankl, Andrey Kupavskii
2016 J jnl
A note on supersaturated set systems.
Eur. J. Comb.
Peter Frankl, Yoshiharu Kohayakawa, Vojtech Rödl
2016 J jnl
A size-sensitive inequality for cross-intersecting families.
CoRR
Peter Frankl, Andrey Kupavskii
2016 J jnl
Families with no s pairwise disjoint sets.
CoRR
Peter Frankl, Andrey Kupavskii
2016 J jnl
Intersection problems in the q-ary cube.
J. Comb. Theory A
Peter Frankl, Norihide Tokushige
2016 J jnl
Intersection theorems for {0, ±1}-vectors and s-cross-intersecting families.
CoRR
Peter Frankl, Andrey Kupavskii
2016 J jnl
Invitation to intersection problems for finite sets.
J. Comb. Theory A
Peter Frankl, Norihide Tokushige
2016 J jnl
Linear independence, a unifying approach to shadow theorems.
Eur. J. Comb.
Peter Frankl
2016 J jnl
Multiply union families in N
Eur. J. Comb.
Peter Frankl, Masashi Shinohara, Norihide Tokushige
2016 J jnl
Two problems of P. Erdős on matchings in set families.
CoRR
Peter Frankl, Andrey Kupavskii
2016 J jnl
Uniform eventown problems.
Eur. J. Comb.
Peter Frankl, Norihide Tokushige
2016 J jnl
Uniform s-cross-intersecting families.
CoRR
Peter Frankl, Andrey Kupavskii
2015 J jnl
Erdős-Ko-Rado theorem for {0, ±: 1}-vectors.
CoRR
Peter Frankl, Andrey Kupavskii
2014 J jnl
An Erdős-Ko-Rado theorem for cross t-intersecting families.
J. Comb. Theory A
Peter Frankl, Sangjune Lee, Mark H. Siggers, Norihide Tokushige
2013 J jnl
Improved bounds for Erdős' Matching Conjecture.
J. Comb. Theory A
Peter Frankl
2013 J jnl
Maximal independent sets in the covering graph of the cube.
Discret. Appl. Math.
Dwight Duffus, Peter Frankl, Vojtech Rödl
2013 J jnl
On the number of nonnegative sums.
J. Comb. Theory B
Peter Frankl
2013 J jnl
Some recent results on Ramsey-type numbers.
Discret. Appl. Math.
Andrzej Dudek, Peter Frankl, Vojtech Rödl
2013 J jnl
The Katona theorem for vector spaces.
J. Comb. Theory A
Peter Frankl, Norihide Tokushige
2013 J jnl
Two-colorings with many monochromatic cliques in both colors.
J. Comb. Theory B
Peter Frankl, Mitsuo Kato, Gyula O. H. Katona, Norihide Tokushige
2012 J jnl
A new short proof of the EKR theorem.
J. Comb. Theory A
Peter Frankl, Zoltán Füredi
2012 J jnl
Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels.
J. Comb. Theory A
Noga Alon, Peter Frankl, Hao Huang, Vojtech Rödl, Andrzej Rucinski, Benny Sudakov
2012 J jnl
On Matchings in Hypergraphs.
Electron. J. Comb.
Peter Frankl, Tomasz Luczak, Katarzyna Mieczkowska
2012 J jnl
On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size.
Comb. Probab. Comput.
Peter Frankl, Vojtech Rödl, Andrzej Rucinski
2011 J jnl
Maximal independent sets in bipartite graphs obtained from Boolean lattices.
Eur. J. Comb.
Dwight Duffus, Peter Frankl, Vojtech Rödl
2011 J jnl
On
Comb. Probab. Comput.
Peter Frankl, Norihide Tokushige
2010 J jnl
A Hilton-Milner Theorem for Vector Spaces.
Electron. J. Comb.
Aart Blokhuis, Andries E. Brouwer, Ameera Chowdhury, Peter Frankl, T. Mussche, Balázs Patkós, Tamás Szönyi
2009 J jnl
A Note on Universal and Canonically Coloured Sequences.
Comb. Probab. Comput.
Andrzej Dudek, Peter Frankl, Vojtech Rödl
2008 J jnl
Extremal k-edge-hamiltonian hypergraphs.
Discret. Math.
Peter Frankl, Gyula Y. Katona
2007 J jnl
A note on the jumping constant conjecture of Erdös.
J. Comb. Theory B
Peter Frankl, Yuejian Peng, Vojtech Rödl, John M. Talbot
2006 J jnl
The Maximum Size of 3-Wise Intersecting and 3-Wise Union Families.
Graphs Comb.
Peter Frankl, Norihide Tokushige
2006 J jnl
Weighted Non-Trivial Multiply Intersecting Families.
Comb.
Peter Frankl, Norihide Tokushige
2005 J jnl
Random walks and multiply intersecting families.
J. Comb. Theory A
Peter Frankl, Norihide Tokushige
2003 J jnl
The game of
Discret. Math.
Peter Frankl, Norihide Tokushige
2002 J jnl
Extremal problems on set systems.
Random Struct. Algorithms
Peter Frankl, Vojtech Rödl
2002 J jnl
Weighted 3-Wise 2-Intersecting Families.
J. Comb. Theory A
Peter Frankl, Norihide Tokushige
2001 J jnl
Extremal k-edge-hamiltonian Hypergraphs.
Electron. Notes Discret. Math.
Peter Frankl, Gyula Y. Katona
2001 J jnl
Set Systems with Restricted Intersections modulo Prime Powers.
J. Comb. Theory A
László Babai, Peter Frankl, Samuel Kutin, Daniel Stefankovic
2000 J jnl
Extremal k-edge-hamiltonian Hypergraphs.
Electron. Notes Discret. Math.
Peter Frankl, Gyula Y. Katona
1999 J jnl
The Erdos-Ko-Rado Theorem for Integer Sequences.
Comb.
Peter Frankl, Norihide Tokushige
1998 J jnl
Some Inequalities Concerning Cross-Intersecting Families.
Comb. Probab. Comput.
Peter Frankl, Norihide Tokushige
1998 J jnl
Uniform Intersecting Families with Covering Number Restrictions.
Comb. Probab. Comput.
Peter Frankl, Katsuhiro Ota, Norihide Tokushige
1996 J jnl
An Erdos-Ko-Rado Theorem for Direct Products.
Eur. J. Comb.
Peter Frankl
1996 J jnl
Covers in Uniform Intersecting Families and a Counterexample to a Conjecture of Lovász.
J. Comb. Theory A
Peter Frankl, Katsuhiro Ota, Norihide Tokushige
1996 J jnl
Exponents of Uniform L-Systems.
J. Comb. Theory A
Peter Frankl, Katsuhiro Ota, Norihide Tokushige
1995 J jnl
Minimum Shadows in Uniform Hypergraphs and a Generalization of the Takagi Function.
J. Comb. Theory A
Peter Frankl, Makoto Matsumoto, Imre Z. Ruzsa, Norihide Tokushige
1995 J jnl
On the section of a convex polyhedron.
Discret. Math.
Peter Frankl, Hiroshi Maehara, Junichiro Nakashima
1995 J jnl
Uniform Intersecting Families with Covering Number Four.
J. Comb. Theory A
Peter Frankl, Katsuhiro Ota, Norihide Tokushige
1994 J jnl
Density Results for Uniform Families.
Comb.
Peter Frankl, M. Watanabe
1994 J jnl
Some best possible bounds concerning the traces of finite sets.
Graphs Comb.
M. Watanabe, Peter Frankl
1993 J jnl
Reflecting a triangle in the plane.
Graphs Comb.
Imre Bárány, Peter Frankl, Hiroshi Maehara
1993 J jnl
Weight functions on the kneser graph and the solution of an intersection problem of Sali.
Comb.
Peter Frankl, Norihide Tokushige
1992 J jnl
Improved Upper Bounds Concerning the Erdös-Ko-Rado Theorem.
Comb. Probab. Comput.
A. Robert Calderbank, Peter Frankl
1992 J jnl
On cross-intersecting families.
Discret. Math.
Peter Frankl
1992 J jnl
Sharpening the LYM inequality.
Comb.
Péter L. Erdös, Peter Frankl, Daniel J. Kleitman, Michael E. Saks, László A. Székely
1992 J jnl
Some Best Possible Inequalities Concerning Cross-Intersecting Families.
J. Comb. Theory A
Peter Frankl, Norihide Tokushige
1992 J jnl
The Uniformity Lemma for hypergraphs.
Graphs Comb.
Peter Frankl, Vojtech Rödl
1992 J jnl
The convex hull of antichains in posets.
Comb.
Peter Frankl
1991 J jnl
A sharpening of Fisher's inequality.
Discret. Math.
Peter Frankl, Zoltán Füredi
1991 J jnl
Beyond the Erdös-Ko-Rado theorem.
J. Comb. Theory A
Peter Frankl, Zoltán Füredi
1991 J jnl
Multiply-intersecting families.
J. Comb. Theory B
Peter Frankl
1991 J jnl
Shadows and shifting.
Graphs Comb.
Peter Frankl
1990 J jnl
An intersection problem for codes.
Discret. Math.
Peter Frankl
1990 J jnl
Asymptotic solution of a turán-type problem.
Graphs Comb.
Peter Frankl
1990 J jnl
Binary codes and quasi-symmetric designs.
Discret. Math.
A. Robert Calderbank, Peter Frankl
1990 J jnl
Canonical Antichains on the Circle and Applications.
SIAM J. Discret. Math.
Peter Frankl
1990 J jnl
Intersection theorems and mod
J. Comb. Theory A
Peter Frankl
1990 J jnl
Iterated combinatorial density theorems.
J. Comb. Theory A
Peter Frankl, Ronald L. Graham, Vojtech Rödl
1990 J jnl
Simplices with Given 2-Face Areas.
Eur. J. Comb.
Peter Frankl, Hiroshi Maehara
1989 J jnl
A lower bound on the size of a complex generated by an antichain.
Discret. Math.
Peter Frankl
1989 J jnl
Extremal problems whose solutions are the blowups of the small witt-designs.
J. Comb. Theory A
Peter Frankl, Zoltán Füredi
1989 J jnl
Helly-type Theorems for Varieties.
Eur. J. Comb.
Peter Frankl
1989 J jnl
Intersecting Families of Finite Sets and Fixed-point-Free 2-Elements.
Eur. J. Comb.
Peter J. Cameron, Peter Frankl, William M. Kantor
1989 J jnl
Traces of antichains.
Graphs Comb.
Peter Frankl
1988 J jnl
An extremal problem on
J. Graph Theory
Peter Frankl, János Pach
1988 J jnl
Intersection theorems in permutation groups.
Comb.
Peter J. Cameron, Michel Deza, Peter Frankl
1988 J jnl
On the Contact Dimensions of Graphs.
Discret. Comput. Geom.
Peter Frankl, Hiroshi Maehara
1988 J jnl
Quantitative theorems for regular systems of equations.
J. Comb. Theory A
Peter Frankl, Ronald L. Graham, Vojtech Rödl
1988 J jnl
Some Ramsey - Turán type results for hypergraphs.
Comb.
Peter Frankl, Vojtech Rödl
1988 J jnl
The Johnson-Lindenstrauss lemma and the sphericity of some graphs.
J. Comb. Theory B
Peter Frankl, Hiroshi Maehara
1988 J jnl
The number of submatrices of a given type in a Hadamard matrix and related results.
J. Comb. Theory B
Peter Frankl, Vojtech Rödl, Richard M. Wilson
1987 J jnl
A helly type theorem for hypersurfaces.
J. Comb. Theory A
Mikhail Deza, Peter Frankl
1987 J jnl
Bounding one-way differences.
Graphs Comb.
Peter Frankl, Zoltán Füredi, János Pach
1987 J jnl
Codes with given distances.
Graphs Comb.
Hikoe Enomoto, Peter Frankl, Noboru Ito, Kazumasa Nomura
1987 J jnl
Cops and robbers in graphs with large girth and Cayley graphs.
Discret. Appl. Math.
Peter Frankl
1987 J jnl
Erdös-Ko-Rado theorem with conditions on the maximal degree.
J. Comb. Theory A
Peter Frankl
1987 J jnl
Exact solution of some Turán-type problems.
J. Comb. Theory A
Peter Frankl, Zoltán Füredi
1987 J jnl
Induced restricted Ramsey theorems for spaces.
J. Comb. Theory A
Peter Frankl, Ronald L. Graham, Vojtech Rödl
1987 J jnl
On a pursuit game on Cazley graphs.
Comb.
Peter Frankl
1987 J jnl
On subsets of abelian groups with no 3-term arithmetic progression.
J. Comb. Theory A
Peter Frankl, Ronald L. Graham, Vojtech Rödl
1987 J jnl
Open-interval graphs versus closed-interval graphs.
Discret. Math.
Peter Frankl, Hiroshi Maehara
1987 J jnl
The Radon transform on Abelian Groups.
J. Comb. Theory A
Peter Frankl, Ronald L. Graham
1987 J jnl
The maximum number of edges in a 3-graph not containing a given star.
Graphs Comb.
Fan R. K. Chung, Peter Frankl
1987 J jnl
The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem.
Comb.
Anders Björner, Peter Frankl, Richard P. Stanley
1986 J jnl
All rationals occur as exponents.
J. Comb. Theory A
Peter Frankl
1986 J jnl
An Erdös-Ko-Rado Theorem for Integer Sequences of Given Rank.
Eur. J. Comb.
Konrad Engel, Peter Frankl
1986 A* conf
Complexity classes in communication complexity theory (preliminary version)
FOCS
László Babai, Peter Frankl, Janos Simon
1986 J jnl
Embedding the n-cube in Lower Dimensions.
Eur. J. Comb.
Peter Frankl, Hiroshi Maehara
1986 J jnl
Extremal problems concerning Kneser graphs.
J. Comb. Theory B
Peter Frankl, Zoltán Füredi
1986 J jnl
Finite projective spaces and intersecting hypergraphs.
Comb.
Peter Frankl, Zoltán Füredi
1986 J jnl
Large triangle-free subgraphs in graphs without
Graphs Comb.
Peter Frankl, Vojtech Rödl
1986 J jnl
Non-trivial intersecting families.
J. Comb. Theory A
Peter Frankl, Zoltán Füredi
1986 J jnl
On Squashed Designs.
Discret. Comput. Geom.
Michel Deza, Peter Frankl
1986 J jnl
Orthogonal vectors in the n-dimensional cube and codes with missing distances.
Comb.
Peter Frankl
1986 J jnl
Some intersection theorems for ordered sets and graphs.
J. Comb. Theory A
Fan R. K. Chung, Ronald L. Graham, Peter Frankl, James B. Shearer
1986 J jnl
The Erdös-Ko-Rado theorem for vector spaces.
J. Comb. Theory A
Peter Frankl, Richard M. Wilson
1986 J jnl
The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent.
Graphs Comb.
Paul Erdös, Peter Frankl, Vojtech Rödl
1986 J jnl
What must be contained in every oriented k-uniform hypergraph.
Discret. Math.
Peter Frankl
1985 J jnl
Extremal hypergraph problems and convex hulls.
Comb.
Péter L. Erdös, Peter Frankl, Gyula O. H. Katona
1985 J jnl
Forbidding Just One Intersection.
J. Comb. Theory A
Peter Frankl, Zoltán Füredi
1985 A* conf
Geometrical Realization of Set Systems and Probabilistic Communication Complexity
FOCS
Noga Alon, Peter Frankl, Vojtech Rödl
1985 J jnl
Good coverings of Hamming spaces with spheres.
Discret. Math.
Gérard D. Cohen, Peter Frankl
1985 J jnl
Intersection Theorems for Vector Spaces.
Eur. J. Comb.
Peter Frankl, Ronald L. Graham
1985 J jnl
Lower bounds for Turán's problem.
Graphs Comb.
Peter Frankl, Vojtech Rödl
1985 J jnl
Near Perfect Coverings in Graphs and Hypergraphs.
Eur. J. Comb.
Peter Frankl, Vojtech Rödl
1985 J jnl
On the chromatic number of the general Kneser-graph.
J. Graph Theory
Peter Frankl
1985 J jnl
On the size of graphs with complete-factors.
J. Graph Theory
Jin Akiyama, Peter Frankl
1985 J jnl
Polytopes Determined by Hypergraph Classes.
Eur. J. Comb.
Peter Frankl, Gyula O. H. Katona
1985 J jnl
The maximum number of disjoint pairs in a family of subsets.
Graphs Comb.
Noga Alon, Peter Frankl
1984 J jnl
A new extremal property of Steiner triple-systems.
Discret. Math.
Peter Frankl, Zoltán Füredi
1984 J jnl
A new short proof for the Kruskal-Katona theorem.
Discret. Math.
Peter Frankl
1984 J jnl
An exact result for 3-graphs.
Discret. Math.
Peter Frankl, Zoltán Füredi
1984 J jnl
Families of finite sets with three intersections.
Comb.
Peter Frankl
1984 J jnl
Hypergraphs do not jump.
Comb.
Peter Frankl, Vojtech Rödl
1984 J jnl
Injection geometries.
J. Comb. Theory B
Mikhail Deza, Peter Frankl
1984 J jnl
Intersecting Sperner families and their convex hulls.
Comb.
Péter L. Erdös, Peter Frankl, Gyula O. H. Katona
1984 J jnl
On Hypergraphs without Two Edges Intersecting in a Given Number of Vertices.
J. Comb. Theory A
Peter Frankl, Zoltán Füredi
1984 J jnl
On disjointly representable sets.
Comb.
Peter Frankl, János Pach
1984 J jnl
Union-free Hypergraphs and Probability Theory.
Eur. J. Comb.
Peter Frankl, Zoltán Füredi
1983 J jnl
A new generation of the Erdös - Ko - Rado theorem.
Comb.
Peter Frankl, Zoltán Füredi
1983 J jnl
A probabilistic proof for the lym-inequality.
Discret. Math.
Peter Frankl
1983 J jnl
An extremal set theoretical characterization of some Steiner systems.
Comb.
Peter Frankl
1983 J jnl
Linear Dependencies among Subsets of a Finite Set.
Eur. J. Comb.
Peter Frankl, Navin M. Singhi
1983 J jnl
On Functions of Strenth t.
Comb.
Michel Deza, Peter Frankl, N. M. Singhi
1983 J jnl
On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer.
Eur. J. Comb.
Peter Frankl, Andrew M. Odlyzko
1983 J jnl
On the Number of Sets in a Null t-Design.
Eur. J. Comb.
Peter Frankl, János Pach
1983 J jnl
On the Trace of Finite Sets.
J. Comb. Theory A
Peter Frankl
1982 J jnl
An Extremal Problem for two Families of Sets.
Eur. J. Comb.
Peter Frankl
1982 J jnl
Families of Finite Sets in Which No Set Is Covered by the Union of Two Others.
J. Comb. Theory A
Paul Erdös, Peter Frankl, Zoltán Füredi
1982 J jnl
On the vector space of 0-configurations.
Comb.
Michel Deza, Peter Frankl
1981 J jnl
A Finite Set Intersection Theorem.
Eur. J. Comb.
Peter Frankl, Ivo G. Rosenberg
1981 J jnl
A short proof for a theorem of Harper about Hamming-spheres.
Discret. Math.
Peter Frankl, Zoltán Füredi
1981 J jnl
Every large set of equidistant (0, +1, -1)-vectors forms a sunflower.
Comb.
Michel Deza, Peter Frankl
1981 J jnl
Intersection theorems with geometric consequences.
Comb.
Peter Frankl, Richard M. Wilson
1981 J jnl
On Large Vector Systems with Equal Scalar Products.
Eur. J. Comb.
Peter Frankl
1981 J jnl
On a Problem of Chvátal and Erdös on Hypergraphs Containing No Generalized Simplex.
J. Comb. Theory A
Peter Frankl
1980 J jnl
Extremal Problems and Coverings of the Space.
Eur. J. Comb.
Peter Frankl
1980 J jnl
On Set Intersections.
J. Comb. Theory A
László Babai, Peter Frankl
1980 J jnl
On the maximum number of edges in a hypergraph whose linegraph contains no cycle.
Discret. Math.
Jean-Claude Bermond, Peter Frankl, F. Sterboul
1980 J jnl
On the number of maximal dependencies in a data base relation of fixed order.
Discret. Math.
A. Békéssy, János Demetrovics, László Hannák, Peter Frankl, Gyula O. H. Katona
1980 J jnl
On tilings of the binary vector space.
Discret. Math.
Gérard D. Cohen, Peter Frankl
1980 J jnl
The Erdös-Ko-Rado Theorem for Integer Sequences.
SIAM J. Algebraic Discret. Methods
Peter Frankl, Zoltán Füredi
1979 J jnl
Families of finite sets satisfying a union condition.
Discret. Math.
Peter Frankl
1978 J jnl
On Intersecting Families of Finite Sets.
J. Comb. Theory A
Peter Frankl
1977 J jnl
On the Maximum Number of Permutations with Given Maximal or Minimal Distance.
J. Comb. Theory A
Peter Frankl, Mikhail Deza
1977 J jnl
On the Minimum Number of Disjoint Pairs in a Family of Finite Sets.
J. Comb. Theory A
Peter Frankl
1976 J jnl
On Sperner Families Satisfying an Additional Condition.
J. Comb. Theory A
Peter Frankl
1975 J jnl
The Proof of a Conjecture of G. O. H. Katona.
J. Comb. Theory A
Peter Frankl