Sciweavers

492 search results - page 42 / 99
» combinatorics 2006
Sort
View
COMBINATORICS
2002
107views more  COMBINATORICS 2002»
13 years 4 months ago
Combinatorial Laplacian of the Matching Complex
A striking result of Bouc gives the decomposition of the representation of the symmetric group on the homology of the matching complex into irreducibles that are self-conjugate. We...
Xun Dong, Michelle L. Wachs
COMBINATORICS
2002
136views more  COMBINATORICS 2002»
13 years 4 months ago
Minimum Connected Dominating Sets of Random Cubic Graphs
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
William Duckworth
COMBINATORICS
2002
65views more  COMBINATORICS 2002»
13 years 4 months ago
Thue-like Sequences and Rainbow Arithmetic Progressions
A sequence u = u1u2...un is said to be nonrepetitive if no two adjacent blocks of u are exactly the same. For instance, the sequence abcbcba contains a repetition bcbc, while abca...
Jaroslaw Grytczuk
COMBINATORICS
2002
86views more  COMBINATORICS 2002»
13 years 4 months ago
On the Dimer Problem and the Ising Problem in Finite 3-dimensional Lattices
We present a new expression for the partition function of the dimer arrangements and the Ising partition function of the 3-dimensional cubic lattice. We use the Pfaffian method. T...
Martin Loebl
COMBINATORICS
2002
85views more  COMBINATORICS 2002»
13 years 4 months ago
Sum List Coloring 2*n Arrays
A graph is f-choosable if for every collection of lists with list sizes specified by f there is a proper coloring using colors from the lists. The sum choice number is the minimum...
Garth Isaak