UNDER CONSTRUCTION

 

LIST OF PUBLICATIONS OF PETER FRANKL

 

2017

1.      Peter Frankl, A proof of the Hilton--Milner Theorem without computation, 
Download: pdf  

 

  1. Peter Frankl, A structural result for 3-graphs, Discrete Mathematics 340 (2017), 1039-1041.
    Download: pdf

 

  1. Peter Frankl, Some exact results for multiply intersecting families,
    Download: pdf

 

  1. Peter Frankl, Best possible bounds concerning the set-wise union of families,
    Download: pdf

 

  1. Peter Frankl, Antichains of fixed diameter,
    Download: pdf

 

  1. Peter Frankl, A near exponential improvement on a bound of Erdős and Lovász,
    Download: pdf

 

  1. Peter Frankl, Partition-free families of sets,
    Download: pdf

 

  1. Peter Frankl, New inequalities for families without k pairwise disjoint members,
    Download: pdf

 

  1. Peter Frankl, Andrey Kupavskii, A size-sensitive inequality for cross-intersecting families, arXiv:1603.00936, January 2017
    Download: pdf

 

  1. Peter Frankl, Andrey Kupavskii, Intersection theorems for {0, +-1}-vectors and s-cross-intersecting families, Moscow Journal of Combinatorics and Number Theory 7 (2) (2017), 3-21.
    Download: pdf

 

  1. Peter Frankl, Andrey Kupavskii, Uniform s-cross-intersecting families, arXiv:1611.07258, January 2017
    Download: pdf

 

  1. Peter Frankl, Andrey Kupavskii, Families of sets with no matchings of sizes 3 and 4, arXiv:1701.04107, January 2017
    Download: pdf

 

  1. Peter Frankl, Andrey Kupavskii, Counting intersecting and pairs of cross-intersecting families, arXiv:1701.04110, January 2017
    Download: pdf

 

  1. Peter Frankl, Andrey Kupavskii, Families of vectors without antipodal pairs, arXiv:1705.07216, May 2017
    Download: pdf

 

  1. Peter Frankl, Andrey Kupavskii, Partition-free families of sets, arXiv:1706.00215, June 2017
    Download: pdf

 

  1. Peter Frankl, János Pach, Christian Reiher, Vojtech Rödl, Borsuk and Ramsey type questions in Euclidean space, Connections in Discrete Mathematics. Dedicated to Ron Graham on the occasion of his 80th birthday, Cambridge University Press, to appear.
    Download: pdf

 

  1. Peter Frankl, Norihide Tokushige, A note on Huang-Zhao theorem on intersecting families with large minimum degree, Discrete Mathematics 340(5) (2017), 1098-1103.
    Download: pdf

 

2016

  1. Peter Frankl, New inequalities for cross-intersecting families,
    Download: pdf

 

  1. Peter Frankl, On the maximum number of edges in a hypergraph with given matching number,
    Download: pdf

 

  1. Peter Frankl, Linear independence, a unifying approach to shadow theorems,
    Download: pdf

 

  1. Peter Frankl, Proof of the Erdős Matching Conjecture in a New Range,
    Download: pdf

 

  1. Peter Frankl, Resilient hypergraphs with fixed matching number,
    Download: pdf

 

  1. Peter Frankl, A stability result for families with fixed diameter,
    Download: pdf

 

  1. Peter Frankl, Y. Kohayakawa, V. Rödl, A note on supersaturated set systems, European J. Combin. 51 (2016), 190-199.
    Download: pdf

 

  1. Peter Frankl, Andrey Kupavskii, Families with no s pairwise disjoint sets, arXiv:1607.06122, July 2016
    Download: pdf

 

  1. Peter Frankl, Andrey Kupavskii, Two problems of P. Erdős on matchings in set families, arXiv:1607.06126, July 2016
    Download: pdf

  2. Peter Frankl, Norihide Tokushige, Intersection problems in the q-ary cube, J. Combin. Theory Ser. A 141 (2016), 90-126.
    Download: pdf

 

  1. Peter Frankl, Norihide Tokushige, Invitation to intersection problems for finite sets, J. Combin. Theory Ser. A 144 (2016), 157-211.
    Download: pdf

 

  1. Peter Frankl, Norihide Tokushige, Uniform eventown problems, Europ. J. Comb. 51 (2016), 280-286.
    Download: pdf

 

  1. Peter Frankl, Norihide Tokushige, Masashi Shinohara, Multiply union families in N^n, European J. Combin. 58 (2016), 66-74.
    Download: pdf

 

2015

  1. Peter Frankl, Andrey Kupavskii, Erdős-Ko-Rado theorem for {0, +-1}-vectors , arXiv:1510.03912, October 2015.
    Download: pdf

2014

  1. Peter Frankl, Sang June Lee, Mark Siggers, Norihide Tokushige, An Erdős-Ko-Rado theorem for cross t-intersecting families, J. Combin. Theory Ser. A 128 (2014), 207-249.
    Download: pdf

2013

  1. Peter Frankl, On the number of nonnegative sums, J. Combin. Theory Ser. B 103(5) (2013), 647-649.
    Download: pdf

 

  1. Peter Frankl, Norihide Tokushige, The Katona theorem for vector spaces, J. Comb. Theory, Ser. A 120(7) (2013), 1578-1589.
    Download: pdf

 

  1. Peter Frankl, Mitsuo Kato, Gyula O. H. Katona, Norihide Tokushige, Two-colorings with many monochromatic cliques in both colors, J. Comb. Theory, Ser. B 103(4) (2013) 415-427.
    Download: pdf

 

  1. Peter Frankl, Improved bounds for Erdős' matching conjecture, J. Comb. Theory, Ser. A 120(5) (2013) 1068-1072.
    Download: pdf

 

  1. Dwight Duffus, Peter Frankl, Vojtěch Rödl, Maximal independent sets in the covering graph of the cube, Discrete Applied Mathematics 161(9) (2013) 1203-1208.
    Download: pdf

 

  1. Andrzej Dudek, Peter Frankl, Vojtěch Rödl, Some recent results on Ramsey-type numbers, Discrete Applied Mathematics 161(9) (2013) 1197-1202.
    Download: pdf

2012

  1. Péter Frankl, Disjoint edges in separated hypergraphs, Mosc. J. Comb. Number Theory 2(4) (2012), 19-26.

 

  1. Peter Frankl, Tomasz Luczak, Katarzyna Mieczkowska, On matchings in hypergraphs, Electr. J. Comb. 19(2) (2012).
    Download: pdf

 

  1. Peter Frankl, Zoltán Füredi, A new short proof of the EKR theorem, J. Comb. Theory, Ser. A 119(6) (2012) 1388-1390.
    Download: pdf

 

  1. Noga Alon, Peter Frankl, Hao Huang, Vojtěch 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) (2012) 1200-1215.
    Download: pdf

 

  1. Peter Frankl, Vojtěch Rödl, Andrzej Rucinski, On the maximum number of edges in a triple system not containing a disjoint family of a given size, Combinatorics, Probability & Computing 21(1-2) (2012) 141-148.
    Download: pdf

2011

  1. Peter Frankl, Norihide Tokushige, On r-cross intersecting families of sets, Combinatorics, Probability & Computing 20(5) (2011) 749-752.
    Download: pdf

 

  1. Dwight Duffus, Peter Frankl, Vojtěch Rödl, Maximal independent sets in bipartite graphs obtained from Boolean lattices, Eur. J. Comb. 32(1) (2011) 1-9.
    Download: pdf

2010

  1. Domingos Dellamonica Jr., Peter Frankl, Vojtěch Rödl, A theorem on incidence matrices and quasirandom hypergraphs, Combinatorics and graphs, 201-207, Contemp. Math., 531, Amer. Math. Soc., Providence, RI, 2010.

 

  1. A Blokhuis, A. E. Brouwer, A. Chowdhury, P. Frankl, T. Mussche, B. Patkós, T. Szőnyi, A Hilton-Milner theorem for vector spaces, Electron. J. Combin. 17(1) (2010), Research Paper 71, 12 pp.
    Download: pdf

2009

  1. Andrzej Dudek, Peter Frankl, Vojtěch Rödl, A Note on universal and canonically coloured sequences, Combinatorics, Probability & Computing 18(5) (2009) 683-689.
    Download: pdf

2008

  1. Peter Frankl, Gyula Y. Katona, Extremal k-edge-hamiltonian hypergraphs, Discrete Mathematics 308(8) (2008) 1415-1424.
    Download: pdf

2007

  1. Peter Frankl, Yuejian Peng, Vojtěch Rödl, John M. Talbot, A note on the jumping constant conjecture of Erdős, J. Comb. Theory, Ser. B 97(2) (2007) 204-216.
    Download: pdf

2006

  1. Peter Frankl, Norihide Tokushige, The maximum size of 3-wise intersecting and 3-wise union families, Graphs and Combinatorics 22(2) (2006) 225-231.
    Download: pdf

 

  1. Peter Frankl, Norihide Tokushige, Weighted non-trivial multiply intersecting families, Combinatorica 26(1) (2006) 37-46.
    Download: pdf

2005

  1. Peter Frankl, Norihide Tokushige, Random walks and multiply intersecting families, J. Comb. Theory, Ser. A 109(1) (2005) 121-134.
    Download: pdf

2004

  1. Peter Frankl, Vojtěch Rödl, Strong Ramsey properties of simplices, Israel J. Math. 139 (2004), 215-236.
    Download: pdf

2003

  1. P. Frankl, N. Tokushige, Weighted multiply intersecting families, Studia Sci. Math. Hungar. 40(3) (2003), 287-291.

 

  1. Peter Frankl, Norihide Tokushige, The game of n-times nim, Discrete Mathematics 260(1-3) (2003) 205-209.
    Download: pdf

2002

  1. Peter Frankl, Norihide Tokushige, Weighted 3-wise 2-intersecting families, J. Comb. Theory, Ser. A 100(1) (2002) 94-115.
    Download: pdf

 

  1. Peter Frankl, Vojtěch Rödl, Extremal problems on set systems, Random Struct. Algorithms 20(2) (2002) 131-164.

2001

  1. Peter Frankl, Gyula Y. Katona, Extremal k-edge-hamiltonian hypergraphs, Electronic Notes in Discrete Mathematics 10 (2001) 109-112.
    Download: pdf

  2. László Babai, Peter Frankl, Samuel Kutin, Daniel Stefankovic, Set systems with restricted intersections modulo prime powers, J. Comb. Theory, Ser. A 95(1) (2001) 39-73.
    Download: pdf

2000

  1. Peter Frankl, Gyula Y. Katona, Extremal k-edge-hamiltonian hypergraphs, Electronic Notes in Discrete Mathematics 5 (2000) 130-133.
    Download: pdf

1999

  1. Peter Frankl, Norihide Tokushige, Weighted multiply intersecting families, Paul Erdős and his mathematics (Budapest, 1999), 74-75, János Bolyai Math. Soc., Budapest, 1999.

 

  1. Peter Frankl, Norihide Tokushige, The Erdős-Ko-Rado theorem for integer sequences, Combinatorica 19(1) (1999) 55-63.
    Download: pdf

1998

  1. Peter Frankl, Norihide Tokushige, Some inequalities concerning cross-intersecting families, Combinatorics, Probability & Computing 7(3) (1998) 247-260.
    Download: pdf

 

  1. Peter Frankl, Katsuhiro Ota, Norihide Tokushige, Uniform intersecting families with covering number restrictions, Combinatorics, Probability & Computing 7(1) (1998) 47-56.
    Download: pdf

1996

  1. 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) (1996) 33-42.
    Download: pdf

 

  1. Peter Frankl, An Erdős-Ko-Rado theorem for direct products, Eur. J. Comb. 17(8) (1996) 727-730.
    Download: pdf

 

  1. Peter Frankl, Katsuhiro Ota, Norihide Tokushige, Exponents of uniform L-systems, J. Comb. Theory, Ser. A 75(1) (1996) 23-43.
    Download: pdf

1995

  1. 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) (1995) 125-148.
    Download: pdf
  2. Peter Frankl, Katsuhiro Ota, Norihide Tokushige, Uniform intersecting families with covering number four, J. Comb. Theory, Ser. A 71(1) (1995) 127-145.
    Download: pdf

 

  1. Peter Frankl, Hiroshi Maehara, Junichiro Nakashima, On the section of a convex polyhedron, Discrete Mathematics 140(1-3) (1995) 265-267.
    Download: pdf

 

  1. P. Frankl, Extremal set systems, Handbook of combinatorics, Vol. 1, 2, 1293-1329, Elsevier, Amsterdam, 1995.

 

  1. P. Frankl, H. Maehara, Projecting a finite point-set into a hyperplane, Ryukyu Math. J. 8 (1995), 27-35 (1996).

1994

  1. M. Watanabe, Peter Frankl, Density results for uniform families, Combinatorica 14(1) (1994) 115-119.

 

  1. M. Watanabe, Peter Frankl, Some best possible bounds concerning the traces of finite sets, Graphs and Combinatorics 10(2-4) (1994) 283-292.

 

  1. P. Frankl, N. Tokushige, The Kruskal-Katona theorem, some of its analogues and applications, Extremal problems for finite sets (Visegrád, 1991), 229-250, Bolyai Soc. Math. Stud., 3, János Bolyai Math. Soc., Budapest, 1994.

1993

  1. Imre Bárány, Peter Frankl, Hiroshi Maehara, Reflecting a triangle in the plane, Graphs and Combinatorics 9(2-4) (1993) 97-104.
    Download: pdf

 

  1. A. R. Calderbank, P. Frankl, R. L. Graham, W.-C. W. Li, L.A. Shepp, The Sperner capacity of linear and nonlinear codes for the cyclic triangle, J. Algebraic Combin. 2(1) (1993) 31-48.

 

  1. Peter Frankl, Norihide Tokushige, Weight functions on the Kneser graph and the solution of an intersection problem of Sali, Combinatorica 13(4) (1993), 413-420.

1992

  1. 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) (1992) 287-293.
    Download: pdf

 

  1. Peter Frankl, The convex hull of antichains in posets, Combinatorica 12(4) (1992) 493-496.

  2. P. Frankl, On cross-intersecting families. Topological, algebraical and combinatorial structures, Frolík's memorial volume. Discrete Math. 108(1-3) (1992), 291-295.
    Download: pdf

 

  1. Peter Frankl, Norihide Tokushige, Some best possible inequalities concerning cross-intersecting families, J. Comb. Theory, Ser. A 61(1) (1992) 87-97.
    Download: pdf

 

  1. A. Robert Calderbank, Peter Frankl, Improved upper bounds concerning the Erdős-Ko-Rado theorem, Combinatorics, Probability & Computing 1 (1992) 115-122.

 

  1. Peter Frankl, Vojtěch Rödl, The uniformity lemma for hypergraphs, Graphs and Combinatorics 8(4) (1992) 309-312.

1991

  1. S. A. Burr, P. Erdős, V. T. Sós, P. Frankl, R. L. Graham, Further results on maximal anti-Ramsey graphs, Graph theory, combinatorics, and applications, Vol. 1 (Kalamazoo, MI, 1988), 193-206, Wiley-Intersci. Publ., Wiley, New York, 1991.

 

  1. Peter Frankl, Zoltán Füredi, Beyond the Erdős-Ko-Rado theorem, J. Comb. Theory, Ser. A 56(2) (1991) 182-194.
    Download: pdf

 

  1. P. Frankl, Multiply-intersecting families, J. Combin. Theory Ser. B 53(2) (1991), 195-234.
    Download: pdf

 

  1. P. Frankl, Shadows and shifting, Graphs Combin. 7(1) (1991), 23-29.

 

  1. Peter Frankl, Zoltán Füredi, A sharpening of Fisher's inequality, Discrete Mathematics 90(1) (1991) 103-107.
    Download: pdf

 

1990

  1. P. Frankl, R. L. Graham, V. Rödl, Quantitative Versionen von kombinatorischen Partitionssätzen, (German) [Quantitative versions of combinatorial partition theorems] Jahresber. Deutsch. Math.-Verein. 92(3) (1990), 130-144.

 

  1. Peter Frankl, H Maehara, Simplices with given 2-face areas, European J. Combin. 11(3) (1990), 241-247.
    Download: pdf

 

  1. A. Robert Calderbank, Peter Frankl, Binary codes and quasi-symmetric designs, Discrete Mathematics 83(2-3) (1990) 201-204.
    Download: pdf

 

  1. P. Frankl, Asymptotic solution of a Turán-type problem, Graphs Combin. 6(3) (1990), 223-227.

 

  1. P. Frankl, V. Rödl, A partition property of simplices in Euclidean space, J. Amer. Math. Soc. 3(1) (1990), 1-7.
    Download: pdf

 

  1. Peter Frankl, Ronald L. Graham, Vojtěch Rödl, Iterated combinatorial density theorems, J. Comb. Theory, Ser. A 54(1) (1990) 95-111.
    Download: pdf

 

  1. P. Frankl, Extremal problems for finite sets, Chapter in "Handbook of Combinatorics", North Holland.

 

  1. Peter Frankl, Hiroshi Maehara, Some geometric applications of the beta distribution, Ann. Inst. Statist. Math. 42(3) (1990), 463-474.

 

  1. Peter Frankl, Intersection theorems and mod p rank of inclusion matrices, J. Comb. Theory, Ser. A 54(1) (1990) 85-94.
    Download: pdf

 

  1. Peter Frankl, Canonical antichains on the circle and applications, SIAM J. Discrete Math. 3(3) (1990) 355-363.

 

  1. P. Frankl, An intersection problem for codes, Discrete Math. 84(2) (1990), 135-141.
    Download: pdf

 

  1. Peter Frankl, Constructive Ramsey bounds and intersection theorems for sets, Mathematics of Ramsey theory, 53-56, Algorithms Combin., 5, Springer, Berlin, 1990.

 

  1. P. Erdős, P. Frankl, R. L. Graham, V. Rödl, Quantitative forms for combinatorial partition and density theorems, (in Russian) Proceedings of Bernoulli Soc. Meeting of Tashkent, Uzbekistan (1990).

1989

  1. P. Frankl, Helly-type theorems for varieties, European J. Combin. 10(3) (1989), 243-245.

 

  1. N. Alon, P. Frankl, Families in which disjoint sets have large union, Combinatorial Mathematics: Proceedings of the Third International Conference (New York, 1985), 9-16, Ann. New York Acad. Sci., 555, New York Acad. Sci., New York, 1989.

 

  1. Peter Frankl, Zoltán Füredi, Extremal problems whose solutions are the blow-ups of the small Witt-designs, J. Comb. Theory, Ser. A 52(1) (1989) 129-147.

 

  1. P. Frankl, R. L. Graham, V. Rödl, On the distribution of monochromatic configurations, Irregularities of partitions (Fertőd, 1986), 71-87, Algorithms Combin. Study Res. Texts, 8, Springer, Berlin, 1989.

 

  1. P. J. Cameron, P. Frankl, W. M. Kantor, Intersecting families of finite sets and fixed-point-free 2-elements, European J. Combin. 10(2) (1989), 149-160.

 

  1. P. Frankl, A lower bound on the size of a complex generated by an antichain, Discrete Math. 76(1) (1989), 51-56.
    Download: pdf

 

  1. E. Bannai, M. Deza, P. Frankl, A. C. Kim, M. Kiyota, On the number of elements which are not nth powers in finite groups, Comm. Algebra 17(11) (1989), 2865-2870.

 

  1. P. Frankl, R. L. Graham, Old and new proofs of the Erdős-Ko-Rado theorem, Sichuan Daxue Xuebao 26 (1989), Special Issue, 112-122.

 

  1. P. Frankl, Traces and antichanins, Graphs and Comb. 5(1) (1989), 295-299.

1988

  1. Peter Frankl, Vojtěch Rödl, Some Ramsey-Turán type results for hypergraphs, Combinatorica 8(4) (1988) 323-332.

 

  1. Peter Frankl, Ronald L. Graham, Vojtěch Rödl, Quantitative theorems for regular systems of equations, J. Comb. Theory, Ser. A 47(2) (1988) 246-261.
    Download: pdf

 

  1. P. Frankl, Intersection and containment problems without size restrictions, Algebraic, extremal and metric combinatorics, 1986 (Montreal, PQ, 1986), 62-111, London Math. Soc. Lecture Note Ser., 131, Cambridge Univ. Press, Cambridge, 1988.

 

  1. Peter Frankl, Zoltán Füredi, Gil Kalai, Shadows of colored complexes, Math. Scand. 63(2) (1988), 169-178.

 

  1. Peter Frankl, Vojtěch 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) (1988) 317-328.
    Download: pdf

 

  1. Peter Frankl, Hiroshi Maehara, On the contact dimensions of graphs, Discrete & Computational Geometry 3 (1988) 89-96.

 

  1. Peter Frankl, Hiroshi Maehara, The Johnson-Lindenstrauss lemma and the sphericity of some graphs, J. Comb. Theory, Ser. B 44(3) (1988) 355-362.
    Download: pdf

 

  1. P. Frankl, Z. Füredi, Solution of the Littlewood-Offord problem in high dimensions, Ann. of Math. (2) 128(2) (1988), 259-270.
    Download: pdf

 

  1. Peter J. Cameron, Michel Deza, Peter Frankl, Intersection theorems in permutation groups, Combinatorica 8(3) (1988) 249-260.

 

  1. P. Frankl, Old and new problems on finite sets, Nineteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing (Baton Rouge, LA, 1988). Congr. Numer. 67 (1988), 243-256.

 

  1. P. Frankl, Z. Füredi, Extremal problems and the Lagrange function for hypergraphs, Bull. Inst. Math. Acad. Sinica 16(4) (1988), 305-313.

 

  1. Peter Frankl, János Pach, An extremal problem on Kr-free graphs, Graph Theory 12(4) (1988) 519-523.

1987

  1. Peter Frankl, Hiroshi Maehara, Open-interval graphs versus closed-interval graphs, Discrete Mathematics 63(1) (1987) 97-100.
    Download: pdf

 

  1. Peter Frankl, Cops and robbers in graphs with large girth and Cayley graphs, Discrete Appl. Math. 17(3) (1987), 301-305.
    Download: pdf

 

  1. Peter Frankl, Zoltán Füredi, János Pach, Bounding one-way differences, Graphs and Combinatorics 3(1) (1987) 341-347.
    Download: pdf

 

  1. P. J. Cameron, M. Deza, P. Frankl, Sharp sets of permutations, J. Algebra 111(1) (1987), 220-247.
    Download: pdf

 

  1. 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) (1987) 23-34.

 

  1. Peter Frankl, Vojtěch Rödl, Forbidden intersections, Trans. Amer. Math. Soc. 300(1) (1987), 259-286.
    Download: pdf

 

  1. Peter Frankl, Ronald L. Graham, Vojtěch Rödl, On subsets of abelian groups with no 3-term arithmetic progression, J. Comb. Theory, Ser. A 45(1) (1987) 157-161.
    Download: pdf

 

  1. Peter Frankl, Ronald L. Graham, Vojtěch Rödl, Induced restricted Ramsey theorems for spaces, J. Comb. Theory, Ser. A 44(1) (1987) 120-128.
    Download: pdf

 

  1. Peter Frankl, On a pursuit game on Cayley graphs, Combinatorica 7(1) (1987) 67-70.

 

  1. F. R. K.Chung, P. Frankl, The maximum number of edges ina 3-graph not containing a given star, Graphs Combin. 3(2) (1987), 111-126.

 

  1. Peter Frankl, Ronald L. Graham, The Radon transform on Abelian groups, J. Comb. Theory, Ser. A 44(1) (1987) 168-171.
    Download: pdf

 

  1. Mikhail Deza, Peter Frankl, A Helly-type theorem for hypersurfaces, J. Comb. Theory, Ser. A 45(1) (1987) 27-30.
    Download: pdf

 

  1. P. Frankl, Z. Füredi, Colored packing of sets, Combinatorial design theory, 165-177, North-Holland Math. Stud., 149, North-Holland, Amsterdam, 1987.

 

  1. Peter Frankl, Zoltán Füredi, Exact solution of some Turán-type problems, J. Comb. Theory, Ser. A 45(2) (1987) 226-262.
    Download: pdf

 

  1. H. Enomoto, P. Frankl, N. Ito, K. Nomura, Codes with given distances, Graphs Combin. 3(1) (1987), 25-38.

 

  1. Peter Frankl, Erdős-Ko-Rado theorem with conditions on the maximal degree, J. Comb. Theory, Ser. A 46(2) (1987) 252-263.
    Download: pdf

 

  1. Peter Frankl, The shifting technique in extremal set theory, Surveys in combinatorics 1987 (New Cross, 1987), 81-110, London Math. Soc. Lecture Note Ser., 123, Cambridge Univ. Press, Cambridge, 1987
    Download: pdf

 

  1. Peter Frankl, Intersection theorems for finite sets and geometric applications, Proceedings of the International Congress of Mathematicians, Vol. 1, 2 (Berkeley, Calif., 1986), 1419-1430, Amer. Math. Soc., Providence, RI, 1987.

1986

  1. P. C. Fishburn, P. Frankl, D. Freed, J. C. Lagarias, A. M. Odlyzko, Probabilities for intersecting systems and random subsets of finite sets, SIAM J. Algebraic Discrete Methods 7(1) (1986), 73-79.

 

  1. Peter Frankl, Orthogonal vectors in the n-dimensional cube and codes with missing distances, Combinatorica 6(3) (1986) 279-285.

 

  1. Peter Frankl, Vojtěch Rödl, All triangles are Ramsey, Trans. Amer. Math. Soc. 297(2) (1986), 777-779.
    Download: pdf

 

  1. Peter Frankl, Zoltán Füredi, Non-trivial intersecting families, J. Comb. Theory, Ser. A 41(1) (1986) 150-153.
    Download: pdf

 

  1. P. Frankl, H. Maehara, Embedding the n-cube in lower dimensions, European J. Combin. 7(3) (1986), 221-225.

 

  1. Peter Frankl, Zoltán Füredi, Extremal problems concerning Kneser graphs, J. Comb. Theory, Ser. B 40(3) (1986) 270-284.
    Download: pdf

  2. Konrad Engel, Peter Frankl, An Erdős-Ko-Rado theorem for integer sequences of given rank, European J. Combin. 7(3) (1986), 215-220.

 

  1. P. Frankl, I. G. Rosenberg, Regularly intersecting families of finite sets, Ars Combin. 22 (1986), 97-105.

 

  1. P. Frankl, What must be contained in every oriented k-uniform hypergraph, Discrete Math. 62(3) (1986), 311-313.
    Download: pdf

 

  1. Peter Frankl, All rationals occur as exponents, J. Comb. Theory, Ser. A 42(2) (1986) 200-206.
    Download: pdf

 

  1. P. Frankl, Z. Füredi, Union-free families of sets and equations over fields, J. Number Theory 23(2) (1986), 210-218.
    Download: pdf

 

  1. 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) (1986), 23-37.
    Download: pdf

 

  1. Peter Frankl, Vojtěch Rödl, Large triangle-free subgraphs in graphs without K4, Graphs and Combinatorics 2(1) (1986) 135-144.

 

  1. Peter Frankl, Zoltán Füredi, Finite projective spaces and intersecting hypergraphs, Combinatorica 6(4) (1986) 335-354.

 

  1. Michel Deza, Peter Frankl, On squashed designs, Discrete & Computational Geometry 1 (1986) 379-390.

 

  1. Peter Frankl, Richard M. Wilson, The Erdős-Ko-Rado theorem for vector spaces, J. Comb. Theory, Ser. A 43(2) (1986) 228-236.
    Download: pdf

 

  1. N. Alon, P. Frankl, L. Lovász, The chromatic number of Kneser hypergraphs, Trans. Amer. Math. Soc. 298(1) (1986), 359-370.
    Download: pdf

 

  1. Paul Erdős, Peter Frankl, Vojtěch 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) (1986) 113-121.

 

  1. László Babai, Peter Frankl, Janos Simon, Complexity classes in communication complexity theory (preliminary version), FOCS 1986, 337-347.
    Download: pdf

1985

  1. Peter Frankl, Zoltán Füredi, Forbidding just one intersection, J. Comb. Theory, Ser. A 39(2) (1985) 160-176.
    Download: pdf

 

  1. Jin Akiyama, Peter Frankl, On the size of graphs with complete-factors, Journal of Graph Theory 9(1) (1985) 197-201.

 

  1. Gérard D. Cohen, Peter Frankl, Good coverings of Hamming spaces with spheres, Discrete Mathematics 56(2-3) (1985) 125-131.
    Download: pdf

 

  1. M. Deza, P. Frankl, J. W. P. Hirschfeld, Sections of varieties over finite fields as large intersection families, Proc. London Math. Soc. (3) 50(3) (1985), 405-425.
    Download: pdf

 

  1. Péter L. Erdős, Peter Frankl, Gyula O. H. Katona, Extremal hypergraph problems and convex hulls, Combinatorica 5(1) (1985) 11-26.
    Download: pdf

 

  1. Noga Alon, Peter Frankl, The maximum number of disjoint pairs in a family of subsets, Graphs and Combinatorics 1(1) (1985) 13-21.

 

  1. P. Frankl, On the chromatic number of the general Kneser-graph, J. Graph Theory 9(2) (1985), 217-220.

 

  1. Noga Alon, Peter Frankl, Vojtěch Rödl, Geometrical realization of set systems and probabilistic communication complexity, FOCS 1985, 277-280.
    Download: pdf

 

  1. Peter Frankl, Vojtěch Rödl, Lower bounds for Turán's problem, Graphs and Combinatorics 1(1) (1985) 213-216.

 

  1. P. Erdős, P. Frankl, Z. Füredi, Families of finite sets in which no set is covered by the union of r others, Israel J. Math. 51(1-2) (1985), 79-89.

 

  1. M. Deza, P. Frankl, Bounds on the maximum number of vectors with given scalar products, Proc. Amer. Math. Soc. 95(2) (1985), 323-329.

 

  1. P. Frankl, V. Rödl, Near perfect coverings in graphs and hypergraphs, European J. Combin. 6(4) (1985), 317-326.
    Download: pdf

 

  1. P. Frankl, R. L. Graham, Intersection theorems for vector spaces, European J. Combin. 6(2) (1985), 183-187.
    Download: pdf

 

  1. P. Frankl, G. O. H. Katona, Polytopes determined by hypergraph classes, European J. Combin. 6(3) (1985), 233-243.
    Download: pdf

 

  1. P. Frankl, The maximum number of non-squares in a group, Proc. Coll. Algebra and Comb., Osaka (1985), 29-33. (in Japanese)
    Download: pdf

 

  1. P. Frankl, Bounding the size of a family knowing the cardinality of differences, Studia Sci. Math. Hungar. 20(1-4) (1985), 33-36.

1984

  1. 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) (1984) 230-236.

 

  1. Peter Frankl, Vojtěch Rödl, Families of finite sets with three intersections, Combinatorica 4(2) (1984) 141-148.

 

  1. Peter Frankl, Zoltán Füredi, A new extremal property of Steiner triple-systems, Discrete Mathematics 48(2-3) (1984) 205-212.

 

  1. Peter Frankl, Zoltán Füredi, Union-free hypergraphs and probability theory, European J. Combin. 5(2) (1984), 127-131.
    Download: pdf
    Erratum: "Union-free hypergraphs and probability theory" [European J. Combin. 5 (1984), no. 2, 127-131; MR0753001 (85g:05110)]. European J. Combin. 5(4) (1984), 395.

 

  1. David E. Daykin, Peter Frankl, Extremal sets of subsets satisfying conditions induced by a graph, Graph theory and combinatorics (Cambridge, 1983), 107-126, Academic Press, London, 1984.

 

  1. Péter L. Erdős, Peter Frankl, Gyula O. H. Katona, Intersecting Sperner families and their convex hulls, Combinatorica 4(1) (1984) 21-34.
    Download: pdf

 

  1. Peter Frankl, János Pach, On disjointly representable sets, Combinatorica 4(1) (1984) 39-45.

 

  1. P. Frankl, A new short proof for the Kruskal-Katona theorem, Discrete Math. 48(2-3) (1984), 327-329.
    Download: pdf

 

  1. Mikhail Deza, Peter Frankl, Injection geometries, J. Comb. Theory, Ser. B 37(1) (1984) 31-40.
    Download: pdf

 

  1. Peter Frankl,V. Rödl, Hypergraphs do not jump, Combinatorica 4(2) (1984) 149-159.

 

  1. Peter Frankl, Zoltán Füredi, An exact result for 3-graphs, Discrete Mathematics 50 (1984) 323-328. Download: pdf

 

  1. P. Frankl, J. Pach, V. Rödl, How to build a barricade, Monatsh. Math. 98(2) (1984), 93-98.

 

  1. P. Frankl, Asymptotic solution of a locally-Turán problem, Studia Sci. Math. Hungar. 19(2-4) (1984), 253-257.

 

  1. Peter Frankl, New proofs for old theorems in extremal set theory, Combinatorics and applications (Calcutta, 1982), 127-132, Indian Statist. Inst., Calcutta, 1984.

 

  1. P. Frankl, Z. Füredi, Families of finite sets with missing intersections, Finite and infinite sets, Vol. I, II (Eger, 1981), 305-318, Colloq. Math. Soc. János Bolyai, 37, North-Holland, Amsterdam, 1984.

1983

  1. Peter Frankl, On the trace of finite sets, J. Comb. Theory, Ser. A 34(1) (1983) 41-45.
    Download: pdf

 

  1. David E. Daykin, Peter Frankl, Inequalities for subsets of a set and KLYM posets, SIAM J. Algebraic Discrete Methods 4(1) (1983), 67-69.

 

  1. Peter Frankl, Zoltán Füredi, A new generation of the Erdős-Ko-Rado theorem, Combinatorica 3(3) (1983) 341-350.

 

  1. Peter Frankl, Zoltán Füredi, Disjoint r-tuples in an r-graph with given maximum degree, Quart. J. Math. Oxford Ser. (2) 34(136) (1983), 423-426.

 

  1. G. Cohen, Peter Frankl, Generalized perfect codes and Steiner systems, Annals Discr. Maths. 18 (1983), 197-200.

 

  1. Gérard Cohen, Peter Frankl, On cliques and partitions in Hamming spaces, Combinatorial mathematics (Marseille-Luminy, 1981), 211-217, North-Holland Math. Stud., 75, North-Holland, Amsterdam, 1983.

 

  1. Peter Frankl, Constructing finite sets with given intersections, Combinatorial mathematics (Marseille-Luminy, 1981), 289-291, North-Holland Math. Stud., 75, North-Holland, Amsterdam, 1983.

 

  1. Peter Frankl, A probabilistic proof for the LYM-inequality, Discrete Mathematics 43(2-3) (1983) 325.
    Download: pdf

 

  1. P. Frankl, N. M. Singhi, Linear dependencies among subsets of a finite set, European J. Combin. 4(4) (1983), 313-318.
    Download: pdf

 

  1. P. Frankl, A. M. Odlyzko, On subsets with cardinalities of intersections divisible by a fixed integer, European J. Combin. 4(3) (1983), 215-220.
    Download: pdf

 

  1. Peter Frankl, János Pach, On the number of sets in a null t-design, European J. Combin. 4(1) (1983), 21-23.
    Download: pdf

 

  1. M. Deza, P. Frankl, On t-distance sets of (0,± 1)-vectors, Geom. Dedicata 14(3) (1983), 293-301.

 

  1. M. Deza, P. Frankl, Erdős-Ko-Rado theorem - 22 years later, SIAM J. Algebraic Discrete Methods 4(4) (1983), 419-431.

 

  1. David E. Daykin, Peter Frankl, On Kruskal's cascades and counting containments in a set of subsets, Mathematika 30(1) (1983), 133-141.
    Download: pdf

 

  1. Peter Frankl, An extremal set theoretic characterization of some Steiner systems, Combinatorica 3(2) (1983), 193-199.

 

  1. M. Deza, Peter Frankl, N. M. Singhi, Functions of strength t1, Combinatorica 3(3-4) (1983), 331-339.

1982

  1. Peter Frankl, Covering graphs by equivalence relations, Theory and practice of combinatorics, 125-127, North-Holland Math. Stud., 60, North-Holland, Amsterdam, 1982.

 

  1. David E. Daykin, Peter Frankl, Sets of finite sets satisfying union conditions, Mathematika 29(1) (1982), 128-134.
    Download: pdf

 

  1. Pá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) (1982) 158-166.
    Download: pdf
  2. B. Bouchon G. Cohen, Peter Frankl, Metrical properties of fuzzy relations, , Problems Control Inform. Theory/Problemy Upravlen. Teor. Inform.11(5) (1982) 389-396.

 

  1. Peter Frankl, An extremal problem for two families of sets, European J. Combin. 3(2) (1982) 125-127.

 

  1. Michel Deza, Peter Frankl, On the vector space of 0-configurations, Combinatorica 2(4) (1982) 341-345.

1981

  1. Peter Frankl, On a problem of Chvátal and Erdős on hypergraphs containing no generalized simplex, J. Comb. Theory, Ser. A 30(2) (1981) 169-182.
    Download: pdf

 

  1. Peter Frankl, Regularity conditions and intersecting hypergraphs, Proc. Amer. Math. Soc. 82(2) (1981), 309-311.
    Download: pdf

 

  1. Peter Frankl, B. S. Stečkin, Local Turán property for k-graphs, Mat. Zametki 29(1) (1981) 83-94. (in Russian)

 

  1. Michel Deza, Peter Frankl, Every large set of equidistant (0, +1, -1)-vectors forms a sunflower, Combinatorica 1(3) (1981) 225-231.

 

  1. Peter Frankl, I. G. Rosenberg, A finite set intersection theorem, European J. Combin.2(2) (1981) 127-129.

 

  1. Peter Frankl, Zoltán Füredi, A short proof for a theorem of Harper about Hamming-spheres, Discrete Mathematics 34(3) (1981) 311-313.
    Download: pdf

 

  1. Gérard Cohen, Peter Frankl, Quelques problèmes de codage avec une nouvelle distance (French), [Some problems of coding with a new distance] Rev. CETHEDEC Cahier 1981, no. 2, 103-106 (1982).

 

  1. Peter Frankl, On large vector systems with equal scalar products, European J. Combin. 2(2) (1981) 123-125.

 

  1. D. E. Daykin P. Frankl C. Greene A.J.W. Hilton, A generalization of Sperner's theorem, J. Austral. Math. Soc. Ser. A 31(4) (1981) 481-485.

 

  1. Peter Frankl, Richard M. Wilson, Intersection theorems with geometric consequences, Combinatorica 1(4) (1981), 357-368.

 

  1. David E. Daykin, Peter Frankl, Sets of graph colourings, Graph theory (Cambridge, 1981), pp. 65-70, Ann. Discrete Math., 13, North-Holland, Amsterdam-New York, 1982.

1980

  1. László Babai, Peter Frankl, On set intersections, J. Comb. Theory, Ser. A 28(1) (1980) 103-105.
    Download: pdf

 

  1. Peter Frankl, Extremal problems and coverings of the space, European J. Combin. 1(2) (1980) 101-106.

 

  1. Peter Frankl, Families of finite sets with prescribed cardinalities for pairwise intersections, Acta Math. Acad. Sci. Hungar. 35(3-4) (1980) 351-360.351-360.

 

  1. Peter Frankl, A general intersection theorem for finite sets, Combinatorics 79 (Proc. Colloq., Univ. Montréal, Montreal, Que., 1979), Part II. Ann. Discrete Math. 9 (1980), 43-49.

 

  1. Peter Frankl, On intersecting families of finite sets, Bull. Austral. Math. Soc. 21(3) (1980), 363-372.

 

  1. G. Cohen, Peter Frankl, On tilings of the binary vector space, Discrete Math. 31(3) (1980) 271-277.

 

  1. J.-C. Bermond, Peter Frankl, F. Sterboul, On the maximum number of edges in a hypergraph whose linegraph contains no cycle, Discrete Math. 30(3) (1980) 295-298.

 

  1. Peter Frankl, Zoltán Füredi, The Erdős-Ko-Rado theorem for integer sequences, SIAM J. Algebraic Discrete Methods 1(4) (1980), 376-381.

 

  1. A. Békéssy, J. Demetrovics, L. Hanák, Peter Frankl, G.O.H. Katona, On the number of maximal dependencies in a data base relation of fixed order, Discrete Math. 30(2) (1980) 83-88.

1979

  1. Peter Frankl, Families of finite sets satisfying a union condition, Discrete Math. 26(2) (1979), 111-118.

 

  1. László Babai, Peter Frankl, János Kollár, Gert Sabidussi, Hamiltonian cubic graphs and centralizers of involutions, Canad. J. Math. 31(3) (1979), 458-464.

 

  1. L. Babai, Peter Frankl, Isomorphisms of Cayley graphs. II., Math. Acad. Sci. Hungar. 34(1-2) (1979) 177-183.

 

  1. Peter Frankl, G. O. H. Katona, If the intersection of any r sets has a size ≠r−1, Studia Sci. Math. Hungar. 14(1-3) (1979) 47-49. (1982)

1978

  1. Peter Frankl, On intersecting families of finite sets, J. Comb. Theory, Ser. A 24(2) (1978) 146-161.
    Download: pdf

 

  1. Peter Frankl, A Sperner-type theorem for families of finite sets, Period. Math. Hungar. 9(4) (1978) 257-267.

 

  1. Peter Frankl, An extremal problem for 3-graphs, Acta Math. Acad. Sci. Hungar. 32(1-2) (1978) 157-160.

 

  1. Peter Frankl, The Erdős-Ko-Rado theorem is true for n=ckt, Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. I, pp. 365-375, Colloq. Math. Soc. János Bolyai, 18, North-Holland, Amsterdam-New York, 1978.

 

  1. László Babai, Peter Frankl, Isomorphisms of Cayley graphs. I., Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. I, pp. 35-52, Colloq. Math. Soc. János Bolyai, 18, North-Holland, Amsterdam-New York, 1978.

 

  1. M. Deza P. Erdős, Peter Frankl, Intersection properties of systems of finite sets, Proc. London Math. Soc. (3) 36(2) (1978) 369-384.

 

  1. M. Deza P. Erdős, Peter Frankl, Intersection properties of systems of finite sets, Combinatorics (Proc. Fifth Hungarian Colloq., Keszthely, 1976), Vol. I, pp. 251-256, Colloq. Math. Soc. János Bolyai, 18, North-Holland, Amsterdam-New York, 1978.

 

  1. Peter Frankl, P. Frankl On a problem of Bondy and Hajnal, Problèmes combinatoires et théorie des graphes (Colloq. Internat. CNRS, Univ. Orsay, Orsay, 1976), p. 159, Colloq. Internat. CNRS, 260, CNRS, Paris, 1978.

 

  1. L. Babai, Peter Frankl, Infinite quasigroups with given regular automorphism groups, Algebra Universalis 8(3) (1978) 310-319.

 

  1. Peter Frankl, Intersecting hypergraphs with transitive group, Proc. Coll. Algebraic Methods in Grphs Theory, Szeged 1978, North Holland 1981, pp. 171-176.

1977

  1. Peter Frankl, Families of finite sets containing no k disjoint sets and their union, Period. Math. Hungar. 8(1) (1977) 29-31.

 

  1. Peter Frankl, On the minimum number of disjoint pairs in a family of finite sets, J. Combinatorial Theory Ser. A 22(2) (1977) .249-251

 

  1. Péter Frankl, On families of finite sets no two of which intersect in a singleton, Bull. Austral. Math. Soc. 17(1) (1977), 125-134.

 

  1. Peter Frankl, Mikhail Deza, On the maximum number of permutations with given maximal or minimal distance, J. Comb. Theory, Ser. A 22(3) (1977) 352-360.
    Download: pdf

 

  1. A. J. W. Hilton, Peter Frankl, On the minimum number of sets comparable with some members of a set of finite sets, J. London Math. Soc. (2) 15(1) (1977) 16-18.

 

  1. Péter Frankl, A constructive lower bound for some Ramsey numbers, Ars Combinatoria 3 (1977), 297-302.

 

  1. Peter Frankl, An intersection problem for finite sets, Acta Math. Acad. Sci. Hungar. 30(3-4) (1977) 371-373.

 

  1. J.-C. Bermond, Peter Frankl,, On a conjecture of Chvátal on m-intersecting hypergraphs, Bull. London Math. Soc. 9(3) (1977) 310-312.



1976

  1. Peter Frankl, On Sperner families satisfying an additional condition, J. Comb. Theory, Ser. A 20(1) (1976) 1-11.
    Download: pdf

 

  1. Peter Frankl, On commutator subgroups, Acta Math. Acad. Sci. Hungar. 27(1-2) (1976) 193-195.

 

  1. Peter Frankl, Generalizations of theorems of Katona and Milner, Acta Math. Acad. Sci. Hungar. 27(3-4) (1976) 359-363.

 

  1. Peter Frankl, An extremal problem of coding type, Ars Combinatorial 1(1) (1976) 53-55.

 

  1. Peter Frankl, Families of finite sets satisfying an intersection condition, Bull. Austral. Math. Soc. 15(1) (1976) 73-79.

 

  1. Peter Frankl, Families of finite sets satisfying union restrictions, Studia Sci. Math. Hungar. 11(1-2) (1976) 1-6.

1975

  1. Peter Frankl, Proof of a conjecture of G. O. H. Katona, J. Comb. Theory, Ser. A 19(2) (1975) 208-213.
    Download: pdf

1974

  1. P. Frankl, A theorem on Sperner-systems satisfying an additional condition, Studia Sci. Math. Hungar. 9(3-4) (1974), no. 425-431.