48 search results - page 5 / 10 » ejc 2006 |
EJC
2006
13 years 9 months ago
2006
The general symplectic graph Sp(2, q) is introduced. It is shown that Sp(2, q) is strongly regular. Its parameters are computed, its chromatic number and group of graph automorphis...
EJC
2006
13 years 9 months ago
2006
Abstract. We show that the tree-width of a graph can be defined without reference to graph vertices, and hence the notion of tree-width can be naturally extended to matroids. (This...
EJC
2006
13 years 9 months ago
2006
: Two transformations are constructed that map the permutation group onto a well-defined subset of a partially commutative monoid generated by the so-called oiseaux. Those transfor...
EJC
2006
13 years 9 months ago
2006
Let g(n, r) be the maximum possible cardinality of a family F of subsets of {1, 2, . . . , n} so that given a union of at most r members of F, one can identify at least one of the...
EJC
2006
13 years 9 months ago
2006
Abstract. We start with a bijective proof of Schur's theorem due to Alladi and Gordon and describe how a particular iteration of it leads to some very general theorems on colo...