Zobrazeno 1 - 10
of 106
pro vyhledávání: '"János Körner"'
Autor:
Imre Csiszár, János Körner
Csiszár and Körner's book is widely regarded as a classic in the field of information theory, providing deep insights and expert treatment of the key theoretical issues. It includes in-depth coverage of the mathematics of reliable information trans
Autor:
Gilles Zémor, Gyula O. H. Katona, János Körner, Andrew McGregor, Ryan Gabrys, Sihem Mesnager, Olgica Milenkovic, Lara Dolecek, Alexander Barg
Publikováno v:
IEEE Transactions on Information Theory. 67:3187-3189
There are few mathematicians whose contributions go beyond named conjectures and theorems: Vladimir Iosifovich Levenshtein ( , 1935–2017) is one such true exception. During the five decades of his active research career, he enriched combinatorics,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::70a332d099266a695590f87af1d03112
https://doi.org/10.1109/tit.2021.3072555
https://doi.org/10.1109/tit.2021.3072555
Publikováno v:
ISIT
A structured code that improves the previously best known exponential asymptotic lower bound for the maximum cardinality of a pairwise-colliding set of permutations is presented. The main contribution is an explicit construction of an infinite recurs
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a9c3d11876165c9492e1a5f2e614ee73
https://doi.org/10.1109/isit.2019.8849602
https://doi.org/10.1109/isit.2019.8849602
Publikováno v:
Journal of Graph Theory. 85:107-114
Two Hamilton paths in Kn are separated by a cycle of length k if their union contains such a cycle. For k=4 we bound the asymptotics of the maximum cardinality of a family of Hamilton paths in Kn such that any pair of paths in the family is separated
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a88530319ffd701af8b285110745cede
https://doi.org/10.1002/jgt.22050
https://doi.org/10.1002/jgt.22050
Autor:
Emanuela Fachini, János Körner
Publikováno v:
Journal of Combinatorial Theory, Series A. 173:105231
Two permutations of the natural numbers diverge if the absolute value of the difference of their elements in the same position goes to infinity. We show that there exists an infinite number of pairwise divergent permutations of the naturals. We relat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3879d1ec71b7b22aac7153c9bb2a88f3
https://doi.org/10.1016/j.jcta.2020.105231
https://doi.org/10.1016/j.jcta.2020.105231
Autor:
Emanuela Fachini, János Körner
We determine the asymptotics of the largest cardinality of a set of Hamilton paths in the complete graph with vertex set $[n]$ under the condition that for any two of the paths in the family there is a subpath of length $k$ entirely contained in only
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c5fd9357ab2883405e942776c709ee77
http://hdl.handle.net/11573/1064800
http://hdl.handle.net/11573/1064800
Publikováno v:
ENDM
ENDM, 2013, 44, pp.23-29
ENDM, 2013, 44, pp.23-29
Let Gk,n be the family of all graphs on the same n vertices each having at least k connected components. We are interested in the largest cardinality of a subfamily in which the union of any two of the member graphs has at most k−2 connected compon
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6082ca954acc360977a06183afc03239
https://doi.org/10.1016/j.endm.2013.10.005
https://doi.org/10.1016/j.endm.2013.10.005
Publikováno v:
Electronic Notes in Discrete Mathematics. 38:529-533
Let D ⊆ N be an arbitrary subset of the natural numbers. For every n , let M ( n , D ) be the maximum of the cardinality of a set of Hamiltonian paths in the complete graph K n such that the union of any two paths from the family contains a not nec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9a5ec64f32535f5b90ce12326e4e2e78
https://doi.org/10.1016/j.endm.2011.09.086
https://doi.org/10.1016/j.endm.2011.09.086
Autor:
Gábor Simonyi, Emanuela Fachini, Ágnes Tóth, Marianne Fairthorne, János Körner, Gérard D. Cohen, Graham Brightwell
Publikováno v:
Electronic Notes in Discrete Mathematics. 38:195-199
The notion of permutation capacities is motivated by and shows similarities with the Shannon capacity of graphs and its generalization to directed graphs called Sperner capacity. We show that families of oriented paths have a different behaviour with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::156d5468142f707003be5472fbfa732a
https://doi.org/10.1016/j.endm.2011.09.033
https://doi.org/10.1016/j.endm.2011.09.033
Autor:
János Körner, Emanuela Fachini
Publikováno v:
Graphs and Combinatorics. 27:495-503
We show that the maximum number of ternary sequences of length n such that no two of them feature all the three symbol pairs in their coordinates is 2(n+o(n)). In fact, we present a far more general theorem about problems of a similar nature. We expl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f706d7c45ff2e06fe4e04b6ea89d2999
https://doi.org/10.1007/s00373-010-0987-9
https://doi.org/10.1007/s00373-010-0987-9