共查询到20条相似文献,搜索用时 46 毫秒
1.
2.
《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 , is the minimum cardinality of a transversal set of G. A simple graph G with no isolated vertex is called τ-critical if for every edge . For any τ-critical graph G with , it has been shown that by Erd?s and Gallai and that by Erd?s, Hajnal and Moon. Most recently, it was extended by Gyárfás and Lehel to . In this paper, we prove stronger results via spectrum. Let G be a τ-critical graph with and , and let denote the largest eigenvalue of the adjacency matrix of G. We show that with equality if and only if G is , , or , where ; and in particular, with equality if and only if G is . We then apply it to show that for any nonnegative integer r, we have and characterize all extremal graphs. This implies a pure combinatorial result that , which is stronger than Erd?s-Hajnal-Moon Theorem and Gyárfás-Lehel Theorem. We also have some other generalizations. 相似文献
3.
4.
5.
The paper investigates longtime dynamics of the Kirchhoff wave equation with strong damping and critical nonlinearities: , with . 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 and are of critical growth. 相似文献
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, can be partitioned into A and B such that is perfect and . We use and to denote a path and a cycle on t vertices, respectively. For two disjoint graphs and , we use to denote the graph with vertex set and edge set , and use to denote the graph with vertex set and edge set . In this paper, we prove that (i) -free graphs are perfectly divisible, (ii) if G is -free with , (iii) if G is -free, and (iv) if G is -free. 相似文献
7.
Yinshan Chang Yiming Long Jian Wang 《Annales de l'Institut Henri Poincaré (C) Analyse Non Linéaire》2019,36(1):75-102
We consider a continuously differentiable curve in the space of real symplectic matrices, which is the solution of the following ODE: where and is a continuous path in the space of real matrices which are symmetric. Under a certain convexity assumption (which includes the particular case that is strictly positive definite for all ), we investigate the dynamics of the eigenvalues of 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: is a discrete set. 相似文献
8.
9.
A.S. Üstünel 《Journal of Functional Analysis》2019,276(11):3468-3483
10.
《Discrete Mathematics》2022,345(5):112801
Let G and H be simple graphs. The Ramsey number is the minimum integer N such that any red-blue-coloring of edges of contains either a red copy of G or a blue copy of H. Let denote m vertex-disjoint copies of . A lower bound is that . Burr, Erd?s and Spencer proved that this bound is indeed the Ramsey number for , and . In this paper, we show that this bound is the Ramsey number for and . We also show that this bound is the Ramsey number for and . 相似文献
11.
12.
13.
14.
Martin Strömqvist 《Journal of Differential Equations》2019,266(12):7948-7979
We state and prove estimates for the local boundedness of subsolutions of non-local, possibly degenerate, parabolic integro-differential equations of the form , where P.V. means in the principle value sense, and the kernel obeys for some , uniformly in . 相似文献
15.
《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 is the least integer k for which G admits a coloring with k colors such that each color class induces a -degenerate subgraph of G. So is the chromatic number and is the point arboricity. The point partition number with was introduced by Lick and White. A graph G is called -critical if every proper subgraph H of G satisfies . In this paper we prove that if G is a -critical graph whose order satisfies , then G can be obtained from two non-empty disjoint subgraphs and by adding t edges between any pair of vertices with and . Based on this result we establish the minimum number of edges possible in a -critical graph G of order n and with , provided that and t is even. For the corresponding two results were obtained in 1963 by Tibor Gallai. 相似文献
16.
17.
18.
19.
20.
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 . We establish that, in the inviscid resistive case, the energy vanishes and converges to a constant as time tends to infinity provided the velocity is bounded in ; in the viscous non-resistive case, the energy vanishes and converges to a constant provided the magnetic field is bounded in . In summary, one single diffusion, being as weak as or with small enough , is sufficient to prevent asymptotic energy oscillations for certain smooth solutions to the system. 相似文献