365 search results - page 29 / 73 » On the combinatorics of Galois numbers |
117
click to vote
COCOON
2007
Springer
15 years 6 months ago
2007
Springer
We investigate the maximum number of simple cycles and the maximum number of Hamiltonian cycles in a planar graph G with n vertices. Using the transfer matrix method we construct a...
103
click to vote
IANDC
2007
14 years 11 months ago
2007
We study words on a finite alphabet avoiding a finite collection of patterns. Given a pattern p in which every letter that occurs in p occurs at least twice, we show that the nu...
COMBINATORICS
2006
14 years 12 months ago
2006
A biclique is a complete bipartite subgraph of a graph. This paper investigates the fractional biclique cover number, bc(G), and the fractional biclique partition number, bp(G), o...
COMBINATORICS
2006
14 years 12 months ago
2006
In this paper we study inversions within restricted fillings of Young tableaux. These restricted fillings are of interest because they describe geometric properties of certain sub...
COMBINATORICS
2006
14 years 12 months ago
2006
We consider a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compos...