DM
2006
13 years 4 months ago
2006
Berge's conjecture from 1982 on path partitions in directed graphs generalizes and extends Dilworth's Theorem and the Greene-Kleitman Theorem which are well known for pa...
DM
2006
13 years 4 months ago
2006
DM
2006
13 years 4 months ago
2006
For a graph G and k a real number, we consider the sum of the k-th powers of the degrees of the vertices of G. We present some general bounds on this sum for various values of k. ...
DM
2006
13 years 4 months ago
2006
In this paper it is shown that every m
DM
2006
13 years 4 months ago
2006
Within a large family of crossover designs this paper characterizes the mathematical structures of A-optimal and A-efficient crossover designs for the purpose of statistical compa...
DM
2006
13 years 4 months ago
2006
We answer a question raised by Brass on the number of maximally repeated sub-patterns in a set of n points in Rd. We show that this number, which was conjectured to be polynomial,...
DM
2006
13 years 4 months ago
2006
The class composition C K of Boolean clones, being the set of composite functions f(g1, . . . , gn) with f C, g1, . . . , gn K, is investigated. This composition C K is either...
DM
2006
13 years 4 months ago
2006
We conjecture new sufficient conditions for a digraph to have a Hamilton cycle. In view of applications, the conjecture is of interest in the areas where unitary matrices are of i...
DM
2006
13 years 4 months ago
2006
DM
2006
13 years 4 months ago
2006
In 1983, Patterson and Wiedemann constructed Boolean functions on n = 15 input variables having nonlinearity strictly greater than 2n-1 -2 n-1 2 . Construction of Boolean function...