共查询到20条相似文献,搜索用时 93 毫秒
1.
假设c是一个小于1/1152的常数,证明:对于每个充分大的偶数n,如果一个具有n个顶点的3一致完全超图的边着色满足每种颜色出现的次数不超过[cn],那么必含有一个每条边颜色都不一样的彩色哈密顿圈。 相似文献
2.
苗正科 《数学物理学报(A辑)》2004,24(3):381-384
设H是一个超图, 用H\+*和L(H)分别表示H的对偶超图和线图. 定义H的邻接图是由L(H\+*)和H的所有环组成的图, 记作G\-H. 若G\-H是本原的, 则称H是本原的, 并称γ(G\-H)为H的指数. 该文得到了所有n阶本原简单超图以及所有秩不小于3的n阶本原简单超图的指数集, 并分别刻划了其极超图. 相似文献
3.
几类图的匹配等价图类 总被引:1,自引:0,他引:1
魏岭 《数学的实践与认识》2011,41(17)
两个图G和H的匹配多项式相等,则称它们匹配等价.用[G]表示图G的所有不同构的匹配等价图的集合.刻画了匹配次大根小于1的图及这些图的补图的匹配等价图类. 相似文献
4.
5.
7.
8.
一类Caterpillars图的匹配刻画 总被引:1,自引:0,他引:1
申世昌 《纯粹数学与应用数学》2010,26(4):541-545
利用匹配多项式的性质以及匹配根的信息研究了图的匹配刻画问题,给出了一类Caterpillars图F(2,m,3)及补图匹配刻画的充分必要条件是m=2,5,8. 相似文献
9.
本文证明了下面的定理:若超图H=(X;E1,E2,...Em)中存在浓度为K长为m的圈,则有m∑i=1(│Ei│-k)>n-k。 相似文献
10.
11.
The Ryser Conjecture which states that there is a transversal of size in a Latin square of odd order is equivalent to finding a rainbow matching of size in a properly edge-colored using colors when is odd. Let be the minimum degree of a graph. Wang proposed a more general question to find a function such that every properly edge-colored graph of order contains a rainbow matching of size , which currently has the best bound of by Lo. Babu, Chandran and Vaidyanathan investigated Wang’s question under a stronger color condition. A strongly edge-colored graph is a properly edge-colored graph in which every monochromatic subgraph is an induced matching. Wang, Yan and Yu proved that every strongly edge-colored graph of order at least has a rainbow matching of size . In this note, we extend this result to graphs of order at least . 相似文献
12.
《Random Structures and Algorithms》2018,52(3):367-378
We introduce a new procedure for generating the binomial random graph/hypergraph models, referred to as online sprinkling. As an illustrative application of this method, we show that for any fixed integer , the binomial ‐uniform random hypergraph contains edge‐disjoint perfect matchings, provided , where is an integer depending only on . Our result for is asymptotically optimal and for is optimal up to the factor. This significantly improves a result of Frieze and Krivelevich. 相似文献
13.
Let G be a properly edge-colored graph. A rainbow matching of G is a matching in which no two edges have the same color. Let δ denote the minimum degree of G. We show that if |V(G)| > (δ
2 + 14δ + 1)/4, then G has a rainbow matching of size δ, which answers a question asked by G. Wang [Electron. J. Combin., 2011, 18: #N162] affirmatively. In addition, we prove that
if G is a properly colored bipartite graph with bipartition (X, Y) and max{|X|, |Y|} > (δ
2 + 4δ − 4)/4, then G has a rainbow matching of size δ. 相似文献
14.
《Journal of Graph Theory》2018,88(2):284-293
For a hypergraph H, let denote the minimum vertex degree in H. Kühn, Osthus, and Treglown proved that, for any sufficiently large integer n with , if H is a 3‐uniform hypergraph with order n and then H has a perfect matching, and this bound on is best possible. In this article, we show that under the same conditions, H contains at least pairwise disjoint perfect matchings, and this bound is sharp. 相似文献
15.
We show the existence of rainbow perfect matchings in μn‐bounded edge colorings of Dirac bipartite graphs, for a sufficiently small μ > 0. As an application of our results, we obtain several results on the existence of rainbow k‐factors in Dirac graphs and rainbow spanning subgraphs of bounded maximum degree on graphs with large minimum degree. 相似文献
16.
A graph is matching-covered if every edge of is contained in a perfect matching. A matching-covered graph is strongly coverable if, for any edge of , the subgraph is still matching-covered. An edge subset of a matching-covered graph is feasible if there exist two perfect matchings and such that , and an edge subset with at least two edges is an equivalent set if a perfect matching of contains either all edges in or none of them. A strongly matchable graph does not have an equivalent set, and any two independent edges of form a feasible set. In this paper, we show that for every integer , there exist infinitely many -regular graphs of class 1 with an arbitrarily large equivalent set that is not switching-equivalent to either or , which provides a negative answer to a problem of Lukot’ka and Rollová. For a matching-covered bipartite graph , we show that has an equivalent set if and only if it has a 2-edge-cut that separates into two balanced subgraphs, and is strongly coverable if and only if every edge-cut separating into two balanced subgraphs and satisfies and . 相似文献
17.
Given a graph G and a subgraph H of G, let rb(G,H) be the minimum number r for which any edge-coloring of G with r colors has a rainbow subgraph H. The number rb(G,H) is called the rainbow number of H with respect to G. Denote as mK2 a matching of size m and as Bn,k the set of all the k-regular bipartite graphs with bipartition (X,Y) such that X=Y=n and k≤n. Let k,m,n be given positive integers, where k≥3, m≥2 and n>3(m−1). We show that for every GBn,k, rb(G,mK2)=k(m−2)+2. We also determine the rainbow numbers of matchings in paths and cycles. 相似文献
18.
The rainbow number for the graph in is defined to be the minimum integer such that any -edge-coloring of contains a rainbow . As one of the most important structures in graphs, the rainbow number of matchings has drawn much attention and has been extensively studied. Jendrol et al. initiated the rainbow number of matchings in planar graphs and they obtained bounds for the rainbow number of the matching in the plane triangulations, where the gap between the lower and upper bounds is . In this paper, we show that the rainbow number of the matching in maximal outerplanar graphs of order is . Using this technique, we show that the rainbow number of the matching in some subfamilies of plane triangulations of order is . The gaps between our lower and upper bounds are only . 相似文献
19.
Let be the class of edge intersection graphs of linear 3-uniform hypergraphs. It is known that the problem of recognition of the class is NP-complete. We prove that this problem is polynomially solvable in the class of graphs with minimum vertex degree ≥10. It is also proved that the class is characterized by a finite list of forbidden induced subgraphs in the class of graphs with minimum vertex degree ≥16. 相似文献
20.
Louis Esperet František Kardoš Andrew D. King Daniel Král? Serguei Norine 《Advances in Mathematics》2011,227(4):815
We show that every cubic bridgeless graph G has at least 2|V(G)|/3656 perfect matchings. This confirms an old conjecture of Lovász and Plummer. 相似文献