Sciweavers

COMBINATORICS
2000
63views more  COMBINATORICS 2000»
13 years 4 months ago
Some Pairwise Balanced Designs
A pairwise balanced design, B(K; v), is a block design on v points, with block sizes taken from K, and with every pair of points occurring in a unique block; for a fixed K, B(K) i...
Malcolm Greig
COMBINATORICS
2000
81views more  COMBINATORICS 2000»
13 years 4 months ago
Interchangeability of Relevant Cycles in Graphs
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...
Petra M. Gleiss, Josef Leydold, Peter F. Stadler
COMBINATORICS
2000
92views more  COMBINATORICS 2000»
13 years 4 months ago
The Hamiltonian p-Median Problem
We deal, from a theoretical point of view, with the asymmetric Hamiltonian p
Holger Glaab, Alexander Pott
COMBINATORICS
2000
103views more  COMBINATORICS 2000»
13 years 4 months ago
The Action of the Symmetric Group on a Generalized Partition Semilattice
Given an integer n 2, and a non-negative integer k, consider all affine hyperplanes in Rn of the form xi = xj +r for i, j [n] and a non-negative integer r k. Let n,k be the pos...
Robert Gill
COMBINATORICS
2000
112views more  COMBINATORICS 2000»
13 years 4 months ago
A Note on Random Minimum Length Spanning Trees
Consider a connected r-regular n-vertex graph G with random independent edge lengths, each uniformly distributed on [0, 1]. Let mst(G) be the expected length of a minimum spanning...
Alan M. Frieze, Miklós Ruszinkó, Lub...
COMBINATORICS
2000
87views more  COMBINATORICS 2000»
13 years 4 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
COMBINATORICS
2000
138views more  COMBINATORICS 2000»
13 years 4 months ago
Quasi-Spectral Characterization of Strongly Distance-Regular Graphs
A graph with diameter d is strongly distance-regular if is distanceregular and its distance-d graph d is strongly regular. The known examples are all the connected strongly regu...
Miguel Angel Fiol
COMBINATORICS
2000
100views more  COMBINATORICS 2000»
13 years 4 months ago
Separability Number and Schurity Number of Coherent Configurations
To each coherent configuration (scheme) C and positive integer m we associate a natural scheme C(m) on the m-fold Cartesian product of the point set of C having the same automorph...
Sergei Evdokimov, Ilia N. Ponomarenko
COMBINATORICS
2000
71views more  COMBINATORICS 2000»
13 years 4 months ago
Diagonal Checker-jumping and Eulerian Numbers for Color-signed Permutations
Abstract. We introduce color-signed permutations to obtain a very explicit combinatorial interpretation of the q-Eulerian identities of Brenti and some generalizations. In particul...
Niklas Eriksen, Henrik Eriksson, Kimmo Eriksson
COMBINATORICS
2000
56views more  COMBINATORICS 2000»
13 years 4 months ago
Linear Discrepancy of Basic Totally Unimodular Matrices
We show that the linear discrepancy of a basic totally unimodular matrix A Rm
Benjamin Doerr