Sciweavers

1215 search results - page 85 / 243
» Combinatorics
Sort
View
115
Voted
COMBINATORICS
2000
87views more  COMBINATORICS 2000»
15 years 3 months ago
Symmetric Sum-Free Partitions and Lower Bounds for Schur Numbers
We give new lower bounds for the Schur numbers S(6) and S(7). This will imply new lower bounds for the Multicolor Ramsey Numbers R6(3) and R7(3). We also make several observations...
Harold Fredricksen, Melvin M. Sweet
122
Voted
COMBINATORICS
2000
120views more  COMBINATORICS 2000»
15 years 3 months ago
The Characteristic Polynomial of a Graph is Reconstructible from the Characteristic Polynomials of its Vertex-Deleted Subgraphs
The question of whether the characteristic polynomial of a simple graph is uniquely determined by the characteristic polynomials of its vertex-deleted subgraphs is one of the many...
Elias M. Hagos
118
Voted
COMBINATORICS
2000
91views more  COMBINATORICS 2000»
15 years 3 months ago
On Descents in Standard Young Tableaux
In this paper, explicit formulae for the expectation and the variance of descent functions on random standard Young tableaux are presented. Using these, it is shown that the norma...
Peter A. Hästö
COMBINATORICS
2000
91views more  COMBINATORICS 2000»
15 years 3 months ago
A Construction Method for Complete Sets of Mutually Orthogonal Frequency Squares
A construction is described for combining affine designs with complete sets of mutually orthogonal frequency squares to produce other complete sets. Key words: Matrices, orthogona...
Vassili C. Mavron
131
Voted
COMBINATORICS
2000
101views more  COMBINATORICS 2000»
15 years 3 months ago
Random Sampling of Labeled Tournaments
This note extends a recent result of Kannan, Tetali and Vempala to completely solve, via a simple proof, the problem of random generation of a labeled tournament with a given scor...
Lisa McShine