首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
《Discrete Mathematics》2022,345(8):112903
Graphs considered in this paper are finite, undirected and loopless, but we allow multiple edges. The point partition number χt(G) is the least integer k for which G admits a coloring with k colors such that each color class induces a (t?1)-degenerate subgraph of G. So χ1 is the chromatic number and χ2 is the point arboricity. The point partition number χt with t1 was introduced by Lick and White. A graph G is called χt-critical if every proper subgraph H of G satisfies χt(H)<χt(G). In this paper we prove that if G is a χt-critical graph whose order satisfies |G|2χt(G)?2, then G can be obtained from two non-empty disjoint subgraphs G1 and G2 by adding t edges between any pair u,v of vertices with uV(G1) and vV(G2). Based on this result we establish the minimum number of edges possible in a χt-critical graph G of order n and with χt(G)=k, provided that n2k?1 and t is even. For t=1 the corresponding two results were obtained in 1963 by Tibor Gallai.  相似文献   

3.
In this paper we provide the sharp conditions of the uniqueness for inverse nodal Sturm–Liouville problems defined on interval [0,1] with separated boundary conditions. We prove that the potential and boundary parameters can be uniquely determined by a dense nodal subset contained on [a1,a2](?[0,1]) with 1/2(a1,a2) through two cases of a1=0 and a1>0, where in the latter case the nodal subset also need to be paired. Note that, the dense nodal subset was required to be twin for both cases in the previous works.  相似文献   

4.
5.
6.
《Discrete Mathematics》2022,345(10):113004
Let G be a graph. We say that G is perfectly divisible if for each induced subgraph H of G, V(H) can be partitioned into A and B such that H[A] is perfect and ω(H[B])<ω(H). We use Pt and Ct to denote a path and a cycle on t vertices, respectively. For two disjoint graphs F1 and F2, we use F1F2 to denote the graph with vertex set V(F1)V(F2) and edge set E(F1)E(F2), and use F1+F2 to denote the graph with vertex set V(F1)V(F2) and edge set E(F1)E(F2){xy|xV(F1) and yV(F2)}. In this paper, we prove that (i) (P5,C5,K2,3)-free graphs are perfectly divisible, (ii) χ(G)2ω2(G)?ω(G)?3 if G is (P5,K2,3)-free with ω(G)2, (iii) χ(G)32(ω2(G)?ω(G)) if G is (P5,K1+2K2)-free, and (iv) χ(G)3ω(G)+11 if G is (P5,K1+(K1K3))-free.  相似文献   

7.
We give some arithmetic-geometric interpretations of the moments M2[a1], M1[a2], and M1[s2] of the Sato–Tate group of an abelian variety A defined over a number field by relating them to the ranks of the endomorphism ring and Néron–Severi group of A.  相似文献   

8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
In this paper, we study the existence and concentration behavior of minimizers for iV(c)=infuSc?IV(u), here Sc={uH1(RN)|RNV(x)|u|2<+,|u|2=c>0} and
IV(u)=12RN(a|?u|2+V(x)|u|2)+b4(RN|?u|2)2?1pRN|u|p,
where N=1,2,3 and a,b>0 are constants. By the Gagliardo–Nirenberg inequality, we get the sharp existence of global constraint minimizers of iV(c) for 2<p<2? when V(x)0, V(x)Lloc(RN) and lim|x|+?V(x)=+. For the case p(2,2N+8N)\{4}, we prove that the global constraint minimizers uc of iV(c) behave like
uc(x)c|Qp|2(mcc)N2Qp(mccx?zc),
for some zcRN when c is large, where Qp is, up to translations, the unique positive solution of ?N(p?2)4ΔQp+2N?p(N?2)4Qp=|Qp|p?2Qp in RN and mc=(a2D12?4bD2i0(c)+aD12bD2)12, D1=Np?2N?42N(p?2) and D2=2N+8?Np4N(p?2).  相似文献   

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

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