Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Sergei Kiselev"'
Publikováno v:
Data in Brief, Vol 17, Iss , Pp 662-666 (2018)
The genetic reprogramming technology allows generation of induced pluripotent stem cells (iPSCs) from somatic cells (Takahashi and Yamanaka, 2006) [1]. iPSCs have the ability to self-renew, and to differentiate into any type of somatic cells, and are
Externí odkaz:
https://doaj.org/article/dc3464885dbc4d5489d239b16a0608ae
Publikováno v:
Journal of Engineering Science and Technology Review. 15:166-172
Autor:
Richard Dvorsky, Jana Kukutschová, Marek Pagáč, Ladislav Svoboda, Zuzana Šimonová, Kateřina Peterek Dědková, Jiří Bednář, Rafael Gregorio Mendes, Dalibor Matýsek, Ondřej Malina, Jiří Tuček, Zuzana Vilamová, Sergei Kiselev, Thomas Gemming, Peter Filip
Publikováno v:
Journal of Cleaner Production. 400:136688
Publikováno v:
Graph-Theoretic Concepts in Computer Science ISBN: 9783031159138
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ecf21f3c9c90278e88e78ddca4127d8
https://doi.org/10.1007/978-3-031-15914-5_22
https://doi.org/10.1007/978-3-031-15914-5_22
For $n > 2k \geq 4$ we consider intersecting families $\mathcal F$ consisting of $k$-subsets of $\{1, 2, \ldots, n\}$. Let $\mathcal I(\mathcal F)$ denote the family of all distinct intersections $F \cap F'$, $F \neq F'$ and $F, F'\in \mathcal F$. Le
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2b34315728f139b0ff740b07e6ce390a
http://arxiv.org/abs/2108.00479
http://arxiv.org/abs/2108.00479
Publikováno v:
European Journal of Combinatorics. 79:228-236
We suggest a new method for coloring generalized Kneser graphs based on hypergraphs with high discrepancy and a small number of edges. The main result provides a proper coloring of K ( n , n ∕ 2 − t , s ) in ( 4 + o ( 1 ) ) ( s + t ) 2 colors, wh
Autor:
Andrey Kupavskii, Sergei Kiselev
Publikováno v:
Bulletin of the London Mathematical Society
Bulletin of the London Mathematical Society, London Mathematical Society, 2021, 53 (2), pp.360-369. ⟨10.1112/blms.12423⟩
Bulletin of the London Mathematical Society, London Mathematical Society, 2021, 53 (2), pp.360-369. ⟨10.1112/blms.12423⟩
In this paper, we prove a conjecture of Aharoni and Howard on the existence of rainbow (transversal) matchings in sufficiently large families $\mathcal F_1,\ldots, \mathcal F_s$ of tuples in $\{1,\ldots, n\}^k$, provided $s\ge 470.$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f9b2cd24ddbd3c3340ddaf96ddc83bc8
https://hal.archives-ouvertes.fr/hal-03236593
https://hal.archives-ouvertes.fr/hal-03236593
Autor:
Sergei Kiselev, Ludmila Krátká
Publikováno v:
METAL 2021 Conference Proeedings.
Publikováno v:
International Journal of Simulation and Process Modelling. 18:1
Autor:
Sergei Kiselev, N. M. Derevyanko
Publikováno v:
Problems of Information Transmission. 53:307-318
The distance graph G(n, 2, 1) is a graph where vertices are identified with twoelement subsets of {1, 2,..., n}, and two vertices are connected by an edge whenever the corresponding subsets have exactly one common element. A random subgraph G p (n, 2