理学 >>> 数学 信息科学与系统科学 物理学 化学 天文学 地球科学总论 大气科学 地球物理学 地理学 地质学 水文学 海洋科学 生物学 科学技术史
搜索结果: 1-15 共查到理学 Matchings相关记录19条 . 查询时间(0.125 秒)
Matchings are fundamental objects in the study of graph theory. Unlike in graphs, finding maximum matchings in general hypergraphs is NP-hard -- its decision problem is actually one of the Karp’s 21 N...
Matchings and phylogenetic trees。
We give sharp rates of convergence for a natural Markov chain on the space of phylogenetic trees and dually for the natural random walk on the set of perfect matchings in the complete graph on 2n vert...
We prove that the Mahonian-Stirling pairs of permutation statistics $(\sor, \cyc)$ and $(\inv, \mathrm{rlmin})$ are equidistributed on the set of permutations that correspond to arrangements of $n$ no...
We obtain the generating functions for partial matchings avoiding neighbor alignments and for partial matchings avoiding neighbor alignments and left nestings. We show that there is a bijection betwee...
Motivated by the question of finding a type B analogue of the bijection between oscillating tableaux and matchings, we find a correspondence between oscillating m-rim hook tableaux and m-colored match...
Abstract: We show how to construct homology bases for certain CW complexes in terms of discrete Morse theory and cellular homology. We apply this technique to study certain subcomplexes of the half cu...
Abstract: We study the following problem - How many arbitrary edges can be removed from a complete geometric graph with 2n vertices such that the resulting graph always contains a perfect non-crossing...
Abstract: In this paper we study conditions which guarantee the existence of perfect matchings and perfect fractional matchings in uniform hypergraphs. We reduce this problem to an old conjecture by E...
We show that every cubic bridgeless graph G has at least 2|V (G)|/3656 perfect matchings. This confirms an old conjecture of Lov´asz and Plummer.
The lattice polynomials $L_{i,j}(x)$ are introduced by Hough and Shapiro as a weighted count of certain lattice paths from the origin to the point $(i,j)$. In particular, $L_{2n, n}(x)$ reduces to th...
Given non-negative weights wS on the k-subsets S of a km-element set V , we consider the sum of the products wS1 · · ·wSm over all partitions V =S1 [ . . . [ Sm into pairwise disjoint k-subsets Si.
Let the chromatic index of a hypergraph be the smallest number of colours needed to colour the edges such that similarly-coloured edges are disjoint. Likewise, let the cover index be the maximum numb...
Consider the family of all perfect matchings of the complete graph K2n with 2n vertices.Given any collection M of perfect matchings of size s, there exists a maximum number f(n; x) such that if s  f(...
We show how co-chordal covers of the edges of a graph give upper bounds on the Castelnuovo-Mumford regularity of its edge ideal. The proof is by an easy application of a deep result of Kalai and Mesh...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...