COMBINATORICS
2007
13 years 11 months ago
2007
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...
COMBINATORICS
2007
13 years 11 months ago
2007
COMBINATORICS
2007
13 years 11 months ago
2007
We consider the finite binary words Z(n), n ∈ N, defined by the following selfsimilar process: Z(0) := 0, Z(1) := 01, and Z(n + 1) := Z(n) · Z(n − 1), where the dot · deno...
COMBINATORICS
2007
13 years 11 months ago
2007
A simple 2-matching in a graph is a subgraph all of whose nodes have degree 1 or 2. A simple 2-matching is called k-restricted if every connected component has > k edges. We co...
COMBINATORICS
2007
13 years 11 months ago
2007
In this paper, we study the flexibility of embeddings of bouquets of circles on the projective plane and the Klein bottle. The numbers (of equivalence classes) of embeddings of b...