首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 46 毫秒
1.
《Discrete Mathematics》2022,345(8):112902
For a simple graph G, denote by n, Δ(G), and χ(G) its order, maximum degree, and chromatic index, respectively. A graph G is edge-chromatic critical if χ(G)=Δ(G)+1 and χ(H)<χ(G) for every proper subgraph H of G. Let G be an n-vertex connected regular class 1 graph, and let G? be obtained from G by splitting one vertex of G into two vertices. Hilton and Zhao in 1997 conjectured that G? must be edge-chromatic critical if Δ(G)>n/3, and they verified this when Δ(G)n2(7?1)0.82n. In this paper, we prove it for Δ(G)0.75n.  相似文献   

2.
In this paper, we study the antipode of a finite-dimensional Hopf algebra H with the dual Chevalley property and obtain an annihilation polynomial for the antipode. This generalizes an old result given by Taft and Wilson in 1974. As consequences, we show that 1) the quasi-exponent of H is the same as the exponent of its coradical, that is, qexp(H)=exp?(H0); 2) qexp(H?kS2)=qexp(H).  相似文献   

3.
4.
5.
6.
7.
8.
《Discrete Mathematics》2022,345(8):112917
Let Φ(G,σ) and Φc(G,σ) denote the flow number and the circular flow number of a flow-admissible signed graph (G,σ), respectively. It is known that Φ(G)=?Φc(G)? for every unsigned graph G. Based on this fact, in 2011 Raspaud and Zhu conjectured that Φ(G,σ)?Φc(G,σ)<1 holds also for every flow-admissible signed graph (G,σ). This conjecture was disproved by Schubert and Steffen using graphs with bridges and vertices of large degree. In this paper we focus on cubic graphs, since they play a crucial role in many open problems in graph theory. For cubic graphs we show that Φ(G,σ)=3 if and only if Φc(G,σ)=3 and if Φ(G,σ){4,5}, then 4Φc(G,σ)Φ(G,σ). We also prove that all pairs of flow number and circular flow number that fulfil these conditions can be achieved in the family of bridgeless cubic graphs and thereby disprove the conjecture of Raspaud and Zhu even for bridgeless signed cubic graphs. Finally, we prove that all currently known flow-admissible graphs without nowhere-zero 5-flow have flow number and circular flow number 6 and propose several conjectures in this area.  相似文献   

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

11.
12.
13.
《Discrete Mathematics》2022,345(2):112663
Given graphs F and H, the generalized rainbow Turán number ex(n,F,rainbow-H) is the maximum number of copies of F in an n-vertex graph with a proper edge-coloring that contains no rainbow copy of H. B. Janzer determined the order of magnitude of ex(n,Cs,rainbow-Ct) for all s4 and t3, and a recent result of O. Janzer implied that ex(n,C3,rainbow-C2k)=O(n1+1/k). We prove the corresponding upper bound for the remaining cases, showing that ex(n,C3,rainbow-C2k+1)=O(n1+1/k). This matches the known lower bound for k even and is conjectured to be tight for k odd.  相似文献   

14.
15.
《Discrete Mathematics》2022,345(7):112893
In this paper, we study the Reconstruction Conjecture for finite simple graphs. Let Γ and Γ be finite simple graphs with at least three vertices such that there exists a bijective map f:V(Γ)V(Γ) and for any vV(Γ), there exists an isomorphism ?v:Γ?vΓ?f(v). Then we define the associated directed graph Γ?=Γ?(Γ,Γ,f,{?v}vV(Γ)) with two kinds of arrows from the graphs Γ and Γ, the bijective map f and the isomorphisms {?v}vV(Γ). By investigating the associated directed graph Γ?, we study when are the two graphs Γ and Γ isomorphic.  相似文献   

16.
17.
18.
19.
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.  相似文献   

20.
We employ separation of variables to prove weighted resolvent estimates for the semiclassical Schrödinger operator ?h2Δ+V(|x|)?E in dimension n2, where h,E>0, and V:[0,)R is L and compactly supported. The weighted resolvent norm grows no faster than exp?(Ch?1), while an exterior weighted norm grows h?1. We introduce a new method based on the Mellin transform to handle the two-dimensional case.  相似文献   

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

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