Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Katarzyna Mieczkowska"'
Autor:
Katarzyna Mieczkowska
Publikováno v:
Muzealnictwo. 64:44-51
Between March and August 2022, the NationalMuseum in Lublin mounted the first in Poland exhibition ofthe Polish painter Tamara Lempicka. The number of publicwho visited it reached 86,667, which made it an event of thehighest turn-out in Poland.An att
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::251986f43fa04e369bc72bec57b5f1cf
https://doi.org/10.5604/01.3001.0053.4737
https://doi.org/10.5604/01.3001.0053.4737
Publikováno v:
Pielęgniarstwo Polskie. 64:240-245
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::757cc98814a2ef930c76e54840c9e01e
https://doi.org/10.20883/pielpol.2017.31
https://doi.org/10.20883/pielpol.2017.31
Autor:
Katarzyna Mieczkowska, Tomasz Łuczak
Publikováno v:
Journal of Combinatorial Theory, Series A. 124:178-194
In 1965 Erd\H{o}s conjectured that the number of edges in k-uniform hypergraphs on n vertices in which the largest matching has s edges is maximized for hypergraphs of one of two special types. We settled this conjecture in the affirmative for k=3 an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a8ae54a91235d0b463a30f1ffa950300
https://doi.org/10.1016/j.jcta.2014.01.003
https://doi.org/10.1016/j.jcta.2014.01.003
Autor:
K Krzemiński, Grzegorz Opolski, Anna Gąsiorowska, Monika Budnik, Wiktor Niewiadomski, Robert Kowalik, Janusz Kochanowski, Anna Stępniewska, Katarzyna Żukowska, Katarzyna Mieczkowska, Katarzyna Szepietowska
Publikováno v:
Autonomic Neuroscience. 220:102555
Purpose Long-term β-adrenolytics treatment in takotsubo syndrome (TTS) patients is based on the premise, that TTS is strongly associated with sympathetic nervous system overactivity. The aim of the study was to establish hemodynamic response to tilt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1b01827e703f05c52c19b5254a31a3b5
https://doi.org/10.1016/j.autneu.2019.102555
https://doi.org/10.1016/j.autneu.2019.102555
We consider the problem of finding the optimal upper bound for the tail probability of a sum of k nonnegative, independent and identically distributed random variables with given mean x . For k = 1 the answer is given by Markov’s inequality and for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::68c486200743e7a309ab6170f2b71e8f
Publikováno v:
Scopus-Elsevier
We show that if the largest matching in a $k$-uniform hypergraph $G$ on $n$ vertices has precisely $s$ edges, and $n>2k^2s/\log k$, then $H$ has at most $\binom n k - \binom {n-s} k $ edges and this upper bound is achieved only for hypergraphs in whi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b0c335ee0a12a23a933332e4ba2cf348
http://www.scopus.com/inward/record.url?eid=2-s2.0-84863441484&partnerID=MN8TOARS
http://www.scopus.com/inward/record.url?eid=2-s2.0-84863441484&partnerID=MN8TOARS