Sciweavers

492 search results - page 35 / 99
» combinatorics 2006
Sort
View
COMBINATORICS
2006
128views more  COMBINATORICS 2006»
14 years 9 months ago
On Lengths of Rainbow Cycles
We prove several results regarding edge-colored complete graphs and rainbow cycles, cycles with no color appearing on more than one edge. We settle a question posed by Ball, Pultr...
Boris Alexeev
COMBINATORICS
2006
110views more  COMBINATORICS 2006»
14 years 9 months ago
Jamming and Geometric Representations of Graphs
We expose a relationship between jamming and a generalization of Tutte's barycentric embedding. This provides a basis for the systematic treatment of jamming and maximal packi...
Werner Krauth, Martin Loebl
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
14 years 9 months ago
Plethysm for Wreath Products and Homology of Sub-Posets of Dowling Lattices
We prove analogues for sub-posets of the Dowling lattices of the results of Calderbank, Hanlon, and Robinson on homology of sub-posets of the partition lattices. The technical too...
Anthony Henderson
COMBINATORICS
2006
141views more  COMBINATORICS 2006»
14 years 9 months ago
Binary Words Containing Infinitely Many Overlaps
We characterize the squares occurring in infinite overlap-free binary words and construct various power-free binary words containing infinitely many overlaps.
James D. Currie, Narad Rampersad, Jeffrey Shallit
COMBINATORICS
1998
76views more  COMBINATORICS 1998»
14 years 9 months ago
An Exploration of the Permanent-Determinant Method
The permanent-determinant method and its generalization, the HafnianPfaffian method, are methods to enumerate perfect matchings of plane graphs that were discovered by P. W. Kaste...
Greg Kuperberg