1 citations · 1 across the 7 of their papers we have counts for
8 papers
Structured Codes of Graphs
Noga Alon, Anna Gujgiczer, János Körner +2
We investigate the maximum size of graph families on a common vertex set of cardinality such that the symmetric difference of the edge sets of any two members of the family sat…
Divergent permutations
Emanuela Fachini, János Körner
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 infini…
Interlocked permutations
Gerard Cohen, Emanuela Fachini, Janos Korner
The zero-error capacity of channels with a countably infinite input alphabet formally generalises Shannon's classical problem about the capacity of discrete memoryless channels. We…
Degree-doubling graph families
János Körner, Irene Muzi
Let G be a family of n-vertex graphs of uniform degree 2 with the property that the union of any two member graphs has degree four. We determine the leading term in the asymptotics…
Families of graph-different Hamilton paths
János Körner, Silvia Messuti, Gábor Simonyi
Let D 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…
On the permutation capacity of digraphs
Gerard Cohen, Emanuela Fachini, Janos Korner
We extend several results of the third author and C. Malvenuto on graph-different permutations to the case of directed graphs and introduce new open problems. Permutation capacity…