Sciweavers

1215 search results - page 105 / 243
» Combinatorics
Sort
View
97
Voted
COMBINATORICS
2006
105views more  COMBINATORICS 2006»
15 years 3 months ago
Matchings Avoiding Partial Patterns
We show that matchings avoiding certain partial patterns are counted by the 3-Catalan numbers. We give a characterization of 12312-avoiding matchings in terms of restrictions on t...
William Y. C. Chen, Toufik Mansour, Sherry H. F. Y...
COMBINATORICS
2006
102views more  COMBINATORICS 2006»
15 years 3 months ago
Identifying X-Trees with Few Characters
Previous work has shown the perhaps surprising result that, for any binary phylogenetic tree T , there is a set of four characters that define T . Here we deal with the general ca...
Magnus Bordewich, Charles Semple, Mike A. Steel
125
Voted
COMBINATORICS
2006
88views more  COMBINATORICS 2006»
15 years 3 months ago
Tilings of the Sphere with Right Triangles I: The Asymptotically Right Families
Sommerville [10] and Davies [2] classified the spherical triangles that can tile the sphere in an edge-to-edge fashion. Relaxing this condition yields other triangles, which tile ...
Robert J. MacG. Dawson, Blair Doyle
COMBINATORICS
2006
92views more  COMBINATORICS 2006»
15 years 3 months ago
Equitable Matroids
One way to choose a basis of a matroid at random is to choose an ordering of the ground set uniformly at random and then use the greedy algorithm to find a basis. We investigate t...
Dillon Mayhew
COMBINATORICS
2006
153views more  COMBINATORICS 2006»
15 years 3 months ago
The Absence of Efficient Dual Pairs of Spanning Trees in Planar Graphs
A spanning tree T in a finite planar connected graph G determines a dual spanning tree T in the dual graph G such that T and T do not intersect. We show that it is not always poss...
T. R. Riley, William P. Thurston