Solution to a BCC 2022 problem

Abstract: For positive integers

n

and

k

such that

k

is at most

n

, we find an explicit one-to-one correspondence between the following two sets: the set of words consisting of

k

R

s,

k

U

s, and

n - k

D

s, where the first letter of the word is not

D

; and the set of subgraphs

H

of a cycle of length

2 n

(where that cycle has differently labelled vertices) such that

H

has

n

edges and

k

connected components. This solves a problem of Thomas Selig from the 29th British Combinatorial Conference held at Lancaster University in July 2022.

This page was built for publication: Solution to a BCC 2022 problem