Zobrazeno 1 - 10
of 152
pro vyhledávání: '"Tomasz Łuczak"'
Autor:
Dominika Kasprzak, Janusz Rzeźniczak, Teresa Ganowicz, Tomasz Łuczak, Marek Słomczyński, Jarosław Hiczkiewicz, Paweł Burchardt
Publikováno v:
Global Heart, Vol 16, Iss 1 (2021)
According to the World Health Organization (WHO) forecasts, in 2030, the number of people suffering from dementia will reach 82 million people worldwide, representing a huge burden on health and social care systems. Epidemiological data indicates a r
Externí odkaz:
https://doaj.org/article/8da2f1c400d045238847503357e1d5fb
Publikováno v:
Combinatorica. 42:115-136
One of the oldest results in modern graph theory, due to Mantel, asserts that every triangle-free graphs on $n$ vertices has at most $\lfloor n^2/4\rfloor$ edges. About half a century later Andr\'asfai studied dense triangle-free graphs and proved th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b143a8c657fa2b8d99957549bf9d21a
https://doi.org/10.1007/s00493-021-4340-0
https://doi.org/10.1007/s00493-021-4340-0
Autor:
Tomasz Łuczak, Zahra Rahimi
Publikováno v:
Journal of Graph Theory. 99:691-714
We show that for every $\eta>0$, there exists $n_0$ such that for every even $n$, $n\ge n_0$, and every graph $G$ with $(2+\eta)n$ vertices and minimum degree at least $(7/4+4\eta)n$, each colouring of the edges of $G$ with three colours results in a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cff9eca6415457a0cfad582fc3364a71
https://doi.org/10.1002/jgt.22760
https://doi.org/10.1002/jgt.22760
Publikováno v:
Journal of Graph Theory. 98:57-80
Given positive integers $n\ge s$, we let ${\mathrm{ex}}(n,s)$ denote the maximum number of edges in a triangle-free graph $G$ on $n$ vertices with $\alpha(G)\le s$. In the early sixties Andr\'{a}sfai conjectured that for $n/3
Comment: Revised ac
Comment: Revised ac
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::28b3994766ccb1b10790f005c79caaf5
https://doi.org/10.1002/jgt.22682
https://doi.org/10.1002/jgt.22682
Autor:
Zahra Rahimi, Tomasz Łuczak
Publikováno v:
Journal of Combinatorial Theory, Series B. 143:1-15
We show that for every η > 0 there exists n 0 such that for every odd n ≥ n 0 each 3-colouring of edges of a graph G with ( 4 + η ) n and minimum degree larger than ( 7 / 2 + 2 η ) n leads to a monochromatic cycle of length n. This result is, up
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1360adbd3989ba5277281663f510b321
https://doi.org/10.1016/j.jctb.2019.11.002
https://doi.org/10.1016/j.jctb.2019.11.002
Autor:
Janusz Rzeźniczak, Jarosław Hiczkiewicz, Tomasz Łuczak, Marek Słomczyński, Dominika Kasprzak, Paweł Burchardt, Teresa Ganowicz
Publikováno v:
Global Heart
Global Heart, Vol 16, Iss 1 (2021)
Global Heart; Vol 16, No 1 (2021); 53
Global Heart, Vol 16, Iss 1 (2021)
Global Heart; Vol 16, No 1 (2021); 53
According to the World Health Organization (WHO) forecasts, in 2030, the number of people suffering from dementia will reach 82 million people worldwide, representing a huge burden on health and social care systems. Epidemiological data indicates a r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::25f128a362797a566805741ef7de93e1
http://europepmc.org/articles/PMC8344957
http://europepmc.org/articles/PMC8344957
Autor:
Dominika Kasprzak, Janusz Rzeźniczak, Teresa Ganowicz, Tomasz Łuczak, Marek Słomczyński, Jarosław Hiczkiewicz, Paweł Burchardt
Publikováno v:
Journal of the American College of Cardiology. 79:979
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fd3d3a89cf5537ad745308ac59ebfe5d
https://doi.org/10.1016/s0735-1097(22)01970-2
https://doi.org/10.1016/s0735-1097(22)01970-2
We find the exact value of the Ramsey number $R(C_{2\ell},K_{1,n})$, when $\ell$ and $n=O(\ell^{10/9})$ are large. Our result is closely related to the behaviour of Tur\'an number $ex(N, C_{2\ell})$ for an even cycle whose length grows quickly with $
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7b7812d4f0af428f722b40506e734939
Autor:
Justyna Banaszak, Tomasz Łuczak
Publikováno v:
Discrete Mathematics. 341:3165-3173
We prove that a.a.s. as soon as a Kronecker graph becomes connected it has a finite diameter.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6e2f85cdf7d29be852bc51174849229c
https://doi.org/10.1016/j.disc.2018.07.026
https://doi.org/10.1016/j.disc.2018.07.026
Publikováno v:
European Journal of Combinatorics. 71:43-50
We show that there exists an absolute constant A such that for each k ≥ 2 and every coloring of the edges of the complete k -uniform hypergraph on A r vertices with r colors, r ≥ r k , one of the color classes contains a loose path of length thre
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f15d4293eff58a93dac2d13094785497
https://doi.org/10.1016/j.ejc.2018.02.033
https://doi.org/10.1016/j.ejc.2018.02.033