178 search results - page 23 / 36 » combinatorics 2007 |
121
click to vote
COMBINATORICS
2007
15 years 3 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
110
click to vote
COMBINATORICS
2007
15 years 3 months ago
2007
A hypermap is (hypervertex-) bipartite if its hypervertices can be 2-coloured in such a way that “neighbouring” hypervertices have different colours. It is bipartiteuniform i...
123
click to vote
COMBINATORICS
2007
15 years 3 months ago
2007
We define a higher spin alternating sign matrix to be an integer-entry square matrix in which, for a nonnegative integer r, all complete row and column sums are r, and all partia...
132
click to vote
COMBINATORICS
2007
15 years 3 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...
101
click to vote
ACL
1990
15 years 4 months ago
1990
The principle known as 'free indexation' plays an important role in the determination of the referential properties of noun phrases in the principleand-parameters langua...