Sciweavers

492 search results - page 44 / 99
» combinatorics 2006
Sort
View
COMBINATORICS
1998
102views more  COMBINATORICS 1998»
14 years 9 months ago
Inclusion-Exclusion and Network Reliability
Based on a recent improvement of the inclusion-exclusion principle, we present a new approach to network reliability problems. In particular, we give a new proof of a result of Sh...
Klaus Dohmen
COMBINATORICS
1998
66views more  COMBINATORICS 1998»
14 years 9 months ago
Some New Ramsey Colorings
New lower bounds for 15 classical Ramsey numbers are established. Several of the colorings are found using a new variation of local search heuristics. Several others are found usi...
Geoffrey Exoo
COMBINATORICS
1998
99views more  COMBINATORICS 1998»
14 years 9 months ago
On Minimal Words With Given Subword Complexity
We prove that the minimal length of a word Sn having the property that it contains exactly Fm+2 distinct subwords of length m for 1 ≤ m ≤ n is Fn + Fn+2. Here Fn is the nth Fi...
Ming-wei Wang, Jeffrey Shallit
COMBINATORICS
1999
83views more  COMBINATORICS 1999»
14 years 9 months ago
Discrepancy of Matrices of Zeros and Ones
Let m and n be positive integers, and let R = (r1, . . . , rm) and S = (s1, . . . , sn) be non-negative integral vectors. Let A(R, S) be the set of all m
Richard A. Brualdi, Jian Shen
COMBINATORICS
1999
76views more  COMBINATORICS 1999»
14 years 9 months ago
Rhombus Tilings of a Hexagon with Two Triangles Missing on the Symmetry Axis
We compute the number of rhombus tilings of a hexagon with sides n, n, N, n, n, N, where two triangles on the symmetry axis touching in one vertex are removed. The case of the comm...
Theresia Eisenkölbl