Zobrazeno 1 - 10
of 33
pro vyhledávání: '"Emanuela Fachini"'
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
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
Autor:
Gábor Simonyi, Graham Brightwell, Emanuela Fachini, Ágnes Tóth, Marianne Fairthorne, Gérard D. Cohen, János Körner
Publikováno v:
SIAM Journal on Discrete Mathematics. 24:441-456
Korner and Malvenuto asked whether one can find $\binom{n}{\lfloor n/2\rfloor}$ linear orderings (i.e., permutations) of the first $n$ natural numbers such that any pair of them places two consecutive integers somewhere in the same position. This led
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e37312778b1be245b38adb17f34d8b07
https://doi.org/10.1137/090765407
https://doi.org/10.1137/090765407
Publikováno v:
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2016, 62, pp.3-7
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2016, 62, pp.3-7
We begin a systematic study of the problem of the zero--error capacity of noisy binary channels with memory and solve some of the non--trivial cases.
Comment: 10 pages. This paper is the revised version of our previous paper having the same titl
Comment: 10 pages. This paper is the revised version of our previous paper having the same titl
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::01df9a22c4621d8e6d2a8f62078bcf47
http://arxiv.org/abs/1402.0349
http://arxiv.org/abs/1402.0349
For every pair of fixed natural numbers k > l we consider families of subgraphs of the complete graph K n such that each graph in the family has at least k connected components while the union of any two has at most l. We show that the cardinality of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bcb721ad23fc85cf568dabecdd6adc55
http://hdl.handle.net/11573/523194
http://hdl.handle.net/11573/523194
Autor:
János Körner, Emanuela Fachini
Publikováno v:
Combinatorics, Probability and Computing. 10:501-504
We strengthen the Cohen–Körner–Simonyi upper bound on counting ‘very different sequences’.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b38718ae89ca59c72996ce5f0ddd7043
https://doi.org/10.1017/s0963548301004783
https://doi.org/10.1017/s0963548301004783