Zobrazeno 1 - 10
of 262
pro vyhledávání: '"Peter Frankl"'
Autor:
Peter Frankl, Andrey Kupavskii
Publikováno v:
Discrete Analysis (2020)
**For the moment the link is to the submitted version of the article. It will be updated when the final version has been posted to arXiv.** Simple juntas for shifted families, Discrete Analysis 2020:14, 18 pp. The Erdős-Ko-Rado theorem, proved in
Externí odkaz:
https://doaj.org/article/5e394f9abe654516985ddeaf80f68405
Publikováno v:
Defence Technology, Vol 12, Iss 2, Pp 135-147 (2016)
The effects of blast waves generated by energetic and non-energetic sources are of continuing interest to the ballistics research community. Modern conflicts are increasingly characterised by asymmetric urban warfare, with improvised explosive device
Externí odkaz:
https://doaj.org/article/04ecdf93cb424d149be7dcd2f2a476c9
Autor:
Peter Frankl, Andrey Kupavskii
Publikováno v:
Journal of Combinatorial Theory, Series B. 157:366-400
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d30fff73bee26b44275beca06e394828
https://doi.org/10.1016/j.jctb.2022.08.002
https://doi.org/10.1016/j.jctb.2022.08.002
Autor:
Chris Cadigan, Chris Chmura, Gus Floerchinger, Peter Frankl, Simon Hunt, Søren Jensen, Cyrus Boushehri, Tyrone L. Vincent, Robert Braun, Neal P. Sullivan
Publikováno v:
Journal of Power Sources. 573:233083
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5419964fbf0dc32dde6ba90e21bc360c
https://doi.org/10.1016/j.jpowsour.2023.233083
https://doi.org/10.1016/j.jpowsour.2023.233083
Autor:
Peter Frankl, Imre Bárány
Publikováno v:
The American Mathematical Monthly. 128:543-552
It is well known that a line can intersect at most 2n−1 unit squares of the n × n chessboard. Here we consider the three-dimensional version: how many unit cubes of the 3-dimensional cube [0,n]3 ca...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8188d718b131a85ec6860c6b305f5cdf
https://doi.org/10.1080/00029890.2021.1901463
https://doi.org/10.1080/00029890.2021.1901463
Autor:
Peter Frankl
Publikováno v:
Acta Mathematica Hungarica. 164:312-325
Let $$n > k > 1$$ be integers, $$[n] = \{1, \ldots, n\}$$ the standard $$n$$ -element set and $${[n]\choose k}$$ the collection of all its $$k$$ -subsets. The families $$\mathcal F_0, \ldots, \mathcal F_s \subset {[n]\choose k}$$ are said to be cross
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::50fc6c4baa39741a8eabc078ffdeebcc
https://doi.org/10.1007/s10474-021-01138-6
https://doi.org/10.1007/s10474-021-01138-6
Publikováno v:
Discrete & Computational Geometry. 68:728-737
Given a family of sets on the plane, we say that the family is intersecting if for any two sets from the family their interiors intersect. In this paper, we study intersecting families of triangles with vertices in a given set of points. In particula
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36414270403c4f7adc2a98b1fe12254a
https://doi.org/10.1007/s00454-021-00295-3
https://doi.org/10.1007/s00454-021-00295-3
Autor:
Peter Frankl
Publikováno v:
Acta Mathematica Hungarica. 163:652-662
Let $$n, \ell$$ be positive integers, $$n > 2\ell + 1$$ . Let X be an n-element set and $$\mathcal{F}$$ an antichain, $$\mathcal{F} \subset 2^X$$ . Kiselev, Kupavskii and Patkos conjectured that if $$|F\cup G| \leq 2\ell + 1$$ for all $$F, G \in \mat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21b022d290f2ee9d4246f6d0bae0488e
https://doi.org/10.1007/s10474-020-01100-y
https://doi.org/10.1007/s10474-020-01100-y
Autor:
Peter Frankl
Publikováno v:
Journal of Combinatorial Theory, Series B. 144:81-94
Let S be an n-element set and F ⊂ ( S k ) an intersecting family. Improving earlier results it is proved that for n > 72 k there is an element of S that is contained in all but ( n − 3 k − 2 ) members of F . One of the main ingredients of the p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c905ba7732139da43c9519cd191c31ad
https://doi.org/10.1016/j.jctb.2020.01.001
https://doi.org/10.1016/j.jctb.2020.01.001
Autor:
Peter Frankl
Publikováno v:
Discrete Applied Mathematics. 276:44-49
Let r , t be positive integers. In the present paper we investigate families of sets (both uniform and non-uniform) with the property that among any r + 1 members one can find two which overlap in at least t elements.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6204670a52c9bf20d12833a924086add
https://doi.org/10.1016/j.dam.2019.06.019
https://doi.org/10.1016/j.dam.2019.06.019