首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
《Discrete Mathematics》2022,345(7):112866
Let G be a graph with n vertices. A path decomposition of G is a set of edge-disjoint paths containing all the edges of G. Let p(G) denote the minimum number of paths needed in a path decomposition of G. Gallai Conjecture asserts that if G is connected, then p(G)?n/2?. If G is allowed to be disconnected, then the upper bound ?34n? for p(G) was obtained by Donald [7], which was improved to ?23n? independently by Dean and Kouider [6] and Yan [14]. For graphs consisting of vertex-disjoint triangles, ?23n? is reached and so this bound is tight. If triangles are forbidden in G, then p(G)?g+12gn? can be derived from the result of Harding and McGuinness [11], where g denotes the girth of G. In this paper, we also focus on triangle-free graphs and prove that p(G)?3n/5?, which improves the above result with g=4.  相似文献   

2.
3.
4.
《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.  相似文献   

5.
6.
7.
We consider a continuously differentiable curve t?γ(t) in the space of 2n×2n real symplectic matrices, which is the solution of the following ODE:
dγdt(t)=J2nA(t)γ(t),γ(0)Sp(2n,R),
where J=J2n=def[0Idn?Idn0] and A:t?A(t) is a continuous path in the space of 2n×2n real matrices which are symmetric. Under a certain convexity assumption (which includes the particular case that A(t) is strictly positive definite for all tR), we investigate the dynamics of the eigenvalues of γ(t) when t varies, which are closely related to the stability of such Hamiltonian dynamical systems. We rigorously prove the qualitative behavior of the branching of eigenvalues and explicitly give the first order asymptotics of the eigenvalues. This generalizes classical Krein–Lyubarskii theorem on the analytic bifurcation of the Floquet multipliers under a linear perturbation of the Hamiltonian. As a corollary, we give a rigorous proof of the following statement of Ekeland: {tR:γ(t) has a Krein indefinite eigenvalue of modulus 1} is a discrete set.  相似文献   

8.
In this paper, we propose a sufficient and necessary condition for the boundedness of all the solutions for the equation x¨+n2x+g(x)=p(t) with the critical situation that |02πp(t)e?intdt|=2|g(+)?g(?)| on g and p, where nN+, p(t) is periodic and g(x) is bounded.  相似文献   

9.
10.
11.
12.
This paper studies the asymptotic behavior of smooth solutions to the generalized Hall-magneto-hydrodynamics system (1.1) with one single diffusion on the whole space R3. We establish that, in the inviscid resistive case, the energy 6b(t)622 vanishes and 6u(t)622 converges to a constant as time tends to infinity provided the velocity is bounded in W1?α,3α(R3); in the viscous non-resistive case, the energy 6u(t)622 vanishes and 6b(t)622 converges to a constant provided the magnetic field is bounded in W1?β,(R3). In summary, one single diffusion, being as weak as (?Δ)αb or (?Δ)βu with small enough α,β, is sufficient to prevent asymptotic energy oscillations for certain smooth solutions to the system.  相似文献   

13.
14.
15.
16.
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).  相似文献   

17.
《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.  相似文献   

18.
《Discrete Mathematics》2022,345(3):112717
A transversal set of a graph G is a set of vertices incident to all edges of G. The transversal number of G, denoted by τ(G), is the minimum cardinality of a transversal set of G. A simple graph G with no isolated vertex is called τ-critical if τ(G?e)<τ(G) for every edge eE(G). For any τ-critical graph G with τ(G)=t, it has been shown that |V(G)|2t by Erd?s and Gallai and that |E(G)|(t+12) by Erd?s, Hajnal and Moon. Most recently, it was extended by Gyárfás and Lehel to |V(G)|+|E(G)|(t+22). In this paper, we prove stronger results via spectrum. Let G be a τ-critical graph with τ(G)=t and |V(G)|=n, and let λ1 denote the largest eigenvalue of the adjacency matrix of G. We show that n+λ12t+1 with equality if and only if G is tK2, Ks+1(t?s)K2, or C2s?1(t?s)K2, where 2st; and in particular, λ1(G)t with equality if and only if G is Kt+1. We then apply it to show that for any nonnegative integer r, we have n(r+λ12)(t+r+12) and characterize all extremal graphs. This implies a pure combinatorial result that r|V(G)|+|E(G)|(t+r+12), which is stronger than Erd?s-Hajnal-Moon Theorem and Gyárfás-Lehel Theorem. We also have some other generalizations.  相似文献   

19.
This paper deals with a non-self-adjoint eigenvalue problem
{a(x)y(x)+b(x)y(x)=λy(x),y(0)=01y(x)dν0(x),y(1)=01y(x)dν1(x),
which is associated with the generator of one dimensional diffusions with random jumps from the boundary. We focus on the dependence of spectral gap, eigenvalues and eigenfunctions on the coefficients a, b and the probability distributions ν0, ν1. To prove this, we show that all the eigenvalues are confined to a parabolic neighborhood of the real axis. Moreover, we also prove that zero is an algebraically simple eigenvalue of the problem.  相似文献   

20.
The paper investigates longtime dynamics of the Kirchhoff wave equation with strong damping and critical nonlinearities: utt?(1+??u2)Δu?Δut+h(ut)+g(u)=f(x), with ?[0,1]. The well-posedness and the existence of global and exponential attractors are established, and the stability of the attractors on the perturbation parameter ? is proved for the IBVP of the equation provided that both nonlinearities h(s) and g(s) are of critical growth.  相似文献   

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

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