首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
3.
4.
5.
6.
《Discrete Mathematics》2021,344(12):112604
A well-known theorem of Vizing states that if G is a simple graph with maximum degree Δ, then the chromatic index χ(G) of G is Δ or Δ+1. A graph G is class 1 if χ(G)=Δ, and class 2 if χ(G)=Δ+1; G is Δ-critical if it is connected, class 2 and χ(Ge)<χ(G) for every eE(G). A long-standing conjecture of Vizing from 1968 states that every Δ-critical graph on n vertices has at least (n(Δ1)+3)/2 edges. We initiate the study of determining the minimum number of edges of class 1 graphs G, in addition, χ(G+e)=χ(G)+1 for every eE(G). Such graphs have intimate relation to (P3;k)-co-critical graphs, where a non-complete graph G is (P3;k)-co-critical if there exists a k-coloring of E(G) such that G does not contain a monochromatic copy of P3 but every k-coloring of E(G+e) contains a monochromatic copy of P3 for every eE(G). We use the bound on the size of the aforementioned class 1 graphs to study the minimum number of edges over all (P3;k)-co-critical graphs. We prove that if G is a (P3;k)-co-critical graph on nk+2 vertices, thene(G)k2(nk2ε)+(k/2+ε2), where ε is the remainder of nk/2 when divided by 2. This bound is best possible for all k1 and n3k/2+2.  相似文献   

7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
Let M be a random m×n rank-r matrix over the binary field F2, and let wt(M) be its Hamming weight, that is, the number of nonzero entries of M.We prove that, as m,n+ with r fixed and m/n tending to a constant, we have thatwt(M)12r2mn2r(12r)4(m+n)mn converges in distribution to a standard normal random variable.  相似文献   

18.
19.
20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号