Peter Frankl

	2012
98		Noga Alon, Peter Frankl, Hao Huang, Vojtech Rödl, Andrzej Rucinski, Benny Sudakov: Large matchings in uniform hypergraphs and the conjectures of Erdős and Samuels. J. Comb. Theory, Ser. A 119(6): 1200-1215 (2012)
	2011
97		Peter Frankl, Norihide Tokushige: On r-Cross Intersecting Families of Sets. Combinatorics, Probability & Computing 20(5): 749-752 (2011)
96		Dwight Duffus, Peter Frankl, Vojtech Rödl: Maximal independent sets in bipartite graphs obtained from Boolean lattices. Eur. J. Comb. 32(1): 1-9 (2011)
	2009
95		Andrzej Dudek, Peter Frankl, Vojtech Rödl: A Note on Universal and Canonically Coloured Sequences. Combinatorics, Probability & Computing 18(5): 683-689 (2009)
	2008
94		Peter Frankl, Gyula Y. Katona: Extremal k-edge-hamiltonian hypergraphs. Discrete Mathematics 308(8): 1415-1424 (2008)
	2007
93		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
92		Peter Frankl, Norihide Tokushige: Weighted Non-Trivial Multiply Intersecting Families. Combinatorica 26(1): 37-46 (2006)
91		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
90		Peter Frankl, Norihide Tokushige: Random walks and multiply intersecting families. J. Comb. Theory, Ser. A 109(1): 121-134 (2005)
	2003
89		Peter Frankl, Norihide Tokushige: The game of n-times nim. Discrete Mathematics 260(1-3): 205-209 (2003)
	2002
88		Peter Frankl, Norihide Tokushige: Weighted 3-Wise 2-Intersecting Families. J. Comb. Theory, Ser. A 100(1): 94-115 (2002)
87		Peter Frankl, Vojtech Rödl: Extremal problems on set systems. Random Struct. Algorithms 20(2): 131-164 (2002)
	2001
86		Peter Frankl, Gyula Y. Katona: Extremal k-edge-hamiltonian Hypergraphs. Electronic Notes in Discrete Mathematics 10: 109-112 (2001)
85		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
84		Peter Frankl, Gyula Y. Katona: Extremal k-edge-hamiltonian Hypergraphs. Electronic Notes in Discrete Mathematics 5: 130-133 (2000)
	1999
83		Peter Frankl, Norihide Tokushige: The Erdos-Ko-Rado Theorem for Integer Sequences. Combinatorica 19(1): 55-63 (1999)
	1998
82		Peter Frankl, Katsuhiro Ota, Norihide Tokushige: Uniform Intersecting Families with Covering Number Restrictions. Combinatorics, Probability & Computing 7(1): 47-56 (1998)
81		Peter Frankl, Norihide Tokushige: Some Inequalities Concerning Cross-Intersecting Families. Combinatorics, Probability & Computing 7(3): 247-260 (1998)
	1996
80		Peter Frankl: An Erdos-Ko-Rado Theorem for Direct Products. Eur. J. Comb. 17(8): 727-730 (1996)
79		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)
78		Peter Frankl, Katsuhiro Ota, Norihide Tokushige: Exponents of Uniform L-Systems. J. Comb. Theory, Ser. A 75(1): 23-43 (1996)
	1995
77		Peter Frankl, Hiroshi Maehara, Junichiro Nakashima: On the section of a convex polyhedron. Discrete Mathematics 140(1-3): 265-267 (1995)
76		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)
75		Peter Frankl, Katsuhiro Ota, Norihide Tokushige: Uniform Intersecting Families with Covering Number Four. J. Comb. Theory, Ser. A 71(1): 127-145 (1995)
	1994
74		Peter Frankl, M. Watanabe: Density Results for Uniform Families. Combinatorica 14(1): 115-119 (1994)
73		M. Watanabe, Peter Frankl: Some best possible bounds concerning the traces of finite sets. Graphs and Combinatorics 10(2-4): 283-292 (1994)
	1993
72		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)
71		Imre Bárány, Peter Frankl, Hiroshi Maehara: Reflecting a triangle in the plane. Graphs and Combinatorics 9(2-4): 97-104 (1993)
	1992
70		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)
69		Peter Frankl: The convex hull of antichains in posets. Combinatorica 12(4): 493-496 (1992)
68		A. Robert Calderbank, Peter Frankl: Improved Upper Bounds Concerning the Erdös-Ko-Rado Theorem. Combinatorics, Probability & Computing 1: 115-122 (1992)
67		Peter Frankl, Vojtech Rödl: The Uniformity Lemma for hypergraphs. Graphs and Combinatorics 8(4): 309-312 (1992)
66		Peter Frankl, Norihide Tokushige: Some Best Possible Inequalities Concerning Cross-Intersecting Families. J. Comb. Theory, Ser. A 61(1): 87-97 (1992)
	1991
65		Peter Frankl, Zoltán Füredi: A sharpening of Fisher's inequality. Discrete Mathematics 90(1): 103-107 (1991)
64		Peter Frankl, Zoltán Füredi: Beyond the Erdös-Ko-Rado theorem. J. Comb. Theory, Ser. A 56(2): 182-194 (1991)
	1990
63		A. Robert Calderbank, Peter Frankl: Binary codes and quasi-symmetric designs. Discrete Mathematics 83(2-3): 201-204 (1990)
62		Peter Frankl: Intersection theorems and mod p rank of inclusion matrices. J. Comb. Theory, Ser. A 54(1): 85-94 (1990)
61		Peter Frankl, Ronald L. Graham, Vojtech Rödl: Iterated combinatorial density theorems. J. Comb. Theory, Ser. A 54(1): 95-111 (1990)
60		Peter Frankl: Canonical Antichains on the Circle and Applications. SIAM J. Discrete Math. 3(3): 355-363 (1990)
	1989
59		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
58		Peter J. Cameron, Michel Deza, Peter Frankl: Intersection theorems in permutation groups. Combinatorica 8(3): 249-260 (1988)
57		Peter Frankl, Vojtech Rödl: Some Ramsey - Turán type results for hypergraphs. Combinatorica 8(4): 323-332 (1988)
56		Peter Frankl, Hiroshi Maehara: On the Contact Dimensions of Graphs. Discrete & Computational Geometry 3: 89-96 (1988)
55		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)
54		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)
53		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
52		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)
51		Peter Frankl: On a pursuit game on Cazley graphs. Combinatorica 7(1): 67-70 (1987)
50		Peter Frankl, Hiroshi Maehara: Open-interval graphs versus closed-interval graphs. Discrete Mathematics 63(1): 97-100 (1987)
49		Fan R. K. Chung, Peter Frankl: The maximum number of edges in a 3-graph not containing a given star. Graphs and Combinatorics 3(1): 111-126 (1987)
48		Peter Frankl, Zoltán Füredi, János Pach: Bounding one-way differences. Graphs and Combinatorics 3(1): 341-347 (1987)
47		Peter Frankl, Ronald L. Graham, Vojtech Rödl: Induced restricted Ramsey theorems for spaces. J. Comb. Theory, Ser. A 44(1): 120-128 (1987)
46		Peter Frankl, Ronald L. Graham: The Radon transform on Abelian Groups. J. Comb. Theory, Ser. A 44(1): 168-171 (1987)
45		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)
44		Mikhail Deza, Peter Frankl: A helly type theorem for hypersurfaces. J. Comb. Theory, Ser. A 45(1): 27-30 (1987)
43		Peter Frankl, Zoltán Füredi: Exact solution of some Turán-type problems. J. Comb. Theory, Ser. A 45(2): 226-262 (1987)
42		Peter Frankl: Erdös-Ko-Rado theorem with conditions on the maximal degree. J. Comb. Theory, Ser. A 46(2): 252-263 (1987)
	1986
41		László Babai, Peter Frankl, Janos Simon: Complexity classes in communication complexity theory (preliminary version) FOCS 1986: 337-347
40		Peter Frankl: Orthogonal vectors in the n-dimensional cube and codes with missing distances. Combinatorica 6(3): 279-286 (1986)
39		Peter Frankl, Zoltán Füredi: Finite projective spaces and intersecting hypergraphs. Combinatorica 6(4): 335-354 (1986)
38		Michel Deza, Peter Frankl: On Squashed Designs. Discrete & Computational Geometry 1: 379-390 (1986)
37		P. Erdös, Peter Frankl, Vojtech Rödl: The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent. Graphs and Combinatorics 2(1): 113-121 (1986)
36		Peter Frankl, Vojtech Rödl: Large triangle-free subgraphs in graphs withoutK4. Graphs and Combinatorics 2(1): 135-144 (1986)
35		Peter Frankl, Zoltán Füredi: Non-trivial intersecting families. J. Comb. Theory, Ser. A 41(1): 150-153 (1986)
34		Peter Frankl: All rationals occur as exponents. J. Comb. Theory, Ser. A 42(2): 200-206 (1986)
33		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)
32		Peter Frankl, Richard M. Wilson: The Erdös-Ko-Rado theorem for vector spaces. J. Comb. Theory, Ser. A 43(2): 228-236 (1986)
31		Peter Frankl, Zoltán Füredi: Extremal problems concerning Kneser graphs. J. Comb. Theory, Ser. B 40(3): 270-284 (1986)
	1985
30		Noga Alon, Peter Frankl, Vojtech Rödl: Geometrical Realization of Set Systems and Probabilistic Communication Complexity FOCS 1985: 277-280
29		Péter L. Erdös, Peter Frankl, Gyula O. H. Katona: Extremal hypergraph problems and convex hulls. Combinatorica 5(1): 11-26 (1985)
28		Gérard D. Cohen, Peter Frankl: Good coverings of Hamming spaces with spheres. Discrete Mathematics 56(2-3): 125-131 (1985)
27		Noga Alon, Peter Frankl: The maximum number of disjoint pairs in a family of subsets. Graphs and Combinatorics 1(1): 13-21 (1985)
26		Peter Frankl, Vojtech Rödl: Lower bounds for Turán's problem. Graphs and Combinatorics 1(1): 213-216 (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)

Coauthor Index

1	Noga Alon	[27] [30] [98]
2	László Babai	[5] [41] [85]
3	Imre Bárány	[71]
4	Anders Björner	[52]
5	A. Robert Calderbank	[63] [68]
6	Peter J. Cameron	[58]
7	Fan R. K. Chung (Fan Chung Graham)	[33] [49]
8	Gérard D. Cohen	[28]
9	Michel Deza	[9] [11] [15] [38] [58]
10	Mikhail Deza	[3] [17] [44]
11	Andrzej Dudek	[95]
12	Dwight Duffus	[96]
13	P. Erdös	[37]
14	Péter L. Erdös	[10] [24] [29] [70]
15	Zoltán Füredi	[7] [10] [14] [18] [19] [20] [25] [31] [35] [39] [43] [48] [59] [64] [65]
16	Ronald L. Graham	[33] [45] [46] [47] [55] [61]
17	Hao Huang	[98]
18	Gyula O. H. Katona	[24] [29]
19	Gyula Y. Katona	[84] [86] [94]
20	Daniel J. Kleitman	[70]
21	Samuel Kutin (Samuel A. Kutin)	[85]
22	Hiroshi Maehara	[50] [53] [56] [71] [77]
23	Makoto Matsumoto	[76]
24	Junichiro Nakashima	[77]
25	Katsuhiro Ota	[75] [78] [79] [82]
26	János Pach	[23] [48]
27	Yuejian Peng	[93]
28	Vojtech Rödl	[22] [26] [30] [36] [37] [45] [47] [54] [55] [57] [61] [67] [87] [93] [95] [96] [98]
29	Andrzej Rucinski	[98]
30	Imre Z. Ruzsa	[76]
31	Michael E. Saks (Michael Saks)	[70]
32	James B. Shearer	[33]
33	Janos Simon	[41]
34	N. M. Singhi	[15]
35	Richard P. Stanley	[52]
36	Daniel Stefankovic	[85]
37	Benny Sudakov	[98]
38	László A. Székely	[70]
39	John M. Talbot	[93]
40	Norihide Tokushige	[66] [72] [75] [76] [78] [79] [81] [82] [83] [88] [89] [90] [91] [92] [97]
41	M. Watanabe	[73] [74]
42	Richard M. Wilson	[8] [32] [54]

Colors in the list of coauthors

Last update Fri May 25 01:42:58 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page