We prove that there is no cubic graph with diameter 4 on 40 vertices. This implies that the maximal number of vertices of a (3,4)-graph is 38. ? 2000 Elsevier Science B.V. All rig...
We investigate the e ect on primitive words of point mutations (inserting or deleting symbols, substituting a symbol for another one), of morphisms, and of the operation of taking...
Gheorghe Paun, Nicolae Santean, Gabriel Thierrin, ...
Whereas Stanley, Proctor and others studied Sperner properties of the poset L(k; m) we consider shadows of left-compressed sets and derive asymptotic bounds on their sizes. ? 1999...
The maximum number of edges spanned by a subset of given diameter in a Hamming space with alphabet size at least three is determined. The binary case was solved earlier by Ahlswed...
This paper presents an algebraic formalism for reasoning on finite increasing sequences over Boolean algebras in general and on generalizations of Rough Set concepts in particular...