搜索结果: 1-6 共查到“组合数学 Three”相关记录6条 . 查询时间(0.092 秒)
Blocking Sets of Index Three
Redei Blocking Sets Projective Triangle Projective Triad Combinatorics
2012/6/15
In this note we will provide proofs for the various statements that have been made in the literature about blocking sets of index three. Our aim is to clarify what is known about the characterization ...
Normality of the three-state toric homogeneous Markov chain model
Markov bases toric homogeneous Markov chains polyhedrons semigroups
2012/4/16
Markov chain models had proved to be useful tools in many fields, such as physic, chemistry, information sciences, economics, finances, mathematical biology, social sciences, and statistics for analyz...
On a Greedy 2-Matching Algorithm and Hamilton Cycles in Random Graphs with Minimum Degree at Least Three
Greedy 2-Matching Algorithm Hamilton Cycles Random Graphs Minimum Degree
2011/9/20
Abstract: We describe and analyse a simple greedy algorithm \2G\ that finds a good 2-matching $M$ in the random graph $G=G_{n,cn}^{\d\geq 3}$ when $c\geq 15$. A 2-matching is a spanning subgraph of ma...
On a sparse random graph with minimum degree {three}: Likely Posa's sets are large
random sparse graphs degrees longest path Posa sets
2011/9/20
Abstract: We consider the likely size of the endpoint sets produced by Posa rotations, when applied to a longest path in a random graph with $cn,\,c\geq 2.7$ edges that is conditioned to have minimum ...
On the enumeration of three-rowed standard Young tableaux of skew shape in terms of Motzkin numbers
three-rowed standard Young tableaux Combinatorics
2011/9/15
Abstract: The enumeration of standard Young tableaux (SYTs) of shape {\lambda} can be easily computed by the hook-length formula. In 1981, Amitai Regev proved that the number of SYTs having at most th...
Abstract: We show that the number of unit distances determined by n points in R^3 is O(n^{3/2}), slightly improving the bound of Clarkson et al. established in 1990. The new proof uses the recently in...