首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 578 毫秒
1.
2.
3.
4.
5.
6.
A graph G is called a pseudo-core if every endomorphism of G is either an automorphism or a colouring. A graph G is a core if every endomorphism of G is an automorphism. Let Fq be the finite field with q elements where q is a power of an odd prime number. The quadratic forms graph, denoted by Quad(n,q) where n2, has all quadratic forms on Fqn as vertices and two vertices f and g are adjacent whenever rk(fg)=1 or 2. We prove that every Quad(n,q) is a pseudo-core. Further, when n is even, Quad(n,q) is a core. When n is odd, Quad(n,q) is not a core. On the other hand, we completely determine the independence number of Quad(n,q).  相似文献   

7.
8.
Lawler, Schramm, and Werner gave in 2003 an explicit formula of the probability that SLE(8/3) does not intersect a deterministic hull. For general SLE(κ) with κ8/3, no such explicit formula has been obtained so far. In this paper, we shall consider a random hull generated by an independent chordal conformal restriction measure and obtain an explicit formula for the probability that SLE(κ) does not intersect this random hull for any κ(0,8). As a corollary, we will give a new proof of Werner's result on conformal restriction measures.  相似文献   

9.
For a commutative ring A we consider a related graph, Γ(A), whose vertices are the unimodular rows of length 2 up to multiplication by units. We prove that Γ(A) is path-connected if and only if A is a GE2-ring, in the terminology of P. M. Cohn. Furthermore, if Y(A) denotes the clique complex of Γ(A), we prove that Y(A) is simply connected if and only if A is universal for GE2. More precisely, our main theorem is that for any commutative ring A the fundamental group of Y(A) is isomorphic to the group K2(2,A) modulo the subgroup generated by symbols.  相似文献   

10.
11.
We study the non-linear minimization problem on H01(Ω)?Lq with q=2nn?2, α>0 and n4:
infuH01(Ω)6u6Lq=1?Ωa(x,u)|?u|2?λΩ|u|2
where a(x,s) presents a global minimum α at (x0,0) with x0Ω. In order to describe the concentration of u(x) around x0, one needs to calibrate the behavior of a(x,s) with respect to s. The model case is
infuH01(Ω)6u6Lq=1?Ω(α+|x|β|u|k)|?u|2?λΩ|u|2.
In a previous paper dedicated to the same problem with λ=0, we showed that minimizers exist only in the range β<kn/q, which corresponds to a dominant non-linear term. On the contrary, the linear influence for βkn/q prevented their existence. The goal of this present paper is to show that for 0<λαλ1(Ω), 0kq?2 and β>kn/q+2, minimizers do exist.  相似文献   

12.
13.
14.
We develop a methodology for proving well-posedness in optimal regularity spaces for a wide class of nonlinear parabolic initial–boundary value systems, where the standard monotone operator theory fails. A motivational example of a problem accessible to our technique is the following system?tu?div(ν(|?u|)?u)=?divf with a given strictly positive bounded function ν, such that limk?ν(k)=ν and fLq with q(1,). The existence, uniqueness and regularity results for q2 are by now standard. However, even if a priori estimates are available, the existence in case q(1,2) was essentially missing. We overcome the related crucial difficulty, namely the lack of a standard duality pairing, by resorting to proper weighted spaces and consequently provide existence, uniqueness and optimal regularity in the entire range q(1,).Furthermore, our paper includes several new results that may be of independent interest and serve as the starting point for further analysis of more complicated problems. They include a parabolic Lipschitz approximation method in weighted spaces with fine control of the time derivative and a theory for linear parabolic systems with right hand sides belonging to Muckenhoupt weighted Lq spaces.  相似文献   

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

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

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

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