Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Béla Csaba"'
Publikováno v:
Gerundium, Vol 13, Iss 3-4 (2022)
Kesztűs Lóránd 1951-ben dékánként első vezetője lett a Debreceni Tudományegyem Orvostudományi Karából alakult Debreceni Orvostudományi Egyetemnek, amely még két időszakra (1959-1963, 1967-1973) rektorának választotta. Meghatározó
Externí odkaz:
https://doaj.org/article/de14ea0838784b3da470f8041e48db4c
Publikováno v:
Combinatorics, Probability and Computing. 30:444-459
A perfect Kr-tiling in a graph G is a collection of vertex-disjoint copies of the clique Kr in G covering every vertex of G. The famous Hajnal–Szemerédi theorem determines the minimum degree threshold for forcing a perfect Kr-tiling in a graph G.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::aa806d7ba4d9a1d2b7c62aa882e79789
https://doi.org/10.1017/s0963548320000516
https://doi.org/10.1017/s0963548320000516
Publikováno v:
Carpathian Journal of Electronic and Computer Engineering. 11:11-14
This paper presents an Open Platform Activity and health monitoring systems which are also called e-Health systems. These systems measure and store parameters that reflect changes in the human body. Due to continuous monitoring (e.g. in rest state an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07e66f88905bee3126722a12d395bfe2
https://doi.org/10.2478/cjece-2018-0003
https://doi.org/10.2478/cjece-2018-0003
Autor:
Bálint Vásárhelyi, Béla Csaba
Publikováno v:
Informatica. 43
Assume that we are given two graphic sequences, $\pi_1$ and $\pi_2$. We consider conditions for $\pi_1$ and $\pi_2$ which guarantee that there exists a simple graph $G_2$ realizing $\pi_2$ such that $G_2$ is the subgraph of any simple graph $G_1$ tha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::baf1d72cc56376cf7a51fb5cf58c37c3
https://doi.org/10.31449/inf.v43i1.2684
https://doi.org/10.31449/inf.v43i1.2684
Autor:
Béla Csaba, Bálint Vásárhelyi
In this paper we construct a class of bounded degree bipartite graphs with a small separator and large bandwidth. Furthermore, we also prove that graphs from this class are spanning subgraphs of graphs with minimum degree just slightly larger than $n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5095e858ad37ba07679bfe157a64b93d
http://arxiv.org/abs/1809.08496
http://arxiv.org/abs/1809.08496
Publikováno v:
SCAM
Dependence clusters are (maximal) groups of source code entities that each depend on the other according to some dependence relation. Such clusters are generally seen as detrimental to many software engineering activities, but their formation and ove
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::44e97bbc9ec85f2fe7091eb2066c216d
https://doi.org/10.1016/j.scico.2014.09.010
https://doi.org/10.1016/j.scico.2014.09.010
Autor:
Judit Nagy-György, Béla Csaba
Let $H$ and $G$ be graphs on $n$ vertices, where $n$ is sufficiently large. We prove that if $H$ has Ore-degree at most 5 and $G$ has minimum degree at least $2n/3$ then $H\subset G.$
Comment: accepted for publication at SIAM J. Disc. Math
Comment: accepted for publication at SIAM J. Disc. Math
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::56625ff42d508f07c77bd6e49d17eab1
http://arxiv.org/abs/1707.07216
http://arxiv.org/abs/1707.07216
In this paper the authors prove the following results (via a unified approach) for all sufficiently large $n$: (i) [$1$-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph $G$ on $n$ verti
Publikováno v:
Random Structures & Algorithms. 38:121-139
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n,p) asymptotically almost surely contains a copy of every tree with maximum degree at most D
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fae3a8a753912bb1b35e1f67de78adc8
https://doi.org/10.1002/rsa.20345
https://doi.org/10.1002/rsa.20345
Autor:
András Pluhár, Béla Csaba
Publikováno v:
Journal of Scheduling. 11:449-455
We study the on-line minimum weighted bipartite matching problem in arbitrary metric spaces. Here, n not necessary disjoint points of a metric space M are given, and are to be matched on-line with n points of M revealed one by one. The cost of a matc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::01bcd7abd24060fc8babb777ff490f39
https://doi.org/10.1007/s10951-007-0037-5
https://doi.org/10.1007/s10951-007-0037-5