Sciweavers

547 search results - page 82 / 110
» dm 2008
Sort
View
68
Voted
DM
2006
63views more  DM 2006»
15 years 24 days ago
Efficient crossover designs for comparing test treatments with a control treatment
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...
A. Sadam Hedayat, Min Yang
77
Voted
DM
2006
79views more  DM 2006»
15 years 24 days ago
Conditional colorings of graphs
For an integer r > 0, a conditional (k, r)-coloring of a graph G is a proper k-coloring of the vertices of G such that every vertex of degree at least r in G will be adjacent t...
Hong-Jian Lai, Jianliang Lin, Bruce Montgomery, Ta...
98
Voted
DM
2006
86views more  DM 2006»
15 years 24 days ago
Minimal rankings and the arank number of a path
Given a graph G, a function f : V (G) {1, 2, . . . , k} is a k-ranking of G if f (u) = f (v) implies every u - v path contains a vertex w such that f (w) > f (u). A k-ranking ...
Victor Kostyuk, Darren A. Narayan, Victoria A. Wil...
DM
2006
91views more  DM 2006»
15 years 24 days ago
Restricted Dumont permutations, Dyck paths, and noncrossing partitions
We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some ...
Alexander Burstein, Sergi Elizalde, Toufik Mansour
DM
2006
89views more  DM 2006»
15 years 24 days ago
On set systems with a threshold property
For n, k and t such that 1 < t < k < n, a set F of subsets of [n] has the (k, t)threshold property if every k-subset of [n] contains at least t sets from F and every (k -...
Zoltán Füredi, Robert H. Sloan, Ken Ta...