 | 2008 |
|---|
| 85 |       | Peter Frankl,
Gyula Y. Katona:
Extremal k-edge-hamiltonian hypergraphs.
Discrete Mathematics 308(8): 1415-1424 (2008) |
| 2007 |
|---|
| 84 | | Peter Frankl,
Yuejian Peng,
Vojtech Rödl,
John M. Talbot:
A note on the jumping constant conjecture of Erdös.
J. Comb. Theory, Ser. B 97(2): 204-216 (2007) |
| 2006 |
|---|
| 83 | | Peter Frankl,
Norihide Tokushige:
Weighted Non-Trivial Multiply Intersecting Families.
Combinatorica 26(1): 37-46 (2006) |
| 82 | | Peter Frankl,
Norihide Tokushige:
The Maximum Size of 3-Wise Intersecting and 3-Wise Union Families.
Graphs and Combinatorics 22(2): 225-231 (2006) |
| 2005 |
|---|
| 81 | | Peter Frankl,
Norihide Tokushige:
Random walks and multiply intersecting families.
J. Comb. Theory, Ser. A 109(1): 121-134 (2005) |
| 2003 |
|---|
| 80 | | Peter Frankl,
Norihide Tokushige:
The game of n-times nim.
Discrete Mathematics 260(1-3): 205-209 (2003) |
| 2002 |
|---|
| 79 | | Peter Frankl,
Norihide Tokushige:
Weighted 3-Wise 2-Intersecting Families.
J. Comb. Theory, Ser. A 100(1): 94-115 (2002) |
| 78 |  | Peter Frankl,
Vojtech Rödl:
Extremal problems on set systems.
Random Struct. Algorithms 20(2): 131-164 (2002) |
| 2001 |
|---|
| 77 | | Peter Frankl,
Gyula Y. Katona:
Extremal k-edge-hamiltonian Hypergraphs.
Electronic Notes in Discrete Mathematics 10: 109-112 (2001) |
| 76 | | László Babai,
Peter Frankl,
Samuel Kutin,
Daniel Stefankovic:
Set Systems with Restricted Intersections modulo Prime Powers.
J. Comb. Theory, Ser. A 95(1): 39-73 (2001) |
| 2000 |
|---|
| 75 | | Peter Frankl,
Gyula Y. Katona:
Extremal k-edge-hamiltonian Hypergraphs.
Electronic Notes in Discrete Mathematics 5: 130-133 (2000) |
| 1999 |
|---|
| 74 | | Peter Frankl,
Norihide Tokushige:
The Erdos-Ko-Rado Theorem for Integer Sequences.
Combinatorica 19(1): 55-63 (1999) |
| 1998 |
|---|
| 73 | | Peter Frankl,
Katsuhiro Ota,
Norihide Tokushige:
Uniform Intersecting Families with Covering Number Restrictions.
Combinatorics, Probability & Computing 7(1): 47-56 (1998) |
| 72 | | Peter Frankl,
Norihide Tokushige:
Some Inequalities Concerning Cross-Intersecting Families.
Combinatorics, Probability & Computing 7(3): 247-260 (1998) |
| 1996 |
|---|
| 71 | | Peter Frankl:
An Erdos-Ko-Rado Theorem for Direct Products.
Eur. J. Comb. 17(8): 727-730 (1996) |
| 70 | | Peter Frankl,
Katsuhiro Ota,
Norihide Tokushige:
Covers in Uniform Intersecting Families and a Counterexample to a Conjecture of Lovász.
J. Comb. Theory, Ser. A 74(1): 33-42 (1996) |
| 69 | | Peter Frankl,
Katsuhiro Ota,
Norihide Tokushige:
Exponents of Uniform L-Systems.
J. Comb. Theory, Ser. A 75(1): 23-43 (1996) |
| 1995 |
|---|
| 68 | | Peter Frankl,
Hiroshi Maehara,
Junichiro Nakashima:
On the section of a convex polyhedron.
Discrete Mathematics 140(1-3): 265-267 (1995) |
| 67 | | Peter Frankl,
Makoto Matsumoto,
Imre Z. Ruzsa,
Norihide Tokushige:
Minimum Shadows in Uniform Hypergraphs and a Generalization of the Takagi Function.
J. Comb. Theory, Ser. A 69(1): 125-148 (1995) |
| 66 | | Peter Frankl,
Katsuhiro Ota,
Norihide Tokushige:
Uniform Intersecting Families with Covering Number Four.
J. Comb. Theory, Ser. A 71(1): 127-145 (1995) |
| 1994 |
|---|
| 65 | | Peter Frankl,
M. Watanabe:
Density Results for Uniform Families.
Combinatorica 14(1): 115-119 (1994) |
| 1993 |
|---|
| 64 | | Peter Frankl,
Norihide Tokushige:
Weight functions on the kneser graph and the solution of an intersection problem of Sali.
Combinatorica 13(4): 413-420 (1993) |
| 1992 |
|---|
| 63 | | Péter L. Erdös,
Peter Frankl,
Daniel J. Kleitman,
Michael E. Saks,
László A. Székely:
Sharpening the LYM inequality.
Combinatorica 12(3): 287-293 (1992) |
| 62 | | Peter Frankl:
The convex hull of antichains in posets.
Combinatorica 12(4): 493-496 (1992) |
| 61 | | A. Robert Calderbank,
Peter Frankl:
Improved Upper Bounds Concerning the Erdös-Ko-Rado Theorem.
Combinatorics, Probability & Computing 1: 115-122 (1992) |
| 60 | | Peter Frankl,
Norihide Tokushige:
Some Best Possible Inequalities Concerning Cross-Intersecting Families.
J. Comb. Theory, Ser. A 61(1): 87-97 (1992) |
| 1991 |
|---|
| 59 | | Peter Frankl,
Zoltán Füredi:
A sharpening of Fisher's inequality.
Discrete Mathematics 90(1): 103-107 (1991) |
| 58 | | Peter Frankl,
Zoltán Füredi:
Beyond the Erdös-Ko-Rado theorem.
J. Comb. Theory, Ser. A 56(2): 182-194 (1991) |
| 1990 |
|---|
| 57 | | A. Robert Calderbank,
Peter Frankl:
Binary codes and quasi-symmetric designs.
Discrete Mathematics 83(2-3): 201-204 (1990) |
| 56 | | Peter Frankl:
Intersection theorems and mod p rank of inclusion matrices.
J. Comb. Theory, Ser. A 54(1): 85-94 (1990) |
| 55 | | Peter Frankl,
Ronald L. Graham,
Vojtech Rödl:
Iterated combinatorial density theorems.
J. Comb. Theory, Ser. A 54(1): 95-111 (1990) |
| 54 | | Peter Frankl:
Canonical Antichains on the Circle and Applications.
SIAM J. Discrete Math. 3(3): 355-363 (1990) |
| 1989 |
|---|
| 53 | | Peter Frankl,
Zoltán Füredi:
Extremal problems whose solutions are the blowups of the small witt-designs.
J. Comb. Theory, Ser. A 52(1): 129-147 (1989) |
| 1988 |
|---|
| 52 | | Peter J. Cameron,
Michel Deza,
Peter Frankl:
Intersection theorems in permutation groups.
Combinatorica 8(3): 249-260 (1988) |
| 51 | | Peter Frankl,
Vojtech Rödl:
Some Ramsey - Turán type results for hypergraphs.
Combinatorica 8(4): 323-332 (1988) |
| 50 | | Peter Frankl,
Hiroshi Maehara:
On the Contact Dimensions of Graphs.
Discrete & Computational Geometry 3: 89-96 (1988) |
| 49 | | Peter Frankl,
Ronald L. Graham,
Vojtech Rödl:
Quantitative theorems for regular systems of equations.
J. Comb. Theory, Ser. A 47(2): 246-261 (1988) |
| 48 | | Peter Frankl,
Vojtech Rödl,
Richard M. Wilson:
The number of submatrices of a given type in a Hadamard matrix and related results.
J. Comb. Theory, Ser. B 44(3): 317-328 (1988) |
| 47 | | Peter Frankl,
Hiroshi Maehara:
The Johnson-Lindenstrauss lemma and the sphericity of some graphs.
J. Comb. Theory, Ser. B 44(3): 355-362 (1988) |
| 1987 |
|---|
| 46 | | Anders Björner,
Peter Frankl,
Richard P. Stanley:
The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem.
Combinatorica 7(1): 23-34 (1987) |
| 45 | | Peter Frankl:
On a pursuit game on Cazley graphs.
Combinatorica 7(1): 67-70 (1987) |
| 44 | | Peter Frankl,
Hiroshi Maehara:
Open-interval graphs versus closed-interval graphs.
Discrete Mathematics 63(1): 97-100 (1987) |
| 43 | | Peter Frankl,
Ronald L. Graham,
Vojtech Rödl:
Induced restricted Ramsey theorems for spaces.
J. Comb. Theory, Ser. A 44(1): 120-128 (1987) |
| 42 | | Peter Frankl,
Ronald L. Graham:
The Radon transform on Abelian Groups.
J. Comb. Theory, Ser. A 44(1): 168-171 (1987) |
| 41 | | Peter Frankl,
Ronald L. Graham,
Vojtech Rödl:
On subsets of abelian groups with no 3-term arithmetic progression.
J. Comb. Theory, Ser. A 45(1): 157-161 (1987) |
| 40 | | Mikhail Deza,
Peter Frankl:
A helly type theorem for hypersurfaces.
J. Comb. Theory, Ser. A 45(1): 27-30 (1987) |
| 39 | | Peter Frankl,
Zoltán Füredi:
Exact solution of some Turán-type problems.
J. Comb. Theory, Ser. A 45(2): 226-262 (1987) |
| 38 | | Peter Frankl:
Erdös-Ko-Rado theorem with conditions on the maximal degree.
J. Comb. Theory, Ser. A 46(2): 252-263 (1987) |
| 1986 |
|---|
| 37 | | László Babai,
Peter Frankl,
Janos Simon:
Complexity classes in communication complexity theory (preliminary version)
FOCS 1986: 337-347 |
| 36 | | Peter Frankl:
Orthogonal vectors in the n-dimensional cube and codes with missing distances.
Combinatorica 6(3): 279-286 (1986) |
| 35 | | Peter Frankl,
Zoltán Füredi:
Finite projective spaces and intersecting hypergraphs.
Combinatorica 6(4): 335-354 (1986) |
| 34 | | Michel Deza,
Peter Frankl:
On Squashed Designs.
Discrete & Computational Geometry 1: 379-390 (1986) |
| 33 | | Peter Frankl,
Zoltán Füredi:
Non-trivial intersecting families.
J. Comb. Theory, Ser. A 41(1): 150-153 (1986) |
| 32 | | Peter Frankl:
All rationals occur as exponents.
J. Comb. Theory, Ser. A 42(2): 200-206 (1986) |
| 31 | | Fan R. K. Chung,
Ronald L. Graham,
Peter Frankl,
James B. Shearer:
Some intersection theorems for ordered sets and graphs.
J. Comb. Theory, Ser. A 43(1): 23-37 (1986) |
| 30 | | Peter Frankl,
Richard M. Wilson:
The Erdös-Ko-Rado theorem for vector spaces.
J. Comb. Theory, Ser. A 43(2): 228-236 (1986) |
| 29 | | Peter Frankl,
Zoltán Füredi:
Extremal problems concerning Kneser graphs.
J. Comb. Theory, Ser. B 40(3): 270-284 (1986) |
| 1985 |
|---|
| 28 | | Noga Alon,
Peter Frankl,
Vojtech Rödl:
Geometrical Realization of Set Systems and Probabilistic Communication Complexity
FOCS 1985: 277-280 |
| 27 | | Péter L. Erdös,
Peter Frankl,
Gyula O. H. Katona:
Extremal hypergraph problems and convex hulls.
Combinatorica 5(1): 11-26 (1985) |
| 26 | | Gérard D. Cohen,
Peter Frankl:
Good coverings of Hamming spaces with spheres.
Discrete Mathematics 56(2-3): 125-131 (1985) |
| 25 | | Peter Frankl,
Zoltán Füredi:
Forbidding Just One Intersection.
J. Comb. Theory, Ser. A 39(2): 160-176 (1985) |
| 1984 |
|---|
| 24 | | Péter L. Erdös,
Peter Frankl,
Gyula O. H. Katona:
Intersecting Sperner families and their convex hulls.
Combinatorica 4(1): 21-34 (1984) |
| 23 | | Peter Frankl,
János Pach:
On disjointly representable sets.
Combinatorica 4(1): 39-45 (1984) |
| 22 | | Peter Frankl,
Vojtech Rödl:
Families of finite sets with three intersections.
Combinatorica 4(2): 141-148 (1984) |
| 21 | | Peter Frankl:
Hypergraphs do not jump.
Combinatorica 4(2): 149-159 (1984) |
| 20 | | Peter Frankl,
Zoltán Füredi:
A new extremal property of Steiner triple-systems.
Discrete Mathematics 48(2-3): 205-212 (1984) |
| 19 | | Peter Frankl,
Zoltán Füredi:
An exact result for 3-graphs.
Discrete Mathematics 50: 323-328 (1984) |
| 18 | | Peter Frankl,
Zoltán Füredi:
On Hypergraphs without Two Edges Intersecting in a Given Number of Vertices.
J. Comb. Theory, Ser. A 36(2): 230-236 (1984) |
| 17 | | Mikhail Deza,
Peter Frankl:
Injection geometries.
J. Comb. Theory, Ser. B 37(1): 31-40 (1984) |
| 1983 |
|---|
| 16 | | Peter Frankl:
An extremal set theoretical characterization of some Steiner systems.
Combinatorica 3(2): 193-199 (1983) |
| 15 | | Michel Deza,
Peter Frankl,
N. M. Singhi:
On Functions of Strenth t.
Combinatorica 3(3): 331-339 (1983) |
| 14 | | Peter Frankl,
Zoltán Füredi:
A new generation of the Erdös - Ko - Rado theorem.
Combinatorica 3(3): 341-350 (1983) |
| 13 | | Peter Frankl:
A probabilistic proof for the lym-inequality.
Discrete Mathematics 43(2-3): 325 (1983) |
| 12 | | Peter Frankl:
On the Trace of Finite Sets.
J. Comb. Theory, Ser. A 34(1): 41-45 (1983) |
| 1982 |
|---|
| 11 | | Michel Deza,
Peter Frankl:
On the vector space of 0-configurations.
Combinatorica 2(4): 341-345 (1982) |
| 10 | | Péter L. Erdös,
Peter Frankl,
Zoltán Füredi:
Families of Finite Sets in Which No Set Is Covered by the Union of Two Others.
J. Comb. Theory, Ser. A 33(2): 158-166 (1982) |
| 1981 |
|---|
| 9 | | Michel Deza,
Peter Frankl:
Every large set of equidistant (0, +1, -1)-vectors forms a sunflower.
Combinatorica 1(3): 225-231 (1981) |
| 8 | | Peter Frankl,
Richard M. Wilson:
Intersection theorems with geometric consequences.
Combinatorica 1(4): 357-368 (1981) |
| 7 | | Peter Frankl,
Zoltán Füredi:
A short proof for a theorem of Harper about Hamming-spheres.
Discrete Mathematics 34(3): 311-313 (1981) |
| 6 | | Peter Frankl:
On a Problem of Chvátal and Erdös on Hypergraphs Containing No Generalized Simplex.
J. Comb. Theory, Ser. A 30(2): 169-182 (1981) |
| 1980 |
|---|
| 5 | | László Babai,
Peter Frankl:
On Set Intersections.
J. Comb. Theory, Ser. A 28(1): 103-105 (1980) |
| 1978 |
|---|
| 4 | | Peter Frankl:
On Intersecting Families of Finite Sets.
J. Comb. Theory, Ser. A 24(2): 146-161 (1978) |
| 1977 |
|---|
| 3 | | Peter Frankl,
Mikhail Deza:
On the Maximum Number of Permutations with Given Maximal or Minimal Distance.
J. Comb. Theory, Ser. A 22(3): 352-360 (1977) |
| 1976 |
|---|
| 2 | | Peter Frankl:
On Sperner Families Satisfying an Additional Condition.
J. Comb. Theory, Ser. A 20(1): 1-11 (1976) |
| 1975 |
|---|
| 1 | | Peter Frankl:
The Proof of a Conjecture of G. O. H. Katona.
J. Comb. Theory, Ser. A 19(2): 208-213 (1975) |
