default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Frankl
Person information
- affiliation: Alfréd Rényi Institute of Mathematics, Budapest, Hungary
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2024
[j223]Peter Frankl:
On the Maximum of the Sum of the Sizes of Non-trivial Cross-Intersecting Families. Comb. 44(1): 15-35 (2024)- [j222]Zhen He, Peter Frankl, Ervin Györi, Zequn Lv, Nika Salia
, Casey Tompkins, Kitti Varga, Xiutao Zhu:
Extremal Results for Graphs Avoiding a Rainbow Subgraph. Electron. J. Comb. 31(1) (2024) - [j221]Peter Frankl, Jian Wang:
Improved Bounds Concerning the Maximum Degree of Intersecting Hypergraphs. Electron. J. Comb. 31(2) (2024) - [j220]Peter Frankl, Jian Wang:
Intersecting families without unique shadow. Comb. Probab. Comput. 33(1): 91-109 (2024) - [j219]Peter Frankl, Erica L. L. Liu, Jian Wang, Zhe Yang:
Non-trivial t-intersecting separated families. Discret. Appl. Math. 342: 124-137 (2024) - [j218]Peter Frankl, Glenn Hurlbert:
On the Holroyd-Talbot conjecture for sparse graphs. Discret. Math. 347(1): 113742 (2024) - [j217]Peter Frankl, Baolong Shang, Jian Wang, Jie You:
Families with restricted matching number and multiply covered shadows. Discret. Math. 347(3): 113831 (2024) - [j216]Peter Frankl, Andrey Kupavskii:
Intersection theorems for (-1,0,1)-vectors. Eur. J. Comb. 117: 103830 (2024) - [j215]Peter Frankl, Jian Wang:
Improved bounds on the maximum diversity of intersecting families. Eur. J. Comb. 118: 103885 (2024) - [j214]Gábor Hegedüs, Peter Frankl:
Variations on the Bollobás set-pair theorem. Eur. J. Comb. 120: 103983 (2024) - [j213]Peter Frankl, Jian Wang:
Four-vertex traces of finite sets. Graphs Comb. 40(1): 8 (2024) - [j212]Peter Frankl, János Pach, Dömötör Pálvölgyi:
Odd-sunflowers. J. Comb. Theory, Ser. A 206: 105889 (2024) - [j211]Noga Alon, Peter Frankl:
Turán graphs with bounded matching number. J. Comb. Theory B 165: 223-229 (2024) - 2023
- [j210]Peter Frankl, Andrey Kupavskii:
Perfect matchings in down-sets. Discret. Math. 346(5): 113323 (2023) - [j209]Peter Frankl, Erica L. L. Liu, Jian Wang, Zhe Yang:
Some inequalities concerning cross-intersecting families of integer sequences. Discret. Math. 346(12): 113574 (2023) - [j208]Peter Frankl, Sergei Kiselev, Andrey Kupavskii:
Best possible bounds on the number of distinct differences in intersecting families. Eur. J. Comb. 107: 103601 (2023) - [j207]Peter Frankl, Jian Wang:
Intersections and distinct intersections in cross-intersecting families. Eur. J. Comb. 110: 103665 (2023) - [j206]Peter Frankl, Andrey Kupavskii:
Uniform intersecting families with large covering number. Eur. J. Comb. 113: 103747 (2023) - [j205]Peter Frankl, Jian Wang:
A product version of the Hilton-Milner theorem. J. Comb. Theory A 200: 105791 (2023) - [j204]Gergely Ambrus, Imre Bárány, Peter Frankl, Dániel Varga:
Piercing the Chessboard. SIAM J. Discret. Math. 37(3): 1457-1471 (2023) - 2022
- [j203]Chao Shi, Peter Frankl, Jianguo Qian:
On Non-Empty Cross-Intersecting Families. Comb. 42(Supplement 2): 1513-1525 (2022) - [j202]Peter Frankl, János Pach:
On Well-Connected Sets of Strings. Electron. J. Comb. 29(1) (2022) - [j201]Peter Frankl, Andreas F. Holmsen, Andrey Kupavskii:
Intersection Theorems for Triangles. Discret. Comput. Geom. 68(3): 728-737 (2022) - [j200]Peter Frankl, Sergei Kiselev, Andrey Kupavskii:
On the maximum number of distinct intersections in an intersecting family. Discret. Math. 345(4): 112757 (2022) - [j199]Peter Frankl, Jian Wang:
On the sum of sizes of overlapping families. Discret. Math. 345(11): 113027 (2022) - [j198]Peter Frankl:
Pseudo sunflowers. Eur. J. Comb. 104: 103553 (2022) - [j197]Peter Frankl, Erica L. L. Liu, Jian Wang:
On the maximum number of edges in hypergraphs with fixed matching and clique number. Eur. J. Comb. 106: 103589 (2022) - [j196]Peter Frankl, Andrey Kupavskii:
The Erdős Matching Conjecture and concentration inequalities. J. Comb. Theory B 157: 366-400 (2022) - [j195]Peter Frankl:
A Finite Set Intersection Theorem. J. Multiple Valued Log. Soft Comput. 39(1): 105-110 (2022) - [j194]Peter Frankl, János Pach, Dömötör Pálvölgyi:
Exchange Properties of Finite Set-Systems. SIAM J. Discret. Math. 36(3): 2073-2081 (2022) - 2021
- [j193]Peter Frankl, Andrey Kupavskii:
Almost Intersecting Families. Electron. J. Comb. 28(2): 2 (2021) - [j192]Peter Frankl:
On the number of distinct differences in an intersecting family. Discret. Math. 344(2): 112210 (2021) - [j191]Peter Frankl, H. W. Willie Wong:
Analogues of Katona's and Milner's theorems for two families. Discret. Math. 344(5): 112327 (2021) - [j190]Peter Frankl:
On the size of shadow-added intersecting families. Eur. J. Comb. 92: 103243 (2021) - [j189]Peter Frankl:
Analogues of Milner's Theorem for families without long chains and of vector spaces. Eur. J. Comb. 93: 103279 (2021) - [j188]Peter Frankl, Andrey Kupavskii:
Beyond the Erdős Matching Conjecture. Eur. J. Comb. 95: 103338 (2021) - [j187]Peter Frankl:
Old and new applications of Katona's circle. Eur. J. Comb. 95: 103339 (2021) - [j186]Peter Frankl, Hao Huang, Vojtech Rödl:
On local Turán problems. J. Comb. Theory A 177: 105329 (2021) - [j185]Peter Frankl, Andrey Kupavskii:
Diversity. J. Comb. Theory A 182: 105468 (2021) - [j184]Peter Frankl, Gyula O. H. Katona:
On strengthenings of the intersecting shadow theorem. J. Comb. Theory A 184: 105510 (2021) - [j183]Imre Bárány, Peter Frankl:
How (Not) to Cut Your Cheese. Am. Math. Mon. 128(6): 543-552 (2021) - 2020
- [j182]Peter Frankl:
Erdős-Ko-Rado Theorem for a Restricted Universe. Electron. J. Comb. 27(2): 2 (2020) - [j181]Peter Frankl:
Families of finite sets satisfying intersection restrictions. Discret. Appl. Math. 276: 44-49 (2020) - [j180]Peter Frankl:
Mixed matchings in graphs. Discret. Math. 343(2): 111660 (2020) - [j179]Peter Frankl:
On non-trivial families without a perfect matching. Eur. J. Comb. 84 (2020) - [j178]Peter Frankl, Andrey Kupavskii:
Sharp results concerning disjoint cross-intersecting families. Eur. J. Comb. 86: 103089 (2020) - [j177]Peter Frankl:
An improved universal bound for t-intersecting families. Eur. J. Comb. 87: 103134 (2020) - [j176]Peter Frankl:
Extremal set theory for the binomial norm. J. Comb. Theory A 170 (2020) - [j175]Peter Frankl:
Maximum degree and diversity in intersecting hypergraphs. J. Comb. Theory B 144: 81-94 (2020) - 2019
- [j174]Peter Frankl, Andrey Kupavskii:
Incompatible Intersection Properties. Comb. 39(6): 1255-1266 (2019) - [j173]Peter Frankl:
A near-exponential improvement of a bound of Erdős and Lovász on maximal intersecting families. Comb. Probab. Comput. 28(5): 733-739 (2019) - [j172]Peter Frankl, Andrey Kupavskii:
Families of sets with no matchings of sizes 3 and 4. Eur. J. Comb. 75: 123-135 (2019) - [j171]Peter Frankl:
Some exact results for multiply intersecting families. J. Comb. Theory B 136: 222-248 (2019) - [j170]Peter Frankl, Andrey Kupavskii:
Two problems on matchings in set families - In the footsteps of Erdős and Kleitman. J. Comb. Theory B 138: 286-313 (2019) - 2018
- [j169]Peter Frankl:
Resilient Hypergraphs with Fixed Matching Number. Comb. 38(5): 1079-1094 (2018) - [j168]Peter Frankl, Andrey Kupavskii:
Counting Intersecting and Pairs of Cross-Intersecting Families. Comb. Probab. Comput. 27(1): 60-68 (2018) - [j167]Peter Frankl:
Partition-free families of sets. Discret. Math. 341(7): 2080-2082 (2018) - [j166]Peter Frankl:
Best possible bounds concerning the set-wise union of families. Eur. J. Comb. 69: 1-6 (2018) - [j165]Peter Frankl:
On families of sets without k pairwise disjoint members. J. Comb. Theory B 130: 92-97 (2018) - [j164]Peter Frankl, Andrey Kupavskii:
Erdős-Ko-Rado theorem for {0, ±1}-vectors. J. Comb. Theory A 155: 157-179 (2018) - [j163]Peter Frankl, Jie Han, Hao Huang, Yi Zhao:
A degree version of the Hilton-Milner theorem. J. Comb. Theory A 155: 493-502 (2018) - [j162]Peter Frankl, Andrey Kupavskii:
New inequalities for families without k pairwise disjoint members. J. Comb. Theory A 157: 427-434 (2018) - [j161]János Pach, Peter Frankl:
A stability theorem on cube tessellations. J. Comput. Geom. 9(1): 387-390 (2018) - [j160]Peter Frankl:
An exact result for (0, ± 1)-vectors. Optim. Lett. 12(5): 1011-1017 (2018) - 2017
- [j159]Peter Frankl:
A Stability Result for Families with Fixed Diameter. Comb. Probab. Comput. 26(4): 506-516 (2017) - [j158]Peter Frankl, Andrey Kupavskii:
Uniform s-Cross-Intersecting Families. Comb. Probab. Comput. 26(4): 517-524 (2017) - [j157]Peter Frankl:
On the maximum number of edges in a hypergraph with given matching number. Discret. Appl. Math. 216: 562-581 (2017) - [j156]Peter Frankl:
A structural result for 3-graphs. Discret. Math. 340(5): 1039-1041 (2017) - [j155]Peter Frankl, Norihide Tokushige:
A note on Huang-Zhao theorem on intersecting families with large minimum degree. Discret. Math. 340(5): 1098-1103 (2017) - [j154]Peter Frankl, Andrey Kupavskii:
A size-sensitive inequality for cross-intersecting families. Eur. J. Comb. 62: 263-271 (2017) - [j153]Peter Frankl, Andrey Kupavskii:
Families with no matchings of size s. Electron. Notes Discret. Math. 61: 483-489 (2017) - [j152]Peter Frankl:
A stability result for the Katona theorem. J. Comb. Theory B 122: 869-876 (2017) - [j151]Peter Frankl, Andrey Kupavskii:
Families with no s pairwise disjoint sets. J. Lond. Math. Soc. 95(3): 875-894 (2017) - [j150]Peter Frankl, Amram Meir, János Pach:
Decomposition of a Cube into Nearly Equal Smaller Cubes. Am. Math. Mon. 124(10): 895-904 (2017) - 2016
- [j149]Peter Frankl, Yoshiharu Kohayakawa, Vojtech Rödl:
A note on supersaturated set systems. Eur. J. Comb. 51: 190-199 (2016) - [j148]Peter Frankl, Norihide Tokushige:
Uniform eventown problems. Eur. J. Comb. 51: 280-286 (2016) - [j147]Peter Frankl:
Linear independence, a unifying approach to shadow theorems. Eur. J. Comb. 57: 36-39 (2016) - [j146]Peter Frankl, Masashi Shinohara, Norihide Tokushige:
Multiply union families in Nn. Eur. J. Comb. 58: 66-74 (2016) - [j145]Peter Frankl, Norihide Tokushige:
Intersection problems in the q-ary cube. J. Comb. Theory A 141: 90-126 (2016) - [j144]Peter Frankl, Norihide Tokushige:
Invitation to intersection problems for finite sets. J. Comb. Theory A 144: 157-211 (2016) - 2014
- [j143]Peter Frankl, Sangjune Lee, Mark H. Siggers, Norihide Tokushige:
An Erdős-Ko-Rado theorem for cross t-intersecting families. J. Comb. Theory A 128: 207-249 (2014) - 2013
- [j142]Andrzej Dudek, Peter Frankl, Vojtech Rödl:
Some recent results on Ramsey-type numbers. Discret. Appl. Math. 161(9): 1197-1202 (2013) - [j141]Dwight Duffus, Peter Frankl, Vojtech Rödl:
Maximal independent sets in the covering graph of the cube. Discret. Appl. Math. 161(9): 1203-1208 (2013) - [j140]Peter Frankl, Mitsuo Kato, Gyula O. H. Katona, Norihide Tokushige:
Two-colorings with many monochromatic cliques in both colors. J. Comb. Theory B 103(4): 415-427 (2013) - [j139]Peter Frankl:
On the number of nonnegative sums. J. Comb. Theory B 103(5): 647-649 (2013) - [j138]Peter Frankl:
Improved bounds for Erdős' Matching Conjecture. J. Comb. Theory A 120(5): 1068-1072 (2013) - [j137]Peter Frankl, Norihide Tokushige:
The Katona theorem for vector spaces. J. Comb. Theory A 120(7): 1578-1589 (2013) - 2012
- [j136]Peter Frankl, Tomasz Luczak, Katarzyna Mieczkowska:
On Matchings in Hypergraphs. Electron. J. Comb. 19(2): 42 (2012) - [j135]Peter Frankl, Vojtech Rödl, Andrzej Rucinski:
On the Maximum Number of Edges in a Triple System Not Containing a Disjoint Family of a Given Size. Comb. Probab. Comput. 21(1-2): 141-148 (2012) - [j134]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 A 119(6): 1200-1215 (2012) - [j133]Peter Frankl, Zoltán Füredi:
A new short proof of the EKR theorem. J. Comb. Theory A 119(6): 1388-1390 (2012) - 2011
- [j132]Peter Frankl, Norihide Tokushige:
On r-Cross Intersecting Families of Sets. Comb. Probab. Comput. 20(5): 749-752 (2011) - [j131]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) - 2010
- [j130]Aart Blokhuis, Andries E. Brouwer, Ameera Chowdhury, Peter Frankl, T. Mussche, Balázs Patkós, Tamás Szönyi:
A Hilton-Milner Theorem for Vector Spaces. Electron. J. Comb. 17(1) (2010) - 2009
- [j129]Andrzej Dudek, Peter Frankl, Vojtech Rödl:
A Note on Universal and Canonically Coloured Sequences. Comb. Probab. Comput. 18(5): 683-689 (2009) - 2008
- [j128]Peter Frankl, Gyula Y. Katona:
Extremal k-edge-hamiltonian hypergraphs. Discret. Math. 308(8): 1415-1424 (2008) - 2007
- [j127]Peter Frankl, Yuejian Peng, Vojtech Rödl, John M. Talbot:
A note on the jumping constant conjecture of Erdös. J. Comb. Theory B 97(2): 204-216 (2007) - 2006
- [j126]Peter Frankl, Norihide Tokushige:
Weighted Non-Trivial Multiply Intersecting Families. Comb. 26(1): 37-46 (2006) - [j125]Peter Frankl, Norihide Tokushige:
The Maximum Size of 3-Wise Intersecting and 3-Wise Union Families. Graphs Comb. 22(2): 225-231 (2006) - 2005
- [j124]Peter Frankl, Norihide Tokushige:
Random walks and multiply intersecting families. J. Comb. Theory A 109(1): 121-134 (2005) - 2003
- [j123]Peter Frankl, Norihide Tokushige:
The game of n-times nim. Discret. Math. 260(1-3): 205-209 (2003) - 2002
- [j122]Peter Frankl, Norihide Tokushige:
Weighted 3-Wise 2-Intersecting Families. J. Comb. Theory A 100(1): 94-115 (2002) - [j121]Peter Frankl, Vojtech Rödl:
Extremal problems on set systems. Random Struct. Algorithms 20(2): 131-164 (2002) - 2001
- [j120]Peter Frankl, Gyula Y. Katona:
Extremal k-edge-hamiltonian Hypergraphs. Electron. Notes Discret. Math. 10: 109-112 (2001) - [j119]László Babai, Peter Frankl, Samuel Kutin, Daniel Stefankovic:
Set Systems with Restricted Intersections modulo Prime Powers. J. Comb. Theory A 95(1): 39-73 (2001) - 2000
- [j118]Peter Frankl, Gyula Y. Katona:
Extremal k-edge-hamiltonian Hypergraphs. Electron. Notes Discret. Math. 5: 130-133 (2000) - 1999
- [j117]Peter Frankl, Norihide Tokushige:
The Erdos-Ko-Rado Theorem for Integer Sequences. Comb. 19(1): 55-63 (1999) - 1998
- [j116]Peter Frankl, Katsuhiro Ota, Norihide Tokushige:
Uniform Intersecting Families with Covering Number Restrictions. Comb. Probab. Comput. 7(1): 47-56 (1998) - [j115]Peter Frankl, Norihide Tokushige:
Some Inequalities Concerning Cross-Intersecting Families. Comb. Probab. Comput. 7(3): 247-260 (1998) - 1996
- [j114]Peter Frankl:
An Erdos-Ko-Rado Theorem for Direct Products. Eur. J. Comb. 17(8): 727-730 (1996) - [j113]Peter Frankl, Katsuhiro Ota, Norihide Tokushige:
Covers in Uniform Intersecting Families and a Counterexample to a Conjecture of Lovász. J. Comb. Theory A 74(1): 33-42 (1996) - [j112]Peter Frankl, Katsuhiro Ota, Norihide Tokushige:
Exponents of Uniform L-Systems. J. Comb. Theory A 75(1): 23-43 (1996) - 1995
- [j111]Peter Frankl, Hiroshi Maehara, Junichiro Nakashima:
On the section of a convex polyhedron. Discret. Math. 140(1-3): 265-267 (1995) - [j110]Peter Frankl, Makoto Matsumoto, Imre Z. Ruzsa, Norihide Tokushige:
Minimum Shadows in Uniform Hypergraphs and a Generalization of the Takagi Function. J. Comb. Theory A 69(1): 125-148 (1995) - [j109]Peter Frankl, Katsuhiro Ota, Norihide Tokushige:
Uniform Intersecting Families with Covering Number Four. J. Comb. Theory A 71(1): 127-145 (1995) - 1994
- [j108]Peter Frankl, M. Watanabe:
Density Results for Uniform Families. Comb. 14(1): 115-119 (1994) - [j107]M. Watanabe, Peter Frankl:
Some best possible bounds concerning the traces of finite sets. Graphs Comb. 10(2-4): 283-292 (1994) - 1993
- [j106]Peter Frankl, Norihide Tokushige:
Weight functions on the kneser graph and the solution of an intersection problem of Sali. Comb. 13(4): 413-420 (1993) - [j105]Imre Bárány, Peter Frankl, Hiroshi Maehara:
Reflecting a triangle in the plane. Graphs Comb. 9(2-4): 97-104 (1993) - 1992
- [j104]Péter L. Erdös, Peter Frankl, Daniel J. Kleitman, Michael E. Saks, László A. Székely:
Sharpening the LYM inequality. Comb. 12(3): 287-293 (1992) - [j103]Peter Frankl:
The convex hull of antichains in posets. Comb. 12(4): 493-496 (1992) - [j102]A. Robert Calderbank, Peter Frankl:
Improved Upper Bounds Concerning the Erdös-Ko-Rado Theorem. Comb. Probab. Comput. 1: 115-122 (1992) - [j101]Peter Frankl:
On cross-intersecting families. Discret. Math. 108(1-3): 291-295 (1992) - [j100]Peter Frankl, Vojtech Rödl:
The Uniformity Lemma for hypergraphs. Graphs Comb. 8(4): 309-312 (1992) - [j99]Peter Frankl, Norihide Tokushige:
Some Best Possible Inequalities Concerning Cross-Intersecting Families. J. Comb. Theory A 61(1): 87-97 (1992) - 1991
- [j98]Peter Frankl, Zoltán Füredi:
A sharpening of Fisher's inequality. Discret. Math. 90(1): 103-107 (1991) - [j97]Peter Frankl:
Shadows and shifting. Graphs Comb. 7(1): 23-29 (1991) - [j96]Peter Frankl:
Multiply-intersecting families. J. Comb. Theory B 53(2): 195-234 (1991) - [j95]Peter Frankl, Zoltán Füredi:
Beyond the Erdös-Ko-Rado theorem. J. Comb. Theory A 56(2): 182-194 (1991) - 1990
- [j94]A. Robert Calderbank, Peter Frankl:
Binary codes and quasi-symmetric designs. Discret. Math. 83(2-3): 201-204 (1990) - [j93]Peter Frankl:
An intersection problem for codes. Discret. Math. 84(2): 135-141 (1990) - [j92]Peter Frankl, Hiroshi Maehara:
Simplices with Given 2-Face Areas. Eur. J. Comb. 11(3): 241-247 (1990) - [j91]Peter Frankl:
Asymptotic solution of a turán-type problem. Graphs Comb. 6(3): 223-227 (1990) - [j90]Peter Frankl:
Intersection theorems and mod p rank of inclusion matrices. J. Comb. Theory A 54(1): 85-94 (1990) - [j89]Peter Frankl, Ronald L. Graham, Vojtech Rödl:
Iterated combinatorial density theorems. J. Comb. Theory A 54(1): 95-111 (1990) - [j88]Peter Frankl:
Canonical Antichains on the Circle and Applications. SIAM J. Discret. Math. 3(3): 355-363 (1990) - 1989
- [j87]Peter Frankl:
A lower bound on the size of a complex generated by an antichain. Discret. Math. 76(1): 51-56 (1989) - [j86]Peter J. Cameron, Peter Frankl, William M. Kantor:
Intersecting Families of Finite Sets and Fixed-point-Free 2-Elements. Eur. J. Comb. 10(2): 149-160 (1989) - [j85]Peter Frankl:
Helly-type Theorems for Varieties. Eur. J. Comb. 10(3): 243-245 (1989) - [j84]Peter Frankl:
Traces of antichains. Graphs Comb. 5(1): 295-299 (1989) - [j83]Peter Frankl, Zoltán Füredi:
Extremal problems whose solutions are the blowups of the small witt-designs. J. Comb. Theory A 52(1): 129-147 (1989) - 1988
- [j82]Peter J. Cameron, Michel Deza, Peter Frankl:
Intersection theorems in permutation groups. Comb. 8(3): 249-260 (1988) - [j81]Peter Frankl, Vojtech Rödl:
Some Ramsey - Turán type results for hypergraphs. Comb. 8(4): 323-332 (1988) - [j80]Peter Frankl, Hiroshi Maehara:
On the Contact Dimensions of Graphs. Discret. Comput. Geom. 3: 89-96 (1988) - [j79]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 B 44(3): 317-328 (1988) - [j78]Peter Frankl, Hiroshi Maehara:
The Johnson-Lindenstrauss lemma and the sphericity of some graphs. J. Comb. Theory B 44(3): 355-362 (1988) - [j77]Peter Frankl, Ronald L. Graham, Vojtech Rödl:
Quantitative theorems for regular systems of equations. J. Comb. Theory A 47(2): 246-261 (1988) - [j76]Peter Frankl, János Pach:
An extremal problem on Kr-free graphs. J. Graph Theory 12(4): 519-523 (1988) - 1987
- [j75]Anders Björner, Peter Frankl, Richard P. Stanley:
The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem. Comb. 7(1): 23-34 (1987) - [j74]Peter Frankl:
On a pursuit game on Cazley graphs. Comb. 7(1): 67-70 (1987) - [j73]Peter Frankl:
Cops and robbers in graphs with large girth and Cayley graphs. Discret. Appl. Math. 17(3): 301-305 (1987) - [j72]Peter Frankl, Hiroshi Maehara:
Open-interval graphs versus closed-interval graphs. Discret. Math. 63(1): 97-100 (1987) - [j71]Hikoe Enomoto, Peter Frankl, Noboru Ito, Kazumasa Nomura:
Codes with given distances. Graphs Comb. 3(1): 25-38 (1987) - [j70]Fan R. K. Chung, Peter Frankl:
The maximum number of edges in a 3-graph not containing a given star. Graphs Comb. 3(1): 111-126 (1987) - [j69]Peter Frankl, Zoltán Füredi, János Pach:
Bounding one-way differences. Graphs Comb. 3(1): 341-347 (1987) - [j68]Peter Frankl, Ronald L. Graham, Vojtech Rödl:
Induced restricted Ramsey theorems for spaces. J. Comb. Theory A 44(1): 120-128 (1987) - [j67]Peter Frankl, Ronald L. Graham:
The Radon transform on Abelian Groups. J. Comb. Theory A 44(1): 168-171 (1987) - [j66]Mikhail Deza, Peter Frankl:
A helly type theorem for hypersurfaces. J. Comb. Theory A 45(1): 27-30 (1987) - [j65]Peter Frankl, Ronald L. Graham, Vojtech Rödl:
On subsets of abelian groups with no 3-term arithmetic progression. J. Comb. Theory A 45(1): 157-161 (1987) - [j64]Peter Frankl, Zoltán Füredi:
Exact solution of some Turán-type problems. J. Comb. Theory A 45(2): 226-262 (1987) - [j63]Peter Frankl:
Erdös-Ko-Rado theorem with conditions on the maximal degree. J. Comb. Theory A 46(2): 252-263 (1987) - 1986
- [j62]Peter Frankl:
Orthogonal vectors in the n-dimensional cube and codes with missing distances. Comb. 6(3): 279-286 (1986) - [j61]Peter Frankl, Zoltán Füredi:
Finite projective spaces and intersecting hypergraphs. Comb. 6(4): 335-354 (1986) - [j60]Michel Deza, Peter Frankl:
On Squashed Designs. Discret. Comput. Geom. 1: 379-390 (1986) - [j59]Peter Frankl:
What must be contained in every oriented k-uniform hypergraph. Discret. Math. 62(3): 311-313 (1986) - [j58]Konrad Engel, Peter Frankl:
An Erdös-Ko-Rado Theorem for Integer Sequences of Given Rank. Eur. J. Comb. 7(3): 215-220 (1986) - [j57]Peter Frankl, Hiroshi Maehara:
Embedding the n-cube in Lower Dimensions. Eur. J. Comb. 7(3): 221-225 (1986) - [j56]Paul 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 Comb. 2(1): 113-121 (1986) - [j55]Peter Frankl, Vojtech Rödl:
Large triangle-free subgraphs in graphs withoutK4. Graphs Comb. 2(1): 135-144 (1986) - [j54]Peter Frankl, Zoltán Füredi:
Extremal problems concerning Kneser graphs. J. Comb. Theory B 40(3): 270-284 (1986) - [j53]Peter Frankl, Zoltán Füredi:
Non-trivial intersecting families. J. Comb. Theory A 41(1): 150-153 (1986) - [j52]Peter Frankl:
All rationals occur as exponents. J. Comb. Theory A 42(2): 200-206 (1986) - [j51]Fan R. K. Chung, Ronald L. Graham, Peter Frankl, James B. Shearer:
Some intersection theorems for ordered sets and graphs. J. Comb. Theory A 43(1): 23-37 (1986) - [j50]Peter Frankl, Richard M. Wilson:
The Erdös-Ko-Rado theorem for vector spaces. J. Comb. Theory A 43(2): 228-236 (1986) - 1985
- [j49]Péter L. Erdös, Peter Frankl, Gyula O. H. Katona:
Extremal hypergraph problems and convex hulls. Comb. 5(1): 11-26 (1985) - [j48]Gérard D. Cohen, Peter Frankl:
Good coverings of Hamming spaces with spheres. Discret. Math. 56(2-3): 125-131 (1985) - [j47]Peter Frankl, Ronald L. Graham:
Intersection Theorems for Vector Spaces. Eur. J. Comb. 6(2): 183-187 (1985) - [j46]Peter Frankl, Gyula O. H. Katona:
Polytopes Determined by Hypergraph Classes. Eur. J. Comb. 6(3): 233-243 (1985) - [j45]Peter Frankl, Vojtech Rödl:
Near Perfect Coverings in Graphs and Hypergraphs. Eur. J. Comb. 6(4): 317-326 (1985) - [j44]Noga Alon, Peter Frankl:
The maximum number of disjoint pairs in a family of subsets. Graphs Comb. 1(1): 13-21 (1985) - [j43]Peter Frankl, Vojtech Rödl:
Lower bounds for Turán's problem. Graphs Comb. 1(1): 213-216 (1985) - [j42]Peter Frankl, Zoltán Füredi:
Forbidding Just One Intersection. J. Comb. Theory A 39(2): 160-176 (1985) - [j41]Jin Akiyama, Peter Frankl:
On the size of graphs with complete-factors. J. Graph Theory 9(1): 197-201 (1985) - [j40]Peter Frankl:
On the chromatic number of the general Kneser-graph. J. Graph Theory 9(2): 217-220 (1985) - 1984
- [j39]Péter L. Erdös, Peter Frankl, Gyula O. H. Katona:
Intersecting Sperner families and their convex hulls. Comb. 4(1): 21-34 (1984) - [j38]Peter Frankl, János Pach:
On disjointly representable sets. Comb. 4(1): 39-45 (1984) - [j37]Peter Frankl:
Families of finite sets with three intersections. Comb. 4(2): 141-148 (1984) - [j36]Peter Frankl, Vojtech Rödl:
Hypergraphs do not jump. Comb. 4(2): 149-159 (1984) - [j35]Peter Frankl, Zoltán Füredi:
A new extremal property of Steiner triple-systems. Discret. Math. 48(2-3): 205-212 (1984) - [j34]Peter Frankl:
A new short proof for the Kruskal-Katona theorem. Discret. Math. 48(2-3): 327-329 (1984) - [j33]Peter Frankl, Zoltán Füredi:
An exact result for 3-graphs. Discret. Math. 50: 323-328 (1984) - [j32]Peter Frankl, Zoltán Füredi:
Union-free Hypergraphs and Probability Theory. Eur. J. Comb. 5(2): 127-131 (1984) - [j31]Peter Frankl, Zoltán Füredi:
On Hypergraphs without Two Edges Intersecting in a Given Number of Vertices. J. Comb. Theory A 36(2): 230-236 (1984) - [j30]Mikhail Deza, Peter Frankl:
Injection geometries. J. Comb. Theory B 37(1): 31-40 (1984) - 1983
- [j29]Peter Frankl:
An extremal set theoretical characterization of some Steiner systems. Comb. 3(2): 193-199 (1983) - [j28]Michel Deza, Peter Frankl, N. M. Singhi:
On Functions of Strenth t. Comb. 3(3): 331-339 (1983) - [j27]Peter Frankl, Zoltán Füredi:
A new generation of the Erdös - Ko - Rado theorem. Comb. 3(3): 341-350 (1983) - [j26]Peter Frankl:
A probabilistic proof for the lym-inequality. Discret. Math. 43(2-3): 325 (1983) - [j25]Peter Frankl, János Pach:
On the Number of Sets in a Null t-Design. Eur. J. Comb. 4(1): 21-23 (1983) - [j24]Peter Frankl, Andrew M. Odlyzko:
On Subsets with Cardinalities of Intersections Divisible by a Fixed Integer. Eur. J. Comb. 4(3): 215-220 (1983) - [j23]Peter Frankl, Navin M. Singhi:
Linear Dependencies among Subsets of a Finite Set. Eur. J. Comb. 4(4): 313-318 (1983) - [j22]Peter Frankl:
On the Trace of Finite Sets. J. Comb. Theory A 34(1): 41-45 (1983) - 1982
- [j21]Michel Deza, Peter Frankl:
On the vector space of 0-configurations. Comb. 2(4): 341-345 (1982) - [j20]Peter Frankl:
An Extremal Problem for two Families of Sets. Eur. J. Comb. 3(2): 125-127 (1982) - [j19]Paul 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 A 33(2): 158-166 (1982) - 1981
- [j18]Michel Deza, Peter Frankl:
Every large set of equidistant (0, +1, -1)-vectors forms a sunflower. Comb. 1(3): 225-231 (1981) - [j17]Peter Frankl, Richard M. Wilson:
Intersection theorems with geometric consequences. Comb. 1(4): 357-368 (1981) - [j16]Peter Frankl, Zoltán Füredi:
A short proof for a theorem of Harper about Hamming-spheres. Discret. Math. 34(3): 311-313 (1981) - [j15]Peter Frankl:
On Large Vector Systems with Equal Scalar Products. Eur. J. Comb. 2(2): 123-125 (1981) - [j14]Peter Frankl, Ivo G. Rosenberg:
A Finite Set Intersection Theorem. Eur. J. Comb. 2(2): 127-129 (1981) - [j13]Peter Frankl:
On a Problem of Chvátal and Erdös on Hypergraphs Containing No Generalized Simplex. J. Comb. Theory A 30(2): 169-182 (1981) - 1980
- [j12]A. Békéssy, János Demetrovics, László Hannák, Peter Frankl, Gyula O. H. Katona:
On the number of maximal dependencies in a data base relation of fixed order. Discret. Math. 30(2): 83-88 (1980) - [j11]Jean-Claude Bermond, Peter Frankl, F. Sterboul:
On the maximum number of edges in a hypergraph whose linegraph contains no cycle. Discret. Math. 30(3): 295-298 (1980) - [j10]Gérard D. Cohen, Peter Frankl:
On tilings of the binary vector space. Discret. Math. 31(3): 271-277 (1980) - [j9]Peter Frankl:
Extremal Problems and Coverings of the Space. Eur. J. Comb. 1(2): 101-106 (1980) - [j8]László Babai, Peter Frankl:
On Set Intersections. J. Comb. Theory A 28(1): 103-105 (1980) - [j7]Peter Frankl, Zoltán Füredi:
The Erdös-Ko-Rado Theorem for Integer Sequences. SIAM J. Algebraic Discret. Methods 1(4): 376-381 (1980) - 1979
- [j6]Peter Frankl:
Families of finite sets satisfying a union condition. Discret. Math. 26(2): 111-118 (1979) - 1978
- [j5]Peter Frankl:
On Intersecting Families of Finite Sets. J. Comb. Theory A 24(2): 146-161 (1978) - 1977
- [j4]Peter Frankl:
On the Minimum Number of Disjoint Pairs in a Family of Finite Sets. J. Comb. Theory A 22(2): 249-251 (1977) - [j3]Peter Frankl, Mikhail Deza:
On the Maximum Number of Permutations with Given Maximal or Minimal Distance. J. Comb. Theory A 22(3): 352-360 (1977) - 1976
- [j2]Peter Frankl:
On Sperner Families Satisfying an Additional Condition. J. Comb. Theory A 20(1): 1-11 (1976) - 1975
- [j1]Peter Frankl:
The Proof of a Conjecture of G. O. H. Katona. J. Comb. Theory A 19(2): 208-213 (1975)
Conference and Workshop Papers
- 2022
- [c3]Peter Frankl, Svyatoslav Gryaznov, Navid Talebanfard:
A Variant of the VC-Dimension with Applications to Depth-3 Circuits. ITCS 2022: 72:1-72:19 - 1986
- [c2]László Babai, Peter Frankl, Janos Simon:
Complexity classes in communication complexity theory (preliminary version). FOCS 1986: 337-347 - 1985
- [c1]Noga Alon, Peter Frankl, Vojtech Rödl:
Geometrical Realization of Set Systems and Probabilistic Communication Complexity. FOCS 1985: 277-280
Informal and Other Publications
- 2022
- [i26]Peter Frankl, Andrey Kupavskii:
Perfect matchings in down-sets. CoRR abs/2201.03865 (2022) - [i25]Noga Alon, Peter Frankl:
Turán graphs with bounded matching number. CoRR abs/2210.15076 (2022) - 2021
- [i24]Peter Frankl, Andrey Kupavskii:
Uniform intersecting families with large covering number. CoRR abs/2106.05344 (2021) - [i23]Peter Frankl, Sergei Kiselev, Andrey Kupavskii:
Best possible bounds on the number of distinct differences in intersecting families. CoRR abs/2106.05355 (2021) - [i22]Peter Frankl, Sergei Kiselev, Andrey Kupavskii:
On the maximum number of distinct intersections in an intersecting family. CoRR abs/2108.00479 (2021) - [i21]Peter Frankl, Svyatoslav Gryaznov, Navid Talebanfard:
A Variant of the VC-dimension with Applications to Depth-3 Circuits. CoRR abs/2111.09671 (2021) - 2020
- [i20]Peter Frankl, Andrey Kupavskii:
Almost intersecting families. CoRR abs/2004.08714 (2020) - [i19]Peter Frankl, Andrey Kupavskii:
Maximal degrees in subgraphs of Kneser graphs. CoRR abs/2004.08718 (2020) - [i18]Peter Frankl, Andrey Kupavskii:
Intersection theorems for (-1, 0, 1)-vectors. CoRR abs/2004.08721 (2020) - [i17]Peter Frankl, Andreas F. Holmsen, Andrey Kupavskii:
Intersection theorems for triangles. CoRR abs/2009.14560 (2020) - 2019
- [i16]Peter Frankl, Andrey Kupavskii:
Simple juntas for shifted families. CoRR abs/1901.03816 (2019) - [i15]Peter Frankl, Andrey Kupavskii:
Beyond the Erdős Matching Conjecture. CoRR abs/1901.09278 (2019) - [i14]Peter Frankl, Andrey Kupavskii:
Sharp results concerning disjoint cross-intersecting families. CoRR abs/1905.08123 (2019) - 2018
- [i13]Peter Frankl, Andrey Kupavskii:
New inequalities for families without k pairwise disjoint members. CoRR abs/1804.03581 (2018) - [i12]Peter Frankl, Andrey Kupavskii:
Incompatible intersection properties. CoRR abs/1808.01229 (2018) - [i11]Peter Frankl, Andrey Kupavskii:
Diversity. CoRR abs/1811.01111 (2018) - 2017
- [i10]Peter Frankl, Andrey Kupavskii:
Families of sets with no matchings of sizes 3 and 4. CoRR abs/1701.04107 (2017) - [i9]Peter Frankl, Andrey Kupavskii:
Counting intersecting and pairs of cross-intersecting families. CoRR abs/1701.04110 (2017) - [i8]Peter Frankl, Andrey Kupavskii:
Families of vectors without antipodal pairs. CoRR abs/1705.07216 (2017) - [i7]Peter Frankl, Andrey Kupavskii:
Partition-free families of sets. CoRR abs/1706.00215 (2017) - 2016
- [i6]Peter Frankl, Andrey Kupavskii:
A size-sensitive inequality for cross-intersecting families. CoRR abs/1603.00936 (2016) - [i5]Peter Frankl, Andrey Kupavskii:
Intersection theorems for {0, ±1}-vectors and s-cross-intersecting families. CoRR abs/1603.00938 (2016) - [i4]Peter Frankl, Andrey Kupavskii:
Families with no s pairwise disjoint sets. CoRR abs/1607.06122 (2016) - [i3]Peter Frankl, Andrey Kupavskii:
Two problems of P. Erdős on matchings in set families. CoRR abs/1607.06126 (2016) - [i2]Peter Frankl, Andrey Kupavskii:
Uniform s-cross-intersecting families. CoRR abs/1611.07258 (2016) - 2015
- [i1]Peter Frankl, Andrey Kupavskii:
Erdős-Ko-Rado theorem for {0, ±: 1}-vectors. CoRR abs/1510.03912 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
