492 search results - page 79 / 99 » combinatorics 2006 |
COMBINATORICS
2006
14 years 9 months ago
2006
The group PGL(2, q), q = pn, p an odd prime, is 3-transitive on the projective line and therefore it can be used to construct 3-designs. In this paper, we determine the sizes of o...
COMBINATORICS
2006
14 years 9 months ago
2006
Abstract. The geometric thickness of a graph G is the minimum integer k such that there is a straight line drawing of G with its edge set partitioned into k plane subgraphs. Eppste...
COMBINATORICS
2006
14 years 9 months ago
2006
A "hybrid method", dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux's method and singulari...
COMBINATORICS
2006
14 years 9 months ago
2006
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....
COMBINATORICS
2006
14 years 9 months ago
2006
In this paper, we consider matchings avoiding partial patterns 1123 and 1132. We give a bijection between 1123-avoiding matchings with n edges and nonnegative lattice paths from (...