Stop the war!Остановите войну!
for scientists:
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
2020 – today
- 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) - [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 - [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
- [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) - [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
- [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) - [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)
2010 – 2019
- 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) - [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
- [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) - [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
- [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) - [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
- [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) - [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) - 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)
2000 – 2009
- 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)<