I'm doing a project on graph theory and my problem is the following:
$K = \{\{x_0,x_1\},\{x_1,x_2\},\cdots,\{x_{n-1},x_n\}\}$
I now want to express, mathematically, the following:
"There exist an ordered list P, which contains all distinct elements of set K"
That is:
$P = (x_0,x_1,\cdots,x_{n-1},x_n)$
so P is not really a set, but rather an ordered list.
Example of what I'm trying to do would be:
$\require{cancel} \cancel{\forall K_i\in K:P \cup K_i|x_i\in K_i}$