3 citations · 3 across the 2 of their papers we have counts for
4 papers
A generalization of Witsenhausen's zero-error rate for directed graphs
Gábor Simonyi, Ágnes Tóth
We investigate a communication setup where a source output is sent through a free noisy channel first and an additional codeword is sent through a noiseless but expensive channel l…
Around a biclique cover conjecture
G. Chen, S. Fujita, A. Gyarfas +2
We address an old (1977) conjecture of a subset of the authors (a variant of Ryser's conjecture): in every r-coloring of the edges of a biclique [A,B] (complete bipartite graph), t…
Answer to a question of Alon and Lubetzky about the ultimate categorical independence ratio
Ágnes Tóth
Brown, Nowakowski and Rall defined the ultimate categorical independence ratio of a graph G as A(G)=\lim_{k\to \infty} i(G^{\times k}), where i(G)=\frac{α(G)}{|V(G)|} denotes the i…
Gallai colorings and domination in multipartite digraphs
András Gyárfás, Gábor Simonyi, Ágnes Tóth
Assume that D is a digraph without cyclic triangles and its vertices are partitioned into classes A_1,...,A_t of independent vertices. A set is called a domin…