1215 search results - page 114 / 243 » Combinatorics |
90
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
An H-factor of a graph G is a spanning subgraph of G whose connected components are isomorphic to H. Given a properly edge-colored graph G, a rainbow H-subgraph of G is an H-subgr...
114
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
Let N be a nilpotent group normal in a group G. Suppose that G acts transitively upon the points of a finite non-Desarguesian projective plane P. We prove that, if P has square or...
103
click to vote
COMBINATORICS
2006
15 years 3 months ago
2006
We prove that the minimum number of distinct hamiltonian paths in a strong tournament of order n is 5 n-1 3 . A known construction shows this number is best possible when n 1 mod...
116
Voted
COMBINATORICS
2006
15 years 3 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...
121
Voted
COMBINATORICS
2006
15 years 3 months ago
2006
In two dimensions, a polyform is a finite set of edge-connected cells on a square, triangular, or hexagonal grid. A layer is the set of grid cells that are vertex-adjacent to the ...