2 problems
Let be the complete symmetric digraph on vertices. Write for its distinguishing proper arc-colouring number…
Sharpness conjecture. For every natural number greater than three there exists a connected infinite locally finite graph such that