Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Peter Frankl
@article{DBLP:journals/combinatorica/Frankl24,
author = {Peter Frankl},
title = {On the Maximum of the Sum of the Sizes of Non-trivial Cross-Intersecting
Families},
journal = {Comb.},
volume = {44},
number = {1},
pages = {15--35},
year = {2024},
url = {https://doi.org/10.1007/s00493-023-00060-5},
doi = {10.1007/S00493-023-00060-5},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/Frankl24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/HeFGLSTVZ24,
author = {Zhen He and
Peter Frankl and
Ervin Gy{\"{o}}ri and
Zequn Lv and
Nika Salia and
Casey Tompkins and
Kitti Varga and
Xiutao Zhu},
title = {Extremal Results for Graphs Avoiding a Rainbow Subgraph},
journal = {Electron. J. Comb.},
volume = {31},
number = {1},
year = {2024},
url = {https://doi.org/10.37236/11676},
doi = {10.37236/11676},
timestamp = {Fri, 01 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorics/HeFGLSTVZ24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/FranklW24,
author = {Peter Frankl and
Jian Wang},
title = {Intersecting families without unique shadow},
journal = {Comb. Probab. Comput.},
volume = {33},
number = {1},
pages = {91--109},
year = {2024},
url = {https://doi.org/10.1017/s0963548323000305},
doi = {10.1017/S0963548323000305},
timestamp = {Tue, 26 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/FranklW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/FranklLWY24,
author = {Peter Frankl and
Erica L. L. Liu and
Jian Wang and
Zhe Yang},
title = {Non-trivial t-intersecting separated families},
journal = {Discret. Appl. Math.},
volume = {342},
pages = {124--137},
year = {2024},
url = {https://doi.org/10.1016/j.dam.2023.09.011},
doi = {10.1016/J.DAM.2023.09.011},
timestamp = {Tue, 26 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/FranklLWY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FranklH24,
author = {Peter Frankl and
Glenn Hurlbert},
title = {On the Holroyd-Talbot conjecture for sparse graphs},
journal = {Discret. Math.},
volume = {347},
number = {1},
pages = {113742},
year = {2024},
url = {https://doi.org/10.1016/j.disc.2023.113742},
doi = {10.1016/J.DISC.2023.113742},
timestamp = {Thu, 09 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FranklH24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FranklSWY24,
author = {Peter Frankl and
Baolong Shang and
Jian Wang and
Jie You},
title = {Families with restricted matching number and multiply covered shadows},
journal = {Discret. Math.},
volume = {347},
number = {3},
pages = {113831},
year = {2024},
url = {https://doi.org/10.1016/j.disc.2023.113831},
doi = {10.1016/J.DISC.2023.113831},
timestamp = {Thu, 25 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FranklSWY24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklK24,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Intersection theorems for (-1,0,1)-vectors},
journal = {Eur. J. Comb.},
volume = {117},
pages = {103830},
year = {2024},
url = {https://doi.org/10.1016/j.ejc.2023.103830},
doi = {10.1016/J.EJC.2023.103830},
timestamp = {Fri, 16 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FranklK24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/FranklW24,
author = {Peter Frankl and
Jian Wang},
title = {Four-vertex traces of finite sets},
journal = {Graphs Comb.},
volume = {40},
number = {1},
pages = {8},
year = {2024},
url = {https://doi.org/10.1007/s00373-023-02738-5},
doi = {10.1007/S00373-023-02738-5},
timestamp = {Tue, 26 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/gc/FranklW24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/AlonF24,
author = {Noga Alon and
Peter Frankl},
title = {Tur{\'{a}}n graphs with bounded matching number},
journal = {J. Comb. Theory, Ser. {B}},
volume = {165},
pages = {223--229},
year = {2024},
url = {https://doi.org/10.1016/j.jctb.2023.12.002},
doi = {10.1016/J.JCTB.2023.12.002},
timestamp = {Fri, 26 Jan 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jctb/AlonF24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FranklK23,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Perfect matchings in down-sets},
journal = {Discret. Math.},
volume = {346},
number = {5},
pages = {113323},
year = {2023},
url = {https://doi.org/10.1016/j.disc.2023.113323},
doi = {10.1016/J.DISC.2023.113323},
timestamp = {Sat, 18 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FranklK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FranklLWY23,
author = {Peter Frankl and
Erica L. L. Liu and
Jian Wang and
Zhe Yang},
title = {Some inequalities concerning cross-intersecting families of integer
sequences},
journal = {Discret. Math.},
volume = {346},
number = {12},
pages = {113574},
year = {2023},
url = {https://doi.org/10.1016/j.disc.2023.113574},
doi = {10.1016/J.DISC.2023.113574},
timestamp = {Tue, 26 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FranklLWY23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklKK23,
author = {Peter Frankl and
Sergei Kiselev and
Andrey Kupavskii},
title = {Best possible bounds on the number of distinct differences in intersecting
families},
journal = {Eur. J. Comb.},
volume = {107},
pages = {103601},
year = {2023},
url = {https://doi.org/10.1016/j.ejc.2022.103601},
doi = {10.1016/J.EJC.2022.103601},
timestamp = {Thu, 13 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/FranklKK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklW23,
author = {Peter Frankl and
Jian Wang},
title = {Intersections and distinct intersections in cross-intersecting families},
journal = {Eur. J. Comb.},
volume = {110},
pages = {103665},
year = {2023},
url = {https://doi.org/10.1016/j.ejc.2022.103665},
doi = {10.1016/J.EJC.2022.103665},
timestamp = {Wed, 06 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/FranklW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklK23,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Uniform intersecting families with large covering number},
journal = {Eur. J. Comb.},
volume = {113},
pages = {103747},
year = {2023},
url = {https://doi.org/10.1016/j.ejc.2023.103747},
doi = {10.1016/J.EJC.2023.103747},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/FranklK23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcta/FranklW23,
author = {Peter Frankl and
Jian Wang},
title = {A product version of the Hilton-Milner theorem},
journal = {J. Comb. Theory, Ser. {A}},
volume = {200},
pages = {105791},
year = {2023},
url = {https://doi.org/10.1016/j.jcta.2023.105791},
doi = {10.1016/J.JCTA.2023.105791},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcta/FranklW23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/AmbrusBFV23,
author = {Gergely Ambrus and
Imre B{\'{a}}r{\'{a}}ny and
Peter Frankl and
D{\'{a}}niel Varga},
title = {Piercing the Chessboard},
journal = {{SIAM} J. Discret. Math.},
volume = {37},
number = {3},
pages = {1457--1471},
year = {2023},
url = {https://doi.org/10.1137/21m146048x},
doi = {10.1137/21M146048X},
timestamp = {Sat, 05 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/AmbrusBFV23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/ShiFQ22,
author = {Chao Shi and
Peter Frankl and
Jianguo Qian},
title = {On Non-Empty Cross-Intersecting Families},
journal = {Comb.},
volume = {42},
number = {Supplement 2},
pages = {1513--1525},
year = {2022},
url = {https://doi.org/10.1007/s00493-021-4839-4},
doi = {10.1007/S00493-021-4839-4},
timestamp = {Tue, 07 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorica/ShiFQ22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/FranklP22,
author = {Peter Frankl and
J{\'{a}}nos Pach},
title = {On Well-Connected Sets of Strings},
journal = {Electron. J. Comb.},
volume = {29},
number = {1},
year = {2022},
url = {https://doi.org/10.37236/10291},
doi = {10.37236/10291},
timestamp = {Tue, 03 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/FranklP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/FranklHK22,
author = {Peter Frankl and
Andreas F. Holmsen and
Andrey Kupavskii},
title = {Intersection Theorems for Triangles},
journal = {Discret. Comput. Geom.},
volume = {68},
number = {3},
pages = {728--737},
year = {2022},
url = {https://doi.org/10.1007/s00454-021-00295-3},
doi = {10.1007/S00454-021-00295-3},
timestamp = {Tue, 20 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dcg/FranklHK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FranklKK22,
author = {Peter Frankl and
Sergei Kiselev and
Andrey Kupavskii},
title = {On the maximum number of distinct intersections in an intersecting
family},
journal = {Discret. Math.},
volume = {345},
number = {4},
pages = {112757},
year = {2022},
url = {https://doi.org/10.1016/j.disc.2021.112757},
doi = {10.1016/J.DISC.2021.112757},
timestamp = {Tue, 15 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FranklKK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FranklW22,
author = {Peter Frankl and
Jian Wang},
title = {On the sum of sizes of overlapping families},
journal = {Discret. Math.},
volume = {345},
number = {11},
pages = {113027},
year = {2022},
url = {https://doi.org/10.1016/j.disc.2022.113027},
doi = {10.1016/J.DISC.2022.113027},
timestamp = {Wed, 06 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/FranklW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Frankl22,
author = {Peter Frankl},
title = {Pseudo sunflowers},
journal = {Eur. J. Comb.},
volume = {104},
pages = {103553},
year = {2022},
url = {https://doi.org/10.1016/j.ejc.2022.103553},
doi = {10.1016/J.EJC.2022.103553},
timestamp = {Tue, 14 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/Frankl22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklLW22,
author = {Peter Frankl and
Erica L. L. Liu and
Jian Wang},
title = {On the maximum number of edges in hypergraphs with fixed matching
and clique number},
journal = {Eur. J. Comb.},
volume = {106},
pages = {103589},
year = {2022},
url = {https://doi.org/10.1016/j.ejc.2022.103589},
doi = {10.1016/J.EJC.2022.103589},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/FranklLW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/FranklK22,
author = {Peter Frankl and
Andrey Kupavskii},
title = {The Erd{\H{o}}s Matching Conjecture and concentration inequalities},
journal = {J. Comb. Theory, Ser. {B}},
volume = {157},
pages = {366--400},
year = {2022},
url = {https://doi.org/10.1016/j.jctb.2022.08.002},
doi = {10.1016/J.JCTB.2022.08.002},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jctb/FranklK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mvl/Frankl22,
author = {Peter Frankl},
title = {A Finite Set Intersection Theorem},
journal = {J. Multiple Valued Log. Soft Comput.},
volume = {39},
number = {1},
pages = {105--110},
year = {2022},
url = {https://www.oldcitypublishing.com/journals/mvlsc-home/mvlsc-issue-contents/mvlsc-volume-39-number-1-2022/mvlsc-39-1-p-105-110/},
timestamp = {Wed, 24 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mvl/Frankl22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/FranklPP22,
author = {Peter Frankl and
J{\'{a}}nos Pach and
D{\"{o}}m{\"{o}}t{\"{o}}r P{\'{a}}lv{\"{o}}lgyi},
title = {Exchange Properties of Finite Set-Systems},
journal = {{SIAM} J. Discret. Math.},
volume = {36},
number = {3},
pages = {2073--2081},
year = {2022},
url = {https://doi.org/10.1137/21m145149x},
doi = {10.1137/21M145149X},
timestamp = {Sat, 11 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/FranklPP22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/FranklGT22,
author = {Peter Frankl and
Svyatoslav Gryaznov and
Navid Talebanfard},
editor = {Mark Braverman},
title = {A Variant of the VC-Dimension with Applications to Depth-3 Circuits},
booktitle = {13th Innovations in Theoretical Computer Science Conference, {ITCS}
2022, January 31 - February 3, 2022, Berkeley, CA, {USA}},
series = {LIPIcs},
volume = {215},
pages = {72:1--72:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2022.72},
doi = {10.4230/LIPICS.ITCS.2022.72},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/FranklGT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2201-03865,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Perfect matchings in down-sets},
journal = {CoRR},
volume = {abs/2201.03865},
year = {2022},
url = {https://arxiv.org/abs/2201.03865},
eprinttype = {arXiv},
eprint = {2201.03865},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2201-03865.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2210-15076,
author = {Noga Alon and
Peter Frankl},
title = {Tur{\'{a}}n graphs with bounded matching number},
journal = {CoRR},
volume = {abs/2210.15076},
year = {2022},
url = {https://doi.org/10.48550/arXiv.2210.15076},
doi = {10.48550/ARXIV.2210.15076},
eprinttype = {arXiv},
eprint = {2210.15076},
timestamp = {Fri, 28 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2210-15076.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/FranklK21,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Almost Intersecting Families},
journal = {Electron. J. Comb.},
volume = {28},
number = {2},
pages = {2},
year = {2021},
url = {https://doi.org/10.37236/9609},
doi = {10.37236/9609},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/FranklK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Frankl21,
author = {Peter Frankl},
title = {On the number of distinct differences in an intersecting family},
journal = {Discret. Math.},
volume = {344},
number = {2},
pages = {112210},
year = {2021},
url = {https://doi.org/10.1016/j.disc.2020.112210},
doi = {10.1016/J.DISC.2020.112210},
timestamp = {Tue, 16 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/Frankl21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FranklW21,
author = {Peter Frankl and
H. W. Willie Wong},
title = {Analogues of Katona's and Milner's theorems for two families},
journal = {Discret. Math.},
volume = {344},
number = {5},
pages = {112327},
year = {2021},
url = {https://doi.org/10.1016/j.disc.2021.112327},
doi = {10.1016/J.DISC.2021.112327},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/FranklW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Frankl21,
author = {Peter Frankl},
title = {On the size of shadow-added intersecting families},
journal = {Eur. J. Comb.},
volume = {92},
pages = {103243},
year = {2021},
url = {https://doi.org/10.1016/j.ejc.2020.103243},
doi = {10.1016/J.EJC.2020.103243},
timestamp = {Thu, 19 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Frankl21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Frankl21a,
author = {Peter Frankl},
title = {Analogues of Milner's Theorem for families without long chains and
of vector spaces},
journal = {Eur. J. Comb.},
volume = {93},
pages = {103279},
year = {2021},
url = {https://doi.org/10.1016/j.ejc.2020.103279},
doi = {10.1016/J.EJC.2020.103279},
timestamp = {Thu, 21 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Frankl21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklK21,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Beyond the Erd{\H{o}}s Matching Conjecture},
journal = {Eur. J. Comb.},
volume = {95},
pages = {103338},
year = {2021},
url = {https://doi.org/10.1016/j.ejc.2021.103338},
doi = {10.1016/J.EJC.2021.103338},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/FranklK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Frankl21b,
author = {Peter Frankl},
title = {Old and new applications of Katona's circle},
journal = {Eur. J. Comb.},
volume = {95},
pages = {103339},
year = {2021},
url = {https://doi.org/10.1016/j.ejc.2021.103339},
doi = {10.1016/J.EJC.2021.103339},
timestamp = {Wed, 27 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/Frankl21b.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcta/FranklHR21,
author = {Peter Frankl and
Hao Huang and
Vojtech R{\"{o}}dl},
title = {On local Tur{\'{a}}n problems},
journal = {J. Comb. Theory, Ser. {A}},
volume = {177},
pages = {105329},
year = {2021},
url = {https://doi.org/10.1016/j.jcta.2020.105329},
doi = {10.1016/J.JCTA.2020.105329},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcta/FranklHR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcta/FranklK21,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Diversity},
journal = {J. Comb. Theory, Ser. {A}},
volume = {182},
pages = {105468},
year = {2021},
url = {https://doi.org/10.1016/j.jcta.2021.105468},
doi = {10.1016/J.JCTA.2021.105468},
timestamp = {Sat, 14 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcta/FranklK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcta/FranklK21a,
author = {Peter Frankl and
Gyula O. H. Katona},
title = {On strengthenings of the intersecting shadow theorem},
journal = {J. Comb. Theory, Ser. {A}},
volume = {184},
pages = {105510},
year = {2021},
url = {https://doi.org/10.1016/j.jcta.2021.105510},
doi = {10.1016/J.JCTA.2021.105510},
timestamp = {Sat, 11 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcta/FranklK21a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tamm/BaranyF21,
author = {Imre B{\'{a}}r{\'{a}}ny and
Peter Frankl},
title = {How (Not) to Cut Your Cheese},
journal = {Am. Math. Mon.},
volume = {128},
number = {6},
pages = {543--552},
year = {2021},
url = {https://doi.org/10.1080/00029890.2021.1901463},
doi = {10.1080/00029890.2021.1901463},
timestamp = {Wed, 16 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tamm/BaranyF21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-05344,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Uniform intersecting families with large covering number},
journal = {CoRR},
volume = {abs/2106.05344},
year = {2021},
url = {https://arxiv.org/abs/2106.05344},
eprinttype = {arXiv},
eprint = {2106.05344},
timestamp = {Wed, 16 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-05344.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2106-05355,
author = {Peter Frankl and
Sergei Kiselev and
Andrey Kupavskii},
title = {Best possible bounds on the number of distinct differences in intersecting
families},
journal = {CoRR},
volume = {abs/2106.05355},
year = {2021},
url = {https://arxiv.org/abs/2106.05355},
eprinttype = {arXiv},
eprint = {2106.05355},
timestamp = {Wed, 16 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2106-05355.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2108-00479,
author = {Peter Frankl and
Sergei Kiselev and
Andrey Kupavskii},
title = {On the maximum number of distinct intersections in an intersecting
family},
journal = {CoRR},
volume = {abs/2108.00479},
year = {2021},
url = {https://arxiv.org/abs/2108.00479},
eprinttype = {arXiv},
eprint = {2108.00479},
timestamp = {Thu, 05 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2108-00479.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2111-09671,
author = {Peter Frankl and
Svyatoslav Gryaznov and
Navid Talebanfard},
title = {A Variant of the VC-dimension with Applications to Depth-3 Circuits},
journal = {CoRR},
volume = {abs/2111.09671},
year = {2021},
url = {https://arxiv.org/abs/2111.09671},
eprinttype = {arXiv},
eprint = {2111.09671},
timestamp = {Mon, 22 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2111-09671.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/Frankl20,
author = {Peter Frankl},
title = {Erd{\H{o}}s-Ko-Rado Theorem for a Restricted Universe},
journal = {Electron. J. Comb.},
volume = {27},
number = {2},
pages = {2},
year = {2020},
url = {https://doi.org/10.37236/8682},
doi = {10.37236/8682},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/Frankl20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Frankl20,
author = {Peter Frankl},
title = {Families of finite sets satisfying intersection restrictions},
journal = {Discret. Appl. Math.},
volume = {276},
pages = {44--49},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2019.06.019},
doi = {10.1016/J.DAM.2019.06.019},
timestamp = {Wed, 22 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/Frankl20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Frankl20,
author = {Peter Frankl},
title = {Mixed matchings in graphs},
journal = {Discret. Math.},
volume = {343},
number = {2},
pages = {111660},
year = {2020},
url = {https://doi.org/10.1016/j.disc.2019.111660},
doi = {10.1016/J.DISC.2019.111660},
timestamp = {Mon, 20 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/Frankl20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Frankl20,
author = {Peter Frankl},
title = {On non-trivial families without a perfect matching},
journal = {Eur. J. Comb.},
volume = {84},
year = {2020},
url = {https://doi.org/10.1016/j.ejc.2019.103044},
doi = {10.1016/J.EJC.2019.103044},
timestamp = {Wed, 11 Dec 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Frankl20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklK20,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Sharp results concerning disjoint cross-intersecting families},
journal = {Eur. J. Comb.},
volume = {86},
pages = {103089},
year = {2020},
url = {https://doi.org/10.1016/j.ejc.2020.103089},
doi = {10.1016/J.EJC.2020.103089},
timestamp = {Mon, 04 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/FranklK20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Frankl20a,
author = {Peter Frankl},
title = {An improved universal bound for t-intersecting families},
journal = {Eur. J. Comb.},
volume = {87},
pages = {103134},
year = {2020},
url = {https://doi.org/10.1016/j.ejc.2020.103134},
doi = {10.1016/J.EJC.2020.103134},
timestamp = {Tue, 19 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/Frankl20a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Frankl20,
author = {Peter Frankl},
title = {Extremal set theory for the binomial norm},
journal = {J. Comb. Theory, Ser. {A}},
volume = {170},
year = {2020},
url = {https://doi.org/10.1016/j.jcta.2019.105144},
doi = {10.1016/J.JCTA.2019.105144},
timestamp = {Fri, 18 Oct 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Frankl20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jctb/Frankl20,
author = {Peter Frankl},
title = {Maximum degree and diversity in intersecting hypergraphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {144},
pages = {81--94},
year = {2020},
url = {https://doi.org/10.1016/j.jctb.2020.01.001},
doi = {10.1016/J.JCTB.2020.01.001},
timestamp = {Mon, 06 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jctb/Frankl20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-08714,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Almost intersecting families},
journal = {CoRR},
volume = {abs/2004.08714},
year = {2020},
url = {https://arxiv.org/abs/2004.08714},
eprinttype = {arXiv},
eprint = {2004.08714},
timestamp = {Thu, 23 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-08714.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-08718,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Maximal degrees in subgraphs of Kneser graphs},
journal = {CoRR},
volume = {abs/2004.08718},
year = {2020},
url = {https://arxiv.org/abs/2004.08718},
eprinttype = {arXiv},
eprint = {2004.08718},
timestamp = {Thu, 23 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-08718.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2004-08721,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Intersection theorems for (-1, 0, 1)-vectors},
journal = {CoRR},
volume = {abs/2004.08721},
year = {2020},
url = {https://arxiv.org/abs/2004.08721},
eprinttype = {arXiv},
eprint = {2004.08721},
timestamp = {Thu, 23 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2004-08721.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-14560,
author = {Peter Frankl and
Andreas F. Holmsen and
Andrey Kupavskii},
title = {Intersection theorems for triangles},
journal = {CoRR},
volume = {abs/2009.14560},
year = {2020},
url = {https://arxiv.org/abs/2009.14560},
eprinttype = {arXiv},
eprint = {2009.14560},
timestamp = {Wed, 07 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-14560.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FranklK19,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Incompatible Intersection Properties},
journal = {Comb.},
volume = {39},
number = {6},
pages = {1255--1266},
year = {2019},
url = {https://doi.org/10.1007/s00493-019-4064-6},
doi = {10.1007/S00493-019-4064-6},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FranklK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Frankl19,
author = {Peter Frankl},
title = {A near-exponential improvement of a bound of Erd{\H{o}}s and Lov{\'{a}}sz
on maximal intersecting families},
journal = {Comb. Probab. Comput.},
volume = {28},
number = {5},
pages = {733--739},
year = {2019},
url = {https://doi.org/10.1017/S0963548319000142},
doi = {10.1017/S0963548319000142},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/Frankl19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklK19,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Families of sets with no matchings of sizes 3 and 4},
journal = {Eur. J. Comb.},
volume = {75},
pages = {123--135},
year = {2019},
url = {https://doi.org/10.1016/j.ejc.2018.08.005},
doi = {10.1016/J.EJC.2018.08.005},
timestamp = {Fri, 02 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FranklK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Frankl19,
author = {Peter Frankl},
title = {Some exact results for multiply intersecting families},
journal = {J. Comb. Theory, Ser. {B}},
volume = {136},
pages = {222--248},
year = {2019},
url = {https://doi.org/10.1016/j.jctb.2018.11.001},
doi = {10.1016/J.JCTB.2018.11.001},
timestamp = {Mon, 15 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Frankl19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklK19,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Two problems on matchings in set families - In the footsteps of Erd{\H{o}}s
and Kleitman},
journal = {J. Comb. Theory, Ser. {B}},
volume = {138},
pages = {286--313},
year = {2019},
url = {https://doi.org/10.1016/j.jctb.2019.02.004},
doi = {10.1016/J.JCTB.2019.02.004},
timestamp = {Thu, 08 Aug 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/FranklK19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-03816,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Simple juntas for shifted families},
journal = {CoRR},
volume = {abs/1901.03816},
year = {2019},
url = {http://arxiv.org/abs/1901.03816},
eprinttype = {arXiv},
eprint = {1901.03816},
timestamp = {Sun, 03 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-03816.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-09278,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Beyond the Erd{\H{o}}s Matching Conjecture},
journal = {CoRR},
volume = {abs/1901.09278},
year = {2019},
url = {http://arxiv.org/abs/1901.09278},
eprinttype = {arXiv},
eprint = {1901.09278},
timestamp = {Sun, 03 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-09278.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1905-08123,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Sharp results concerning disjoint cross-intersecting families},
journal = {CoRR},
volume = {abs/1905.08123},
year = {2019},
url = {http://arxiv.org/abs/1905.08123},
eprinttype = {arXiv},
eprint = {1905.08123},
timestamp = {Wed, 29 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1905-08123.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Frankl18,
author = {Peter Frankl},
title = {Resilient Hypergraphs with Fixed Matching Number},
journal = {Comb.},
volume = {38},
number = {5},
pages = {1079--1094},
year = {2018},
url = {https://doi.org/10.1007/s00493-016-3579-3},
doi = {10.1007/S00493-016-3579-3},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Frankl18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/FranklK18,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Counting Intersecting and Pairs of Cross-Intersecting Families},
journal = {Comb. Probab. Comput.},
volume = {27},
number = {1},
pages = {60--68},
year = {2018},
url = {https://doi.org/10.1017/S0963548317000529},
doi = {10.1017/S0963548317000529},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/FranklK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Frankl18,
author = {Peter Frankl},
title = {Partition-free families of sets},
journal = {Discret. Math.},
volume = {341},
number = {7},
pages = {2080--2082},
year = {2018},
url = {https://doi.org/10.1016/j.disc.2018.04.009},
doi = {10.1016/J.DISC.2018.04.009},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Frankl18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Frankl18,
author = {Peter Frankl},
title = {Best possible bounds concerning the set-wise union of families},
journal = {Eur. J. Comb.},
volume = {69},
pages = {1--6},
year = {2018},
url = {https://doi.org/10.1016/j.ejc.2017.08.006},
doi = {10.1016/J.EJC.2017.08.006},
timestamp = {Tue, 02 Jan 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Frankl18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Frankl18,
author = {Peter Frankl},
title = {On families of sets without \emph{k} pairwise disjoint members},
journal = {J. Comb. Theory, Ser. {B}},
volume = {130},
pages = {92--97},
year = {2018},
url = {https://doi.org/10.1016/j.jctb.2017.10.002},
doi = {10.1016/J.JCTB.2017.10.002},
timestamp = {Wed, 02 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Frankl18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklK18,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Erd{\H{o}}s-Ko-Rado theorem for \{0, {\(\pm\)}1\}-vectors},
journal = {J. Comb. Theory, Ser. {A}},
volume = {155},
pages = {157--179},
year = {2018},
url = {https://doi.org/10.1016/j.jcta.2017.11.003},
doi = {10.1016/J.JCTA.2017.11.003},
timestamp = {Wed, 27 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/FranklK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklHHZ18,
author = {Peter Frankl and
Jie Han and
Hao Huang and
Yi Zhao},
title = {A degree version of the Hilton-Milner theorem},
journal = {J. Comb. Theory, Ser. {A}},
volume = {155},
pages = {493--502},
year = {2018},
url = {https://doi.org/10.1016/j.jcta.2017.11.019},
doi = {10.1016/J.JCTA.2017.11.019},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/FranklHHZ18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklK18a,
author = {Peter Frankl and
Andrey Kupavskii},
title = {New inequalities for families without \emph{k} pairwise disjoint members},
journal = {J. Comb. Theory, Ser. {A}},
volume = {157},
pages = {427--434},
year = {2018},
url = {https://doi.org/10.1016/j.jcta.2018.01.007},
doi = {10.1016/J.JCTA.2018.01.007},
timestamp = {Wed, 02 May 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/FranklK18a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jocg/PachF18,
author = {J{\'{a}}nos Pach and
Peter Frankl},
title = {A stability theorem on cube tessellations},
journal = {J. Comput. Geom.},
volume = {9},
number = {1},
pages = {387--390},
year = {2018},
url = {https://doi.org/10.20382/jocg.v9i1a13},
doi = {10.20382/JOCG.V9I1A13},
timestamp = {Thu, 10 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jocg/PachF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ol/Frankl18,
author = {Peter Frankl},
title = {An exact result for (0, {\(\pm\)} 1)-vectors},
journal = {Optim. Lett.},
volume = {12},
number = {5},
pages = {1011--1017},
year = {2018},
url = {https://doi.org/10.1007/s11590-018-1245-y},
doi = {10.1007/S11590-018-1245-Y},
timestamp = {Fri, 03 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ol/Frankl18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-03581,
author = {Peter Frankl and
Andrey Kupavskii},
title = {New inequalities for families without k pairwise disjoint members},
journal = {CoRR},
volume = {abs/1804.03581},
year = {2018},
url = {http://arxiv.org/abs/1804.03581},
eprinttype = {arXiv},
eprint = {1804.03581},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1804-03581.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-01229,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Incompatible intersection properties},
journal = {CoRR},
volume = {abs/1808.01229},
year = {2018},
url = {http://arxiv.org/abs/1808.01229},
eprinttype = {arXiv},
eprint = {1808.01229},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-01229.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-01111,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Diversity},
journal = {CoRR},
volume = {abs/1811.01111},
year = {2018},
url = {http://arxiv.org/abs/1811.01111},
eprinttype = {arXiv},
eprint = {1811.01111},
timestamp = {Mon, 26 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-01111.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Frankl17,
author = {Peter Frankl},
title = {A Stability Result for Families with Fixed Diameter},
journal = {Comb. Probab. Comput.},
volume = {26},
number = {4},
pages = {506--516},
year = {2017},
url = {https://doi.org/10.1017/S0963548316000456},
doi = {10.1017/S0963548316000456},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Frankl17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/FranklK17,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Uniform s-Cross-Intersecting Families},
journal = {Comb. Probab. Comput.},
volume = {26},
number = {4},
pages = {517--524},
year = {2017},
url = {https://doi.org/10.1017/S0963548317000062},
doi = {10.1017/S0963548317000062},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/FranklK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Frankl17,
author = {Peter Frankl},
title = {On the maximum number of edges in a hypergraph with given matching
number},
journal = {Discret. Appl. Math.},
volume = {216},
pages = {562--581},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2016.08.003},
doi = {10.1016/J.DAM.2016.08.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Frankl17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Frankl17,
author = {Peter Frankl},
title = {A structural result for 3-graphs},
journal = {Discret. Math.},
volume = {340},
number = {5},
pages = {1039--1041},
year = {2017},
url = {https://doi.org/10.1016/j.disc.2016.09.036},
doi = {10.1016/J.DISC.2016.09.036},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Frankl17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FranklT17,
author = {Peter Frankl and
Norihide Tokushige},
title = {A note on Huang-Zhao theorem on intersecting families with large minimum
degree},
journal = {Discret. Math.},
volume = {340},
number = {5},
pages = {1098--1103},
year = {2017},
url = {https://doi.org/10.1016/j.disc.2016.10.011},
doi = {10.1016/J.DISC.2016.10.011},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FranklT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklK17,
author = {Peter Frankl and
Andrey Kupavskii},
title = {A size-sensitive inequality for cross-intersecting families},
journal = {Eur. J. Comb.},
volume = {62},
pages = {263--271},
year = {2017},
url = {https://doi.org/10.1016/j.ejc.2017.01.004},
doi = {10.1016/J.EJC.2017.01.004},
timestamp = {Thu, 28 Dec 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FranklK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FranklK17,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Families with no matchings of size s},
journal = {Electron. Notes Discret. Math.},
volume = {61},
pages = {483--489},
year = {2017},
url = {https://doi.org/10.1016/j.endm.2017.06.077},
doi = {10.1016/J.ENDM.2017.06.077},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FranklK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Frankl17,
author = {Peter Frankl},
title = {A stability result for the Katona theorem},
journal = {J. Comb. Theory, Ser. {B}},
volume = {122},
pages = {869--876},
year = {2017},
url = {https://doi.org/10.1016/j.jctb.2016.10.003},
doi = {10.1016/J.JCTB.2016.10.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Frankl17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jlms/FranklK17,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Families with no s pairwise disjoint sets},
journal = {J. Lond. Math. Soc.},
volume = {95},
number = {3},
pages = {875--894},
year = {2017},
url = {https://doi.org/10.1112/jlms.12041},
doi = {10.1112/JLMS.12041},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jlms/FranklK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tamm/FranklMP17,
author = {Peter Frankl and
Amram Meir and
J{\'{a}}nos Pach},
title = {Decomposition of a Cube into Nearly Equal Smaller Cubes},
journal = {Am. Math. Mon.},
volume = {124},
number = {10},
pages = {895--904},
year = {2017},
url = {https://www.tandfonline.com/doi/abs/10.4169/amer.math.monthly.124.10.895},
doi = {10.4169/AMER.MATH.MONTHLY.124.10.895},
timestamp = {Thu, 09 Dec 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tamm/FranklMP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1701-04107,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Families of sets with no matchings of sizes 3 and 4},
journal = {CoRR},
volume = {abs/1701.04107},
year = {2017},
url = {http://arxiv.org/abs/1701.04107},
eprinttype = {arXiv},
eprint = {1701.04107},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1701-04107.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1701-04110,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Counting intersecting and pairs of cross-intersecting families},
journal = {CoRR},
volume = {abs/1701.04110},
year = {2017},
url = {http://arxiv.org/abs/1701.04110},
eprinttype = {arXiv},
eprint = {1701.04110},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1701-04110.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1705-07216,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Families of vectors without antipodal pairs},
journal = {CoRR},
volume = {abs/1705.07216},
year = {2017},
url = {http://arxiv.org/abs/1705.07216},
eprinttype = {arXiv},
eprint = {1705.07216},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1705-07216.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1706-00215,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Partition-free families of sets},
journal = {CoRR},
volume = {abs/1706.00215},
year = {2017},
url = {http://arxiv.org/abs/1706.00215},
eprinttype = {arXiv},
eprint = {1706.00215},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1706-00215.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklKR16,
author = {Peter Frankl and
Yoshiharu Kohayakawa and
Vojtech R{\"{o}}dl},
title = {A note on supersaturated set systems},
journal = {Eur. J. Comb.},
volume = {51},
pages = {190--199},
year = {2016},
url = {https://doi.org/10.1016/j.ejc.2015.03.028},
doi = {10.1016/J.EJC.2015.03.028},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FranklKR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklT16,
author = {Peter Frankl and
Norihide Tokushige},
title = {Uniform eventown problems},
journal = {Eur. J. Comb.},
volume = {51},
pages = {280--286},
year = {2016},
url = {https://doi.org/10.1016/j.ejc.2015.06.001},
doi = {10.1016/J.EJC.2015.06.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FranklT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Frankl16,
author = {Peter Frankl},
title = {Linear independence, a unifying approach to shadow theorems},
journal = {Eur. J. Comb.},
volume = {57},
pages = {36--39},
year = {2016},
url = {https://doi.org/10.1016/j.ejc.2016.04.001},
doi = {10.1016/J.EJC.2016.04.001},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Frankl16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklST16,
author = {Peter Frankl and
Masashi Shinohara and
Norihide Tokushige},
title = {Multiply union families in N\({}^{\mbox{n}}\)},
journal = {Eur. J. Comb.},
volume = {58},
pages = {66--74},
year = {2016},
url = {https://doi.org/10.1016/j.ejc.2016.05.007},
doi = {10.1016/J.EJC.2016.05.007},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FranklST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklT16,
author = {Peter Frankl and
Norihide Tokushige},
title = {Intersection problems in the q-ary cube},
journal = {J. Comb. Theory, Ser. {A}},
volume = {141},
pages = {90--126},
year = {2016},
url = {https://doi.org/10.1016/j.jcta.2016.02.006},
doi = {10.1016/J.JCTA.2016.02.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklT16a,
author = {Peter Frankl and
Norihide Tokushige},
title = {Invitation to intersection problems for finite sets},
journal = {J. Comb. Theory, Ser. {A}},
volume = {144},
pages = {157--211},
year = {2016},
url = {https://doi.org/10.1016/j.jcta.2016.06.017},
doi = {10.1016/J.JCTA.2016.06.017},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklT16a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1603-00936,
author = {Peter Frankl and
Andrey Kupavskii},
title = {A size-sensitive inequality for cross-intersecting families},
journal = {CoRR},
volume = {abs/1603.00936},
year = {2016},
url = {http://arxiv.org/abs/1603.00936},
eprinttype = {arXiv},
eprint = {1603.00936},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1603-00936.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1603-00938,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Intersection theorems for \{0, {\(\pm\)}1\}-vectors and s-cross-intersecting
families},
journal = {CoRR},
volume = {abs/1603.00938},
year = {2016},
url = {http://arxiv.org/abs/1603.00938},
eprinttype = {arXiv},
eprint = {1603.00938},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1603-00938.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1607-06122,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Families with no s pairwise disjoint sets},
journal = {CoRR},
volume = {abs/1607.06122},
year = {2016},
url = {http://arxiv.org/abs/1607.06122},
eprinttype = {arXiv},
eprint = {1607.06122},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1607-06122.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1607-06126,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Two problems of P. Erd{\H{o}}s on matchings in set families},
journal = {CoRR},
volume = {abs/1607.06126},
year = {2016},
url = {http://arxiv.org/abs/1607.06126},
eprinttype = {arXiv},
eprint = {1607.06126},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1607-06126.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1611-07258,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Uniform s-cross-intersecting families},
journal = {CoRR},
volume = {abs/1611.07258},
year = {2016},
url = {http://arxiv.org/abs/1611.07258},
eprinttype = {arXiv},
eprint = {1611.07258},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1611-07258.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1510-03912,
author = {Peter Frankl and
Andrey Kupavskii},
title = {Erd{\H{o}}s-Ko-Rado theorem for \{0, {\(\pm\)}: 1\}-vectors},
journal = {CoRR},
volume = {abs/1510.03912},
year = {2015},
url = {http://arxiv.org/abs/1510.03912},
eprinttype = {arXiv},
eprint = {1510.03912},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1510-03912.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklLST14,
author = {Peter Frankl and
Sangjune Lee and
Mark H. Siggers and
Norihide Tokushige},
title = {An Erd{\H{o}}s-Ko-Rado theorem for cross t-intersecting families},
journal = {J. Comb. Theory, Ser. {A}},
volume = {128},
pages = {207--249},
year = {2014},
url = {https://doi.org/10.1016/j.jcta.2014.08.006},
doi = {10.1016/J.JCTA.2014.08.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklLST14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DudekFR13,
author = {Andrzej Dudek and
Peter Frankl and
Vojtech R{\"{o}}dl},
title = {Some recent results on Ramsey-type numbers},
journal = {Discret. Appl. Math.},
volume = {161},
number = {9},
pages = {1197--1202},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2010.09.005},
doi = {10.1016/J.DAM.2010.09.005},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DudekFR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/DuffusFR13,
author = {Dwight Duffus and
Peter Frankl and
Vojtech R{\"{o}}dl},
title = {Maximal independent sets in the covering graph of the cube},
journal = {Discret. Appl. Math.},
volume = {161},
number = {9},
pages = {1203--1208},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2010.09.003},
doi = {10.1016/J.DAM.2010.09.003},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/DuffusFR13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklKKT13,
author = {Peter Frankl and
Mitsuo Kato and
Gyula O. H. Katona and
Norihide Tokushige},
title = {Two-colorings with many monochromatic cliques in both colors},
journal = {J. Comb. Theory, Ser. {B}},
volume = {103},
number = {4},
pages = {415--427},
year = {2013},
url = {https://doi.org/10.1016/j.jctb.2013.04.002},
doi = {10.1016/J.JCTB.2013.04.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklKKT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Frankl13a,
author = {Peter Frankl},
title = {On the number of nonnegative sums},
journal = {J. Comb. Theory, Ser. {B}},
volume = {103},
number = {5},
pages = {647--649},
year = {2013},
url = {https://doi.org/10.1016/j.jctb.2013.07.002},
doi = {10.1016/J.JCTB.2013.07.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Frankl13a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Frankl13,
author = {Peter Frankl},
title = {Improved bounds for Erd{\H{o}}s' Matching Conjecture},
journal = {J. Comb. Theory, Ser. {A}},
volume = {120},
number = {5},
pages = {1068--1072},
year = {2013},
url = {https://doi.org/10.1016/j.jcta.2013.01.008},
doi = {10.1016/J.JCTA.2013.01.008},
timestamp = {Sun, 22 Oct 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Frankl13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklT13,
author = {Peter Frankl and
Norihide Tokushige},
title = {The Katona theorem for vector spaces},
journal = {J. Comb. Theory, Ser. {A}},
volume = {120},
number = {7},
pages = {1578--1589},
year = {2013},
url = {https://doi.org/10.1016/j.jcta.2013.05.007},
doi = {10.1016/J.JCTA.2013.05.007},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/FranklLM12,
author = {Peter Frankl and
Tomasz Luczak and
Katarzyna Mieczkowska},
title = {On Matchings in Hypergraphs},
journal = {Electron. J. Comb.},
volume = {19},
number = {2},
pages = {42},
year = {2012},
url = {https://doi.org/10.37236/2176},
doi = {10.37236/2176},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/combinatorics/FranklLM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/FranklRR12,
author = {Peter Frankl and
Vojtech R{\"{o}}dl and
Andrzej Rucinski},
title = {On the Maximum Number of Edges in a Triple System Not Containing a
Disjoint Family of a Given Size},
journal = {Comb. Probab. Comput.},
volume = {21},
number = {1-2},
pages = {141--148},
year = {2012},
url = {https://doi.org/10.1017/S0963548311000496},
doi = {10.1017/S0963548311000496},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/FranklRR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/AlonFHRRS12,
author = {Noga Alon and
Peter Frankl and
Hao Huang and
Vojtech R{\"{o}}dl and
Andrzej Rucinski and
Benny Sudakov},
title = {Large matchings in uniform hypergraphs and the conjectures of Erd{\H{o}}s
and Samuels},
journal = {J. Comb. Theory, Ser. {A}},
volume = {119},
number = {6},
pages = {1200--1215},
year = {2012},
url = {https://doi.org/10.1016/j.jcta.2012.02.004},
doi = {10.1016/J.JCTA.2012.02.004},
timestamp = {Fri, 02 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/AlonFHRRS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklF12,
author = {Peter Frankl and
Zolt{\'{a}}n F{\"{u}}redi},
title = {A new short proof of the {EKR} theorem},
journal = {J. Comb. Theory, Ser. {A}},
volume = {119},
number = {6},
pages = {1388--1390},
year = {2012},
url = {https://doi.org/10.1016/j.jcta.2012.03.012},
doi = {10.1016/J.JCTA.2012.03.012},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklF12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/FranklT11,
author = {Peter Frankl and
Norihide Tokushige},
title = {On \emph{r}-Cross Intersecting Families of Sets},
journal = {Comb. Probab. Comput.},
volume = {20},
number = {5},
pages = {749--752},
year = {2011},
url = {https://doi.org/10.1017/S0963548311000289},
doi = {10.1017/S0963548311000289},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/FranklT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/DuffusFR11,
author = {Dwight Duffus and
Peter Frankl and
Vojtech R{\"{o}}dl},
title = {Maximal independent sets in bipartite graphs obtained from Boolean
lattices},
journal = {Eur. J. Comb.},
volume = {32},
number = {1},
pages = {1--9},
year = {2011},
url = {https://doi.org/10.1016/j.ejc.2010.08.004},
doi = {10.1016/J.EJC.2010.08.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/DuffusFR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BlokhuisBCFMPS10,
author = {Aart Blokhuis and
Andries E. Brouwer and
Ameera Chowdhury and
Peter Frankl and
T. Mussche and
Bal{\'{a}}zs Patk{\'{o}}s and
Tam{\'{a}}s Sz{\"{o}}nyi},
title = {A Hilton-Milner Theorem for Vector Spaces},
journal = {Electron. J. Comb.},
volume = {17},
number = {1},
year = {2010},
url = {https://doi.org/10.37236/343},
doi = {10.37236/343},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BlokhuisBCFMPS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DudekFR09,
author = {Andrzej Dudek and
Peter Frankl and
Vojtech R{\"{o}}dl},
title = {A Note on Universal and Canonically Coloured Sequences},
journal = {Comb. Probab. Comput.},
volume = {18},
number = {5},
pages = {683--689},
year = {2009},
url = {https://doi.org/10.1017/S0963548309009961},
doi = {10.1017/S0963548309009961},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DudekFR09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FranklK08,
author = {Peter Frankl and
Gyula Y. Katona},
title = {Extremal k-edge-hamiltonian hypergraphs},
journal = {Discret. Math.},
volume = {308},
number = {8},
pages = {1415--1424},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.07.074},
doi = {10.1016/J.DISC.2007.07.074},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FranklK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklPRT07,
author = {Peter Frankl and
Yuejian Peng and
Vojtech R{\"{o}}dl and
John M. Talbot},
title = {A note on the jumping constant conjecture of Erd{\"{o}}s},
journal = {J. Comb. Theory, Ser. {B}},
volume = {97},
number = {2},
pages = {204--216},
year = {2007},
url = {https://doi.org/10.1016/j.jctb.2006.05.004},
doi = {10.1016/J.JCTB.2006.05.004},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklPRT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FranklT06,
author = {Peter Frankl and
Norihide Tokushige},
title = {Weighted Non-Trivial Multiply Intersecting Families},
journal = {Comb.},
volume = {26},
number = {1},
pages = {37--46},
year = {2006},
url = {https://doi.org/10.1007/s00493-006-0003-4},
doi = {10.1007/S00493-006-0003-4},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FranklT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/FranklT06,
author = {Peter Frankl and
Norihide Tokushige},
title = {The Maximum Size of 3-Wise Intersecting and 3-Wise Union Families},
journal = {Graphs Comb.},
volume = {22},
number = {2},
pages = {225--231},
year = {2006},
url = {https://doi.org/10.1007/s00373-006-0655-2},
doi = {10.1007/S00373-006-0655-2},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/FranklT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklT05,
author = {Peter Frankl and
Norihide Tokushige},
title = {Random walks and multiply intersecting families},
journal = {J. Comb. Theory, Ser. {A}},
volume = {109},
number = {1},
pages = {121--134},
year = {2005},
url = {https://doi.org/10.1016/j.jcta.2004.08.001},
doi = {10.1016/J.JCTA.2004.08.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FranklT03,
author = {Peter Frankl and
Norihide Tokushige},
title = {The game of \emph{n}-times nim},
journal = {Discret. Math.},
volume = {260},
number = {1-3},
pages = {205--209},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00667-2},
doi = {10.1016/S0012-365X(02)00667-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FranklT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklT02,
author = {Peter Frankl and
Norihide Tokushige},
title = {Weighted 3-Wise 2-Intersecting Families},
journal = {J. Comb. Theory, Ser. {A}},
volume = {100},
number = {1},
pages = {94--115},
year = {2002},
url = {https://doi.org/10.1006/jcta.2002.3282},
doi = {10.1006/JCTA.2002.3282},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FranklR02,
author = {Peter Frankl and
Vojtech R{\"{o}}dl},
title = {Extremal problems on set systems},
journal = {Random Struct. Algorithms},
volume = {20},
number = {2},
pages = {131--164},
year = {2002},
url = {https://doi.org/10.1002/rsa.10017},
doi = {10.1002/RSA.10017},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FranklR02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FranklK01,
author = {Peter Frankl and
Gyula Y. Katona},
title = {Extremal k-edge-hamiltonian Hypergraphs},
journal = {Electron. Notes Discret. Math.},
volume = {10},
pages = {109--112},
year = {2001},
url = {https://doi.org/10.1016/S1571-0653(04)00372-5},
doi = {10.1016/S1571-0653(04)00372-5},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FranklK01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BabaiFKS01,
author = {L{\'{a}}szl{\'{o}} Babai and
Peter Frankl and
Samuel Kutin and
Daniel Stefankovic},
title = {Set Systems with Restricted Intersections modulo Prime Powers},
journal = {J. Comb. Theory, Ser. {A}},
volume = {95},
number = {1},
pages = {39--73},
year = {2001},
url = {https://doi.org/10.1006/jcta.2000.3149},
doi = {10.1006/JCTA.2000.3149},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/BabaiFKS01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/FranklK00,
author = {Peter Frankl and
Gyula Y. Katona},
title = {Extremal k-edge-hamiltonian Hypergraphs},
journal = {Electron. Notes Discret. Math.},
volume = {5},
pages = {130--133},
year = {2000},
url = {https://doi.org/10.1016/S1571-0653(05)80144-1},
doi = {10.1016/S1571-0653(05)80144-1},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/FranklK00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FranklT99,
author = {Peter Frankl and
Norihide Tokushige},
title = {The Erdos-Ko-Rado Theorem for Integer Sequences},
journal = {Comb.},
volume = {19},
number = {1},
pages = {55--63},
year = {1999},
url = {https://doi.org/10.1007/s004930050045},
doi = {10.1007/S004930050045},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FranklT99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/FranklOT98,
author = {Peter Frankl and
Katsuhiro Ota and
Norihide Tokushige},
title = {Uniform Intersecting Families with Covering Number Restrictions},
journal = {Comb. Probab. Comput.},
volume = {7},
number = {1},
pages = {47--56},
year = {1998},
url = {http://journals.cambridge.org/action/displayAbstract?aid=46579},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/FranklOT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/FranklT98,
author = {Peter Frankl and
Norihide Tokushige},
title = {Some Inequalities Concerning Cross-Intersecting Families},
journal = {Comb. Probab. Comput.},
volume = {7},
number = {3},
pages = {247--260},
year = {1998},
url = {http://journals.cambridge.org/action/displayAbstract?aid=46645},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/FranklT98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Frankl96,
author = {Peter Frankl},
title = {An Erdos-Ko-Rado Theorem for Direct Products},
journal = {Eur. J. Comb.},
volume = {17},
number = {8},
pages = {727--730},
year = {1996},
url = {https://doi.org/10.1006/eujc.1996.0063},
doi = {10.1006/EUJC.1996.0063},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Frankl96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklOT96a,
author = {Peter Frankl and
Katsuhiro Ota and
Norihide Tokushige},
title = {Covers in Uniform Intersecting Families and a Counterexample to a
Conjecture of Lov{\'{a}}sz},
journal = {J. Comb. Theory, Ser. {A}},
volume = {74},
number = {1},
pages = {33--42},
year = {1996},
url = {https://doi.org/10.1006/jcta.1996.0035},
doi = {10.1006/JCTA.1996.0035},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklOT96a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklOT96,
author = {Peter Frankl and
Katsuhiro Ota and
Norihide Tokushige},
title = {Exponents of Uniform L-Systems},
journal = {J. Comb. Theory, Ser. {A}},
volume = {75},
number = {1},
pages = {23--43},
year = {1996},
url = {https://doi.org/10.1006/jcta.1996.0061},
doi = {10.1006/JCTA.1996.0061},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklOT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FranklMN95,
author = {Peter Frankl and
Hiroshi Maehara and
Junichiro Nakashima},
title = {On the section of a convex polyhedron},
journal = {Discret. Math.},
volume = {140},
number = {1-3},
pages = {265--267},
year = {1995},
url = {https://doi.org/10.1016/0012-365X(93)E0172-Z},
doi = {10.1016/0012-365X(93)E0172-Z},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FranklMN95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklMRT95,
author = {Peter Frankl and
Makoto Matsumoto and
Imre Z. Ruzsa and
Norihide Tokushige},
title = {Minimum Shadows in Uniform Hypergraphs and a Generalization of the
Takagi Function},
journal = {J. Comb. Theory, Ser. {A}},
volume = {69},
number = {1},
pages = {125--148},
year = {1995},
timestamp = {Mon, 12 Jul 2004 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/FranklMRT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklOT95,
author = {Peter Frankl and
Katsuhiro Ota and
Norihide Tokushige},
title = {Uniform Intersecting Families with Covering Number Four},
journal = {J. Comb. Theory, Ser. {A}},
volume = {71},
number = {1},
pages = {127--145},
year = {1995},
timestamp = {Mon, 05 Jul 2004 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/FranklOT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FranklW94,
author = {Peter Frankl and
M. Watanabe},
title = {Density Results for Uniform Families},
journal = {Comb.},
volume = {14},
number = {1},
pages = {115--119},
year = {1994},
url = {https://doi.org/10.1007/BF01305954},
doi = {10.1007/BF01305954},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FranklW94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/WatanabeF94,
author = {M. Watanabe and
Peter Frankl},
title = {Some best possible bounds concerning the traces of finite sets},
journal = {Graphs Comb.},
volume = {10},
number = {2-4},
pages = {283--292},
year = {1994},
url = {https://doi.org/10.1007/BF02986678},
doi = {10.1007/BF02986678},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/WatanabeF94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FranklT93,
author = {Peter Frankl and
Norihide Tokushige},
title = {Weight functions on the kneser graph and the solution of an intersection
problem of Sali},
journal = {Comb.},
volume = {13},
number = {4},
pages = {413--420},
year = {1993},
url = {https://doi.org/10.1007/BF01303513},
doi = {10.1007/BF01303513},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FranklT93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BaranyFM93,
author = {Imre B{\'{a}}r{\'{a}}ny and
Peter Frankl and
Hiroshi Maehara},
title = {Reflecting a triangle in the plane},
journal = {Graphs Comb.},
volume = {9},
number = {2-4},
pages = {97--104},
year = {1993},
url = {https://doi.org/10.1007/BF02988297},
doi = {10.1007/BF02988297},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BaranyFM93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/ErdosFKSS92,
author = {P{\'{e}}ter L. Erd{\"{o}}s and
Peter Frankl and
Daniel J. Kleitman and
Michael E. Saks and
L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely},
title = {Sharpening the {LYM} inequality},
journal = {Comb.},
volume = {12},
number = {3},
pages = {287--293},
year = {1992},
url = {https://doi.org/10.1007/BF01285817},
doi = {10.1007/BF01285817},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/ErdosFKSS92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Frankl92,
author = {Peter Frankl},
title = {The convex hull of antichains in posets},
journal = {Comb.},
volume = {12},
number = {4},
pages = {493--496},
year = {1992},
url = {https://doi.org/10.1007/BF01305241},
doi = {10.1007/BF01305241},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Frankl92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/CalderbankF92,
author = {A. Robert Calderbank and
Peter Frankl},
title = {Improved Upper Bounds Concerning the Erd{\"{o}}s-Ko-Rado Theorem},
journal = {Comb. Probab. Comput.},
volume = {1},
pages = {115--122},
year = {1992},
url = {https://doi.org/10.1017/S0963548300000134},
doi = {10.1017/S0963548300000134},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/CalderbankF92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Frankl92,
author = {Peter Frankl},
title = {On cross-intersecting families},
journal = {Discret. Math.},
volume = {108},
number = {1-3},
pages = {291--295},
year = {1992},
url = {https://doi.org/10.1016/0012-365X(92)90682-6},
doi = {10.1016/0012-365X(92)90682-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Frankl92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/FranklR92,
author = {Peter Frankl and
Vojtech R{\"{o}}dl},
title = {The Uniformity Lemma for hypergraphs},
journal = {Graphs Comb.},
volume = {8},
number = {4},
pages = {309--312},
year = {1992},
url = {https://doi.org/10.1007/BF02351586},
doi = {10.1007/BF02351586},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/FranklR92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklT92,
author = {Peter Frankl and
Norihide Tokushige},
title = {Some Best Possible Inequalities Concerning Cross-Intersecting Families},
journal = {J. Comb. Theory, Ser. {A}},
volume = {61},
number = {1},
pages = {87--97},
year = {1992},
timestamp = {Mon, 19 Jul 2004 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/FranklT92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FranklF91,
author = {Peter Frankl and
Zolt{\'{a}}n F{\"{u}}redi},
title = {A sharpening of Fisher's inequality},
journal = {Discret. Math.},
volume = {90},
number = {1},
pages = {103--107},
year = {1991},
url = {https://doi.org/10.1016/0012-365X(91)90101-7},
doi = {10.1016/0012-365X(91)90101-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FranklF91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Frankl91,
author = {Peter Frankl},
title = {Shadows and shifting},
journal = {Graphs Comb.},
volume = {7},
number = {1},
pages = {23--29},
year = {1991},
url = {https://doi.org/10.1007/BF01789460},
doi = {10.1007/BF01789460},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Frankl91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Frankl91,
author = {Peter Frankl},
title = {Multiply-intersecting families},
journal = {J. Comb. Theory, Ser. {B}},
volume = {53},
number = {2},
pages = {195--234},
year = {1991},
url = {https://doi.org/10.1016/0095-8956(91)90075-U},
doi = {10.1016/0095-8956(91)90075-U},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Frankl91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklF91,
author = {Peter Frankl and
Zolt{\'{a}}n F{\"{u}}redi},
title = {Beyond the Erd{\"{o}}s-Ko-Rado theorem},
journal = {J. Comb. Theory, Ser. {A}},
volume = {56},
number = {2},
pages = {182--194},
year = {1991},
url = {https://doi.org/10.1016/0097-3165(91)90031-B},
doi = {10.1016/0097-3165(91)90031-B},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklF91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CalderbankF90,
author = {A. Robert Calderbank and
Peter Frankl},
title = {Binary codes and quasi-symmetric designs},
journal = {Discret. Math.},
volume = {83},
number = {2-3},
pages = {201--204},
year = {1990},
url = {https://doi.org/10.1016/0012-365X(90)90005-3},
doi = {10.1016/0012-365X(90)90005-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CalderbankF90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Frankl90,
author = {Peter Frankl},
title = {An intersection problem for codes},
journal = {Discret. Math.},
volume = {84},
number = {2},
pages = {135--141},
year = {1990},
url = {https://doi.org/10.1016/0012-365X(90)90369-S},
doi = {10.1016/0012-365X(90)90369-S},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Frankl90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklM90,
author = {Peter Frankl and
Hiroshi Maehara},
title = {Simplices with Given 2-Face Areas},
journal = {Eur. J. Comb.},
volume = {11},
number = {3},
pages = {241--247},
year = {1990},
url = {https://doi.org/10.1016/S0195-6698(13)80124-2},
doi = {10.1016/S0195-6698(13)80124-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FranklM90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Frankl90,
author = {Peter Frankl},
title = {Asymptotic solution of a tur{\'{a}}n-type problem},
journal = {Graphs Comb.},
volume = {6},
number = {3},
pages = {223--227},
year = {1990},
url = {https://doi.org/10.1007/BF01787573},
doi = {10.1007/BF01787573},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Frankl90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Frankl90,
author = {Peter Frankl},
title = {Intersection theorems and mod \emph{p} rank of inclusion matrices},
journal = {J. Comb. Theory, Ser. {A}},
volume = {54},
number = {1},
pages = {85--94},
year = {1990},
url = {https://doi.org/10.1016/0097-3165(90)90007-J},
doi = {10.1016/0097-3165(90)90007-J},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Frankl90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklGR90,
author = {Peter Frankl and
Ronald L. Graham and
Vojtech R{\"{o}}dl},
title = {Iterated combinatorial density theorems},
journal = {J. Comb. Theory, Ser. {A}},
volume = {54},
number = {1},
pages = {95--111},
year = {1990},
url = {https://doi.org/10.1016/0097-3165(90)90008-K},
doi = {10.1016/0097-3165(90)90008-K},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklGR90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Frankl90,
author = {Peter Frankl},
title = {Canonical Antichains on the Circle and Applications},
journal = {{SIAM} J. Discret. Math.},
volume = {3},
number = {3},
pages = {355--363},
year = {1990},
url = {https://doi.org/10.1137/0403031},
doi = {10.1137/0403031},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Frankl90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Frankl89,
author = {Peter Frankl},
title = {A lower bound on the size of a complex generated by an antichain},
journal = {Discret. Math.},
volume = {76},
number = {1},
pages = {51--56},
year = {1989},
url = {https://doi.org/10.1016/0012-365X(89)90287-2},
doi = {10.1016/0012-365X(89)90287-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Frankl89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/CameronFK89,
author = {Peter J. Cameron and
Peter Frankl and
William M. Kantor},
title = {Intersecting Families of Finite Sets and Fixed-point-Free 2-Elements},
journal = {Eur. J. Comb.},
volume = {10},
number = {2},
pages = {149--160},
year = {1989},
url = {https://doi.org/10.1016/S0195-6698(89)80042-3},
doi = {10.1016/S0195-6698(89)80042-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/CameronFK89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Frankl89,
author = {Peter Frankl},
title = {Helly-type Theorems for Varieties},
journal = {Eur. J. Comb.},
volume = {10},
number = {3},
pages = {243--245},
year = {1989},
url = {https://doi.org/10.1016/S0195-6698(89)80058-7},
doi = {10.1016/S0195-6698(89)80058-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Frankl89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Frankl89,
author = {Peter Frankl},
title = {Traces of antichains},
journal = {Graphs Comb.},
volume = {5},
number = {1},
pages = {295--299},
year = {1989},
url = {https://doi.org/10.1007/BF01788682},
doi = {10.1007/BF01788682},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Frankl89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklF89,
author = {Peter Frankl and
Zolt{\'{a}}n F{\"{u}}redi},
title = {Extremal problems whose solutions are the blowups of the small witt-designs},
journal = {J. Comb. Theory, Ser. {A}},
volume = {52},
number = {1},
pages = {129--147},
year = {1989},
url = {https://doi.org/10.1016/0097-3165(89)90067-8},
doi = {10.1016/0097-3165(89)90067-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklF89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/CameronDF88,
author = {Peter J. Cameron and
Michel Deza and
Peter Frankl},
title = {Intersection theorems in permutation groups},
journal = {Comb.},
volume = {8},
number = {3},
pages = {249--260},
year = {1988},
url = {https://doi.org/10.1007/BF02126798},
doi = {10.1007/BF02126798},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/CameronDF88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FranklR88,
author = {Peter Frankl and
Vojtech R{\"{o}}dl},
title = {Some Ramsey - Tur{\'{a}}n type results for hypergraphs},
journal = {Comb.},
volume = {8},
number = {4},
pages = {323--332},
year = {1988},
url = {https://doi.org/10.1007/BF02189089},
doi = {10.1007/BF02189089},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FranklR88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/FranklM88,
author = {Peter Frankl and
Hiroshi Maehara},
title = {On the Contact Dimensions of Graphs},
journal = {Discret. Comput. Geom.},
volume = {3},
pages = {89--96},
year = {1988},
url = {https://doi.org/10.1007/BF02187899},
doi = {10.1007/BF02187899},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/FranklM88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklRW88,
author = {Peter Frankl and
Vojtech R{\"{o}}dl and
Richard M. Wilson},
title = {The number of submatrices of a given type in a Hadamard matrix and
related results},
journal = {J. Comb. Theory, Ser. {B}},
volume = {44},
number = {3},
pages = {317--328},
year = {1988},
url = {https://doi.org/10.1016/0095-8956(88)90040-8},
doi = {10.1016/0095-8956(88)90040-8},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/FranklRW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklM88,
author = {Peter Frankl and
Hiroshi Maehara},
title = {The Johnson-Lindenstrauss lemma and the sphericity of some graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {44},
number = {3},
pages = {355--362},
year = {1988},
url = {https://doi.org/10.1016/0095-8956(88)90043-3},
doi = {10.1016/0095-8956(88)90043-3},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklM88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklGR88,
author = {Peter Frankl and
Ronald L. Graham and
Vojtech R{\"{o}}dl},
title = {Quantitative theorems for regular systems of equations},
journal = {J. Comb. Theory, Ser. {A}},
volume = {47},
number = {2},
pages = {246--261},
year = {1988},
url = {https://doi.org/10.1016/0097-3165(88)90020-9},
doi = {10.1016/0097-3165(88)90020-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklGR88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/FranklP88,
author = {Peter Frankl and
J{\'{a}}nos Pach},
title = {An extremal problem on \emph{K\({}_{\mbox{r}}\)}-free graphs},
journal = {J. Graph Theory},
volume = {12},
number = {4},
pages = {519--523},
year = {1988},
url = {https://doi.org/10.1002/jgt.3190120407},
doi = {10.1002/JGT.3190120407},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/FranklP88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BjornerFS87,
author = {Anders Bj{\"{o}}rner and
Peter Frankl and
Richard P. Stanley},
title = {The number of faces of balanced Cohen-Macaulay complexes and a generalized
Macaulay theorem},
journal = {Comb.},
volume = {7},
number = {1},
pages = {23--34},
year = {1987},
url = {https://doi.org/10.1007/BF02579197},
doi = {10.1007/BF02579197},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BjornerFS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Frankl87,
author = {Peter Frankl},
title = {On a pursuit game on Cazley graphs},
journal = {Comb.},
volume = {7},
number = {1},
pages = {67--70},
year = {1987},
url = {https://doi.org/10.1007/BF02579201},
doi = {10.1007/BF02579201},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Frankl87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/Frankl87,
author = {Peter Frankl},
title = {Cops and robbers in graphs with large girth and Cayley graphs},
journal = {Discret. Appl. Math.},
volume = {17},
number = {3},
pages = {301--305},
year = {1987},
url = {https://doi.org/10.1016/0166-218X(87)90033-3},
doi = {10.1016/0166-218X(87)90033-3},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/Frankl87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FranklM87,
author = {Peter Frankl and
Hiroshi Maehara},
title = {Open-interval graphs versus closed-interval graphs},
journal = {Discret. Math.},
volume = {63},
number = {1},
pages = {97--100},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90156-7},
doi = {10.1016/0012-365X(87)90156-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FranklM87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/EnomotoFIN87,
author = {Hikoe Enomoto and
Peter Frankl and
Noboru Ito and
Kazumasa Nomura},
title = {Codes with given distances},
journal = {Graphs Comb.},
volume = {3},
number = {1},
pages = {25--38},
year = {1987},
url = {https://doi.org/10.1007/BF01788526},
doi = {10.1007/BF01788526},
timestamp = {Tue, 06 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/EnomotoFIN87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ChungF87,
author = {Fan R. K. Chung and
Peter Frankl},
title = {The maximum number of edges in a 3-graph not containing a given star},
journal = {Graphs Comb.},
volume = {3},
number = {1},
pages = {111--126},
year = {1987},
url = {https://doi.org/10.1007/BF01788535},
doi = {10.1007/BF01788535},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/ChungF87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/FranklFP87,
author = {Peter Frankl and
Zolt{\'{a}}n F{\"{u}}redi and
J{\'{a}}nos Pach},
title = {Bounding one-way differences},
journal = {Graphs Comb.},
volume = {3},
number = {1},
pages = {341--347},
year = {1987},
url = {https://doi.org/10.1007/BF01788556},
doi = {10.1007/BF01788556},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/FranklFP87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklGR87a,
author = {Peter Frankl and
Ronald L. Graham and
Vojtech R{\"{o}}dl},
title = {Induced restricted Ramsey theorems for spaces},
journal = {J. Comb. Theory, Ser. {A}},
volume = {44},
number = {1},
pages = {120--128},
year = {1987},
url = {https://doi.org/10.1016/0097-3165(87)90064-1},
doi = {10.1016/0097-3165(87)90064-1},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklGR87a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklG87,
author = {Peter Frankl and
Ronald L. Graham},
title = {The Radon transform on Abelian Groups},
journal = {J. Comb. Theory, Ser. {A}},
volume = {44},
number = {1},
pages = {168--171},
year = {1987},
url = {https://doi.org/10.1016/0097-3165(87)90071-9},
doi = {10.1016/0097-3165(87)90071-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklG87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/DezaF87,
author = {Mikhail Deza and
Peter Frankl},
title = {A helly type theorem for hypersurfaces},
journal = {J. Comb. Theory, Ser. {A}},
volume = {45},
number = {1},
pages = {27--30},
year = {1987},
url = {https://doi.org/10.1016/0097-3165(87)90043-4},
doi = {10.1016/0097-3165(87)90043-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/DezaF87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklGR87,
author = {Peter Frankl and
Ronald L. Graham and
Vojtech R{\"{o}}dl},
title = {On subsets of abelian groups with no 3-term arithmetic progression},
journal = {J. Comb. Theory, Ser. {A}},
volume = {45},
number = {1},
pages = {157--161},
year = {1987},
url = {https://doi.org/10.1016/0097-3165(87)90053-7},
doi = {10.1016/0097-3165(87)90053-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklGR87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklF87,
author = {Peter Frankl and
Zolt{\'{a}}n F{\"{u}}redi},
title = {Exact solution of some Tur{\'{a}}n-type problems},
journal = {J. Comb. Theory, Ser. {A}},
volume = {45},
number = {2},
pages = {226--262},
year = {1987},
url = {https://doi.org/10.1016/0097-3165(87)90016-1},
doi = {10.1016/0097-3165(87)90016-1},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklF87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Frankl87,
author = {Peter Frankl},
title = {Erd{\"{o}}s-Ko-Rado theorem with conditions on the maximal degree},
journal = {J. Comb. Theory, Ser. {A}},
volume = {46},
number = {2},
pages = {252--263},
year = {1987},
url = {https://doi.org/10.1016/0097-3165(87)90005-7},
doi = {10.1016/0097-3165(87)90005-7},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Frankl87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Frankl86,
author = {Peter Frankl},
title = {Orthogonal vectors in the n-dimensional cube and codes with missing
distances},
journal = {Comb.},
volume = {6},
number = {3},
pages = {279--286},
year = {1986},
url = {https://doi.org/10.1007/BF02579389},
doi = {10.1007/BF02579389},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Frankl86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FranklF86,
author = {Peter Frankl and
Zolt{\'{a}}n F{\"{u}}redi},
title = {Finite projective spaces and intersecting hypergraphs},
journal = {Comb.},
volume = {6},
number = {4},
pages = {335--354},
year = {1986},
url = {https://doi.org/10.1007/BF02579260},
doi = {10.1007/BF02579260},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FranklF86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dcg/DezaF86,
author = {Michel Deza and
Peter Frankl},
title = {On Squashed Designs},
journal = {Discret. Comput. Geom.},
volume = {1},
pages = {379--390},
year = {1986},
url = {https://doi.org/10.1007/BF02187709},
doi = {10.1007/BF02187709},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dcg/DezaF86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Frankl86,
author = {Peter Frankl},
title = {What must be contained in every oriented k-uniform hypergraph},
journal = {Discret. Math.},
volume = {62},
number = {3},
pages = {311--313},
year = {1986},
url = {https://doi.org/10.1016/0012-365X(86)90219-0},
doi = {10.1016/0012-365X(86)90219-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Frankl86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/EngelF86,
author = {Konrad Engel and
Peter Frankl},
title = {An Erd{\"{o}}s-Ko-Rado Theorem for Integer Sequences of Given
Rank},
journal = {Eur. J. Comb.},
volume = {7},
number = {3},
pages = {215--220},
year = {1986},
url = {https://doi.org/10.1016/S0195-6698(86)80025-7},
doi = {10.1016/S0195-6698(86)80025-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/EngelF86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklM86,
author = {Peter Frankl and
Hiroshi Maehara},
title = {Embedding the n-cube in Lower Dimensions},
journal = {Eur. J. Comb.},
volume = {7},
number = {3},
pages = {221--225},
year = {1986},
url = {https://doi.org/10.1016/S0195-6698(86)80026-9},
doi = {10.1016/S0195-6698(86)80026-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FranklM86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ErdosFR86,
author = {Paul Erd{\"{o}}s and
Peter Frankl and
Vojtech R{\"{o}}dl},
title = {The asymptotic number of graphs not containing a fixed subgraph and
a problem for hypergraphs having no exponent},
journal = {Graphs Comb.},
volume = {2},
number = {1},
pages = {113--121},
year = {1986},
url = {https://doi.org/10.1007/BF01788085},
doi = {10.1007/BF01788085},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/ErdosFR86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/FranklR86,
author = {Peter Frankl and
Vojtech R{\"{o}}dl},
title = {Large triangle-free subgraphs in graphs without\emph{K}\({}_{\mbox{4}}\)},
journal = {Graphs Comb.},
volume = {2},
number = {1},
pages = {135--144},
year = {1986},
url = {https://doi.org/10.1007/BF01788087},
doi = {10.1007/BF01788087},
timestamp = {Thu, 13 Aug 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/FranklR86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklF86a,
author = {Peter Frankl and
Zolt{\'{a}}n F{\"{u}}redi},
title = {Extremal problems concerning Kneser graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {40},
number = {3},
pages = {270--284},
year = {1986},
url = {https://doi.org/10.1016/0095-8956(86)90084-5},
doi = {10.1016/0095-8956(86)90084-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklF86a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklF86,
author = {Peter Frankl and
Zolt{\'{a}}n F{\"{u}}redi},
title = {Non-trivial intersecting families},
journal = {J. Comb. Theory, Ser. {A}},
volume = {41},
number = {1},
pages = {150--153},
year = {1986},
url = {https://doi.org/10.1016/0097-3165(86)90121-4},
doi = {10.1016/0097-3165(86)90121-4},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/FranklF86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Frankl86,
author = {Peter Frankl},
title = {All rationals occur as exponents},
journal = {J. Comb. Theory, Ser. {A}},
volume = {42},
number = {2},
pages = {200--206},
year = {1986},
url = {https://doi.org/10.1016/0097-3165(86)90090-7},
doi = {10.1016/0097-3165(86)90090-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Frankl86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ChungGFS86,
author = {Fan R. K. Chung and
Ronald L. Graham and
Peter Frankl and
James B. Shearer},
title = {Some intersection theorems for ordered sets and graphs},
journal = {J. Comb. Theory, Ser. {A}},
volume = {43},
number = {1},
pages = {23--37},
year = {1986},
url = {https://doi.org/10.1016/0097-3165(86)90019-1},
doi = {10.1016/0097-3165(86)90019-1},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/ChungGFS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklW86,
author = {Peter Frankl and
Richard M. Wilson},
title = {The Erd{\"{o}}s-Ko-Rado theorem for vector spaces},
journal = {J. Comb. Theory, Ser. {A}},
volume = {43},
number = {2},
pages = {228--236},
year = {1986},
url = {https://doi.org/10.1016/0097-3165(86)90063-4},
doi = {10.1016/0097-3165(86)90063-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklW86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/BabaiFS86,
author = {L{\'{a}}szl{\'{o}} Babai and
Peter Frankl and
Janos Simon},
title = {Complexity classes in communication complexity theory (preliminary
version)},
booktitle = {27th Annual Symposium on Foundations of Computer Science, Toronto,
Canada, 27-29 October 1986},
pages = {337--347},
publisher = {{IEEE} Computer Society},
year = {1986},
url = {https://doi.org/10.1109/SFCS.1986.15},
doi = {10.1109/SFCS.1986.15},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/focs/BabaiFS86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/ErdosFK85,
author = {P{\'{e}}ter L. Erd{\"{o}}s and
Peter Frankl and
Gyula O. H. Katona},
title = {Extremal hypergraph problems and convex hulls},
journal = {Comb.},
volume = {5},
number = {1},
pages = {11--26},
year = {1985},
url = {https://doi.org/10.1007/BF02579438},
doi = {10.1007/BF02579438},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/ErdosFK85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CohenF85,
author = {G{\'{e}}rard D. Cohen and
Peter Frankl},
title = {Good coverings of Hamming spaces with spheres},
journal = {Discret. Math.},
volume = {56},
number = {2-3},
pages = {125--131},
year = {1985},
url = {https://doi.org/10.1016/0012-365X(85)90020-2},
doi = {10.1016/0012-365X(85)90020-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CohenF85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklG85,
author = {Peter Frankl and
Ronald L. Graham},
title = {Intersection Theorems for Vector Spaces},
journal = {Eur. J. Comb.},
volume = {6},
number = {2},
pages = {183--187},
year = {1985},
url = {https://doi.org/10.1016/S0195-6698(85)80009-3},
doi = {10.1016/S0195-6698(85)80009-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FranklG85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklK85,
author = {Peter Frankl and
Gyula O. H. Katona},
title = {Polytopes Determined by Hypergraph Classes},
journal = {Eur. J. Comb.},
volume = {6},
number = {3},
pages = {233--243},
year = {1985},
url = {https://doi.org/10.1016/S0195-6698(85)80033-0},
doi = {10.1016/S0195-6698(85)80033-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FranklK85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklR85,
author = {Peter Frankl and
Vojtech R{\"{o}}dl},
title = {Near Perfect Coverings in Graphs and Hypergraphs},
journal = {Eur. J. Comb.},
volume = {6},
number = {4},
pages = {317--326},
year = {1985},
url = {https://doi.org/10.1016/S0195-6698(85)80045-7},
doi = {10.1016/S0195-6698(85)80045-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FranklR85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AlonF85,
author = {Noga Alon and
Peter Frankl},
title = {The maximum number of disjoint pairs in a family of subsets},
journal = {Graphs Comb.},
volume = {1},
number = {1},
pages = {13--21},
year = {1985},
url = {https://doi.org/10.1007/BF02582924},
doi = {10.1007/BF02582924},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AlonF85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/FranklR85,
author = {Peter Frankl and
Vojtech R{\"{o}}dl},
title = {Lower bounds for Tur{\'{a}}n's problem},
journal = {Graphs Comb.},
volume = {1},
number = {1},
pages = {213--216},
year = {1985},
url = {https://doi.org/10.1007/BF02582949},
doi = {10.1007/BF02582949},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/FranklR85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklF85,
author = {Peter Frankl and
Zolt{\'{a}}n F{\"{u}}redi},
title = {Forbidding Just One Intersection},
journal = {J. Comb. Theory, Ser. {A}},
volume = {39},
number = {2},
pages = {160--176},
year = {1985},
url = {https://doi.org/10.1016/0097-3165(85)90035-4},
doi = {10.1016/0097-3165(85)90035-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklF85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AkiyamaF85,
author = {Jin Akiyama and
Peter Frankl},
title = {On the size of graphs with complete-factors},
journal = {J. Graph Theory},
volume = {9},
number = {1},
pages = {197--201},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090117},
doi = {10.1002/JGT.3190090117},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AkiyamaF85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Frankl85,
author = {Peter Frankl},
title = {On the chromatic number of the general Kneser-graph},
journal = {J. Graph Theory},
volume = {9},
number = {2},
pages = {217--220},
year = {1985},
url = {https://doi.org/10.1002/jgt.3190090204},
doi = {10.1002/JGT.3190090204},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Frankl85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AlonFR85,
author = {Noga Alon and
Peter Frankl and
Vojtech R{\"{o}}dl},
title = {Geometrical Realization of Set Systems and Probabilistic Communication
Complexity},
booktitle = {26th Annual Symposium on Foundations of Computer Science, Portland,
Oregon, USA, 21-23 October 1985},
pages = {277--280},
publisher = {{IEEE} Computer Society},
year = {1985},
url = {https://doi.org/10.1109/SFCS.1985.30},
doi = {10.1109/SFCS.1985.30},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AlonFR85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/ErdosFK84,
author = {P{\'{e}}ter L. Erd{\"{o}}s and
Peter Frankl and
Gyula O. H. Katona},
title = {Intersecting Sperner families and their convex hulls},
journal = {Comb.},
volume = {4},
number = {1},
pages = {21--34},
year = {1984},
url = {https://doi.org/10.1007/BF02579153},
doi = {10.1007/BF02579153},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/ErdosFK84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FranklP84,
author = {Peter Frankl and
J{\'{a}}nos Pach},
title = {On disjointly representable sets},
journal = {Comb.},
volume = {4},
number = {1},
pages = {39--45},
year = {1984},
url = {https://doi.org/10.1007/BF02579155},
doi = {10.1007/BF02579155},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FranklP84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FranklR84,
author = {Peter Frankl},
title = {Families of finite sets with three intersections},
journal = {Comb.},
volume = {4},
number = {2},
pages = {141--148},
year = {1984},
url = {https://doi.org/10.1007/BF02579214},
doi = {10.1007/BF02579214},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FranklR84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Frankl84,
author = {Peter Frankl and
Vojtech R{\"{o}}dl},
title = {Hypergraphs do not jump},
journal = {Comb.},
volume = {4},
number = {2},
pages = {149--159},
year = {1984},
url = {https://doi.org/10.1007/BF02579215},
doi = {10.1007/BF02579215},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Frankl84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FranklF84,
author = {Peter Frankl and
Zolt{\'{a}}n F{\"{u}}redi},
title = {A new extremal property of Steiner triple-systems},
journal = {Discret. Math.},
volume = {48},
number = {2-3},
pages = {205--212},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90183-3},
doi = {10.1016/0012-365X(84)90183-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FranklF84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Frankl84,
author = {Peter Frankl},
title = {A new short proof for the Kruskal-Katona theorem},
journal = {Discret. Math.},
volume = {48},
number = {2-3},
pages = {327--329},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90193-6},
doi = {10.1016/0012-365X(84)90193-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Frankl84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FranklF84a,
author = {Peter Frankl and
Zolt{\'{a}}n F{\"{u}}redi},
title = {An exact result for 3-graphs},
journal = {Discret. Math.},
volume = {50},
pages = {323--328},
year = {1984},
url = {https://doi.org/10.1016/0012-365X(84)90058-X},
doi = {10.1016/0012-365X(84)90058-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FranklF84a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklF84,
author = {Peter Frankl and
Zolt{\'{a}}n F{\"{u}}redi},
title = {Union-free Hypergraphs and Probability Theory},
journal = {Eur. J. Comb.},
volume = {5},
number = {2},
pages = {127--131},
year = {1984},
url = {https://doi.org/10.1016/S0195-6698(84)80025-6},
doi = {10.1016/S0195-6698(84)80025-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FranklF84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklF84,
author = {Peter Frankl and
Zolt{\'{a}}n F{\"{u}}redi},
title = {On Hypergraphs without Two Edges Intersecting in a Given Number of
Vertices},
journal = {J. Comb. Theory, Ser. {A}},
volume = {36},
number = {2},
pages = {230--236},
year = {1984},
url = {https://doi.org/10.1016/0097-3165(84)90008-6},
doi = {10.1016/0097-3165(84)90008-6},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklF84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/DezaF84,
author = {Mikhail Deza and
Peter Frankl},
title = {Injection geometries},
journal = {J. Comb. Theory, Ser. {B}},
volume = {37},
number = {1},
pages = {31--40},
year = {1984},
url = {https://doi.org/10.1016/0095-8956(84)90042-X},
doi = {10.1016/0095-8956(84)90042-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/DezaF84.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Frankl83,
author = {Peter Frankl},
title = {An extremal set theoretical characterization of some Steiner systems},
journal = {Comb.},
volume = {3},
number = {2},
pages = {193--199},
year = {1983},
url = {https://doi.org/10.1007/BF02579293},
doi = {10.1007/BF02579293},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Frankl83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/DezaFS83,
author = {Michel Deza and
Peter Frankl and
N. M. Singhi},
title = {On Functions of Strenth t},
journal = {Comb.},
volume = {3},
number = {3},
pages = {331--339},
year = {1983},
url = {https://doi.org/10.1007/BF02579189},
doi = {10.1007/BF02579189},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/DezaFS83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FranklF83,
author = {Peter Frankl and
Zolt{\'{a}}n F{\"{u}}redi},
title = {A new generation of the Erd{\"{o}}s - Ko - Rado theorem},
journal = {Comb.},
volume = {3},
number = {3},
pages = {341--350},
year = {1983},
url = {https://doi.org/10.1007/BF02579190},
doi = {10.1007/BF02579190},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FranklF83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Frankl83,
author = {Peter Frankl},
title = {A probabilistic proof for the lym-inequality},
journal = {Discret. Math.},
volume = {43},
number = {2-3},
pages = {325},
year = {1983},
url = {https://doi.org/10.1016/0012-365X(83)90170-X},
doi = {10.1016/0012-365X(83)90170-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Frankl83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklP83,
author = {Peter Frankl and
J{\'{a}}nos Pach},
title = {On the Number of Sets in a Null t-Design},
journal = {Eur. J. Comb.},
volume = {4},
number = {1},
pages = {21--23},
year = {1983},
url = {https://doi.org/10.1016/S0195-6698(83)80004-3},
doi = {10.1016/S0195-6698(83)80004-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FranklP83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklO83,
author = {Peter Frankl and
Andrew M. Odlyzko},
title = {On Subsets with Cardinalities of Intersections Divisible by a Fixed
Integer},
journal = {Eur. J. Comb.},
volume = {4},
number = {3},
pages = {215--220},
year = {1983},
url = {https://doi.org/10.1016/S0195-6698(83)80014-6},
doi = {10.1016/S0195-6698(83)80014-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FranklO83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklS83,
author = {Peter Frankl and
Navin M. Singhi},
title = {Linear Dependencies among Subsets of a Finite Set},
journal = {Eur. J. Comb.},
volume = {4},
number = {4},
pages = {313--318},
year = {1983},
url = {https://doi.org/10.1016/S0195-6698(83)80027-4},
doi = {10.1016/S0195-6698(83)80027-4},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ejc/FranklS83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Frankl83,
author = {Peter Frankl},
title = {On the Trace of Finite Sets},
journal = {J. Comb. Theory, Ser. {A}},
volume = {34},
number = {1},
pages = {41--45},
year = {1983},
url = {https://doi.org/10.1016/0097-3165(83)90038-9},
doi = {10.1016/0097-3165(83)90038-9},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Frankl83.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/DezaF82,
author = {Michel Deza and
Peter Frankl},
title = {On the vector space of 0-configurations},
journal = {Comb.},
volume = {2},
number = {4},
pages = {341--345},
year = {1982},
url = {https://doi.org/10.1007/BF02579430},
doi = {10.1007/BF02579430},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/DezaF82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Frankl82,
author = {Peter Frankl},
title = {An Extremal Problem for two Families of Sets},
journal = {Eur. J. Comb.},
volume = {3},
number = {2},
pages = {125--127},
year = {1982},
url = {https://doi.org/10.1016/S0195-6698(82)80025-5},
doi = {10.1016/S0195-6698(82)80025-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Frankl82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/ErdosFF82,
author = {Paul Erd{\"{o}}s and
Peter Frankl and
Zolt{\'{a}}n F{\"{u}}redi},
title = {Families of Finite Sets in Which No Set Is Covered by the Union of
Two Others},
journal = {J. Comb. Theory, Ser. {A}},
volume = {33},
number = {2},
pages = {158--166},
year = {1982},
url = {https://doi.org/10.1016/0097-3165(82)90004-8},
doi = {10.1016/0097-3165(82)90004-8},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/ErdosFF82.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/DezaF81,
author = {Michel Deza and
Peter Frankl},
title = {Every large set of equidistant (0, +1, -1)-vectors forms a sunflower},
journal = {Comb.},
volume = {1},
number = {3},
pages = {225--231},
year = {1981},
url = {https://doi.org/10.1007/BF02579328},
doi = {10.1007/BF02579328},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/DezaF81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FranklW81,
author = {Peter Frankl and
Richard M. Wilson},
title = {Intersection theorems with geometric consequences},
journal = {Comb.},
volume = {1},
number = {4},
pages = {357--368},
year = {1981},
url = {https://doi.org/10.1007/BF02579457},
doi = {10.1007/BF02579457},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FranklW81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FranklF81,
author = {Peter Frankl and
Zolt{\'{a}}n F{\"{u}}redi},
title = {A short proof for a theorem of Harper about Hamming-spheres},
journal = {Discret. Math.},
volume = {34},
number = {3},
pages = {311--313},
year = {1981},
url = {https://doi.org/10.1016/0012-365X(81)90009-1},
doi = {10.1016/0012-365X(81)90009-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FranklF81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Frankl81,
author = {Peter Frankl},
title = {On Large Vector Systems with Equal Scalar Products},
journal = {Eur. J. Comb.},
volume = {2},
number = {2},
pages = {123--125},
year = {1981},
url = {https://doi.org/10.1016/S0195-6698(81)80002-9},
doi = {10.1016/S0195-6698(81)80002-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Frankl81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/FranklR81,
author = {Peter Frankl and
Ivo G. Rosenberg},
title = {A Finite Set Intersection Theorem},
journal = {Eur. J. Comb.},
volume = {2},
number = {2},
pages = {127--129},
year = {1981},
url = {https://doi.org/10.1016/S0195-6698(81)80003-0},
doi = {10.1016/S0195-6698(81)80003-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/FranklR81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Frankl81,
author = {Peter Frankl},
title = {On a Problem of Chv{\'{a}}tal and Erd{\"{o}}s on Hypergraphs
Containing No Generalized Simplex},
journal = {J. Comb. Theory, Ser. {A}},
volume = {30},
number = {2},
pages = {169--182},
year = {1981},
url = {https://doi.org/10.1016/0097-3165(81)90004-2},
doi = {10.1016/0097-3165(81)90004-2},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Frankl81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BekessyDHFK80,
author = {A. B{\'{e}}k{\'{e}}ssy and
J{\'{a}}nos Demetrovics and
L{\'{a}}szl{\'{o}} Hann{\'{a}}k and
Peter Frankl and
Gyula O. H. Katona},
title = {On the number of maximal dependencies in a data base relation of fixed
order},
journal = {Discret. Math.},
volume = {30},
number = {2},
pages = {83--88},
year = {1980},
url = {https://doi.org/10.1016/0012-365X(80)90108-9},
doi = {10.1016/0012-365X(80)90108-9},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/BekessyDHFK80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/BermondFS80,
author = {Jean{-}Claude Bermond and
Peter Frankl and
F. Sterboul},
title = {On the maximum number of edges in a hypergraph whose linegraph contains
no cycle},
journal = {Discret. Math.},
volume = {30},
number = {3},
pages = {295--298},
year = {1980},
url = {https://doi.org/10.1016/0012-365X(80)90237-X},
doi = {10.1016/0012-365X(80)90237-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/BermondFS80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CohenF80,
author = {G{\'{e}}rard D. Cohen and
Peter Frankl},
title = {On tilings of the binary vector space},
journal = {Discret. Math.},
volume = {31},
number = {3},
pages = {271--277},
year = {1980},
url = {https://doi.org/10.1016/0012-365X(80)90138-7},
doi = {10.1016/0012-365X(80)90138-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CohenF80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Frankl80,
author = {Peter Frankl},
title = {Extremal Problems and Coverings of the Space},
journal = {Eur. J. Comb.},
volume = {1},
number = {2},
pages = {101--106},
year = {1980},
url = {https://doi.org/10.1016/S0195-6698(80)80045-X},
doi = {10.1016/S0195-6698(80)80045-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Frankl80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BabaiF80,
author = {L{\'{a}}szl{\'{o}} Babai and
Peter Frankl},
title = {On Set Intersections},
journal = {J. Comb. Theory, Ser. {A}},
volume = {28},
number = {1},
pages = {103--105},
year = {1980},
url = {https://doi.org/10.1016/0097-3165(80)90063-1},
doi = {10.1016/0097-3165(80)90063-1},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/BabaiF80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siammax/FranklF80,
author = {Peter Frankl and
Zolt{\'{a}}n F{\"{u}}redi},
title = {The Erd{\"{o}}s-Ko-Rado Theorem for Integer Sequences},
journal = {{SIAM} J. Algebraic Discret. Methods},
volume = {1},
number = {4},
pages = {376--381},
year = {1980},
url = {https://doi.org/10.1137/0601044},
doi = {10.1137/0601044},
timestamp = {Thu, 15 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siammax/FranklF80.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Frankl79,
author = {Peter Frankl},
title = {Families of finite sets satisfying a union condition},
journal = {Discret. Math.},
volume = {26},
number = {2},
pages = {111--118},
year = {1979},
url = {https://doi.org/10.1016/0012-365X(79)90117-1},
doi = {10.1016/0012-365X(79)90117-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Frankl79.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Frankl78,
author = {Peter Frankl},
title = {On Intersecting Families of Finite Sets},
journal = {J. Comb. Theory, Ser. {A}},
volume = {24},
number = {2},
pages = {146--161},
year = {1978},
url = {https://doi.org/10.1016/0097-3165(78)90003-1},
doi = {10.1016/0097-3165(78)90003-1},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Frankl78.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Frankl77,
author = {Peter Frankl},
title = {On the Minimum Number of Disjoint Pairs in a Family of Finite Sets},
journal = {J. Comb. Theory, Ser. {A}},
volume = {22},
number = {2},
pages = {249--251},
year = {1977},
url = {https://doi.org/10.1016/0097-3165(77)90056-5},
doi = {10.1016/0097-3165(77)90056-5},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/Frankl77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/FranklD77,
author = {Peter Frankl and
Mikhail Deza},
title = {On the Maximum Number of Permutations with Given Maximal or Minimal
Distance},
journal = {J. Comb. Theory, Ser. {A}},
volume = {22},
number = {3},
pages = {352--360},
year = {1977},
url = {https://doi.org/10.1016/0097-3165(77)90009-7},
doi = {10.1016/0097-3165(77)90009-7},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/FranklD77.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Frankl76,
author = {Peter Frankl},
title = {On Sperner Families Satisfying an Additional Condition},
journal = {J. Comb. Theory, Ser. {A}},
volume = {20},
number = {1},
pages = {1--11},
year = {1976},
url = {https://doi.org/10.1016/0097-3165(76)90073-X},
doi = {10.1016/0097-3165(76)90073-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Frankl76.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Frankl75,
author = {Peter Frankl},
title = {The Proof of a Conjecture of G. O. H. Katona},
journal = {J. Comb. Theory, Ser. {A}},
volume = {19},
number = {2},
pages = {208--213},
year = {1975},
url = {https://doi.org/10.1016/S0097-3165(75)80009-4},
doi = {10.1016/S0097-3165(75)80009-4},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Frankl75.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2024-04-25 05:59 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:
