The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Peter Frankl: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  83. A Note on Universal and Canonically Coloured Sequences. [Citation Graph (, )][DBLP]


  84. Extremal k-edge-hamiltonian hypergraphs. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.457secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002