An edge ordering of a graph
is an injection
,
where is the set of positive
integers. A path in
for
which the edge ordering
increases along its edge sequence is called an
-ascent; an
-ascent is maximal if it is not
contained in a longer
-ascent.
The depression
of
is the smallest
integer such that
any edge ordering
has
a maximal
-ascent
of length at most .
Applying the concept of ascents to edge colourings rather than edge
orderings, we consider the problem of determining the minimum
number of colours
required to edge colour
,
,
such that the length of a shortest maximal ascent is equal to
. We obtain new upper and
lower bounds for
, which
enable us to determine
exactly for
and
and
to bound
by
.
Keywords
edge ordering of a graph, increasing path, depression, edge
colouring