TY - JOUR

T1 - Universal sequences for complete graphs

AU - Alon, N.

AU - Azar, Y.

AU - Ravid, Y.

PY - 1990/5

Y1 - 1990/5

N2 - An n-labeled complete digraph G is a complete digraph with n+1 vertices and n(n+1) edges labeled {1,2,...,n}* such that there is a unique edge of each label emanating from each vertex. A sequence S in {1,2,...,n}*: and a starting vertex of G define a unique walk in G, in the obvious way. Suppose S is a sequence such that for each such G and each starting point in it, the corresponding walk contains all the vertices of G. We show that the length of S is at least Ω(n2), improving a previously known Ω(nlog2n/log logn) lower bound of Bar-Noy, Borodin, Karchmer, Linial and Werman.

AB - An n-labeled complete digraph G is a complete digraph with n+1 vertices and n(n+1) edges labeled {1,2,...,n}* such that there is a unique edge of each label emanating from each vertex. A sequence S in {1,2,...,n}*: and a starting vertex of G define a unique walk in G, in the obvious way. Suppose S is a sequence such that for each such G and each starting point in it, the corresponding walk contains all the vertices of G. We show that the length of S is at least Ω(n2), improving a previously known Ω(nlog2n/log logn) lower bound of Bar-Noy, Borodin, Karchmer, Linial and Werman.

UR - http://www.scopus.com/inward/record.url?scp=0004003895&partnerID=8YFLogxK

U2 - 10.1016/0166-218X(90)90125-V

DO - 10.1016/0166-218X(90)90125-V

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0004003895

SN - 0166-218X

VL - 27

SP - 25

EP - 28

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 1-2

ER -