共查询到20条相似文献,搜索用时 578 毫秒
1.
2.
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 be the finite field with q elements where q is a power of an odd prime number. The quadratic forms graph, denoted by where , has all quadratic forms on as vertices and two vertices f and g are adjacent whenever or 2. We prove that every is a pseudo-core. Further, when n is even, is a core. When n is odd, is not a core. On the other hand, we completely determine the independence number of . 相似文献
7.
8.
Lawler, Schramm, and Werner gave in 2003 an explicit formula of the probability that does not intersect a deterministic hull. For general with , 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 does not intersect this random hull for any . As a corollary, we will give a new proof of Werner's result on conformal restriction measures. 相似文献
9.
《Journal of Pure and Applied Algebra》2022,226(10):107074
For a commutative ring A we consider a related graph, , whose vertices are the unimodular rows of length 2 up to multiplication by units. We prove that is path-connected if and only if A is a -ring, in the terminology of P. M. Cohn. Furthermore, if denotes the clique complex of , we prove that is simply connected if and only if A is universal for . More precisely, our main theorem is that for any commutative ring A the fundamental group of is isomorphic to the group modulo the subgroup generated by symbols. 相似文献
11.
We study the non-linear minimization problem on with , and : where presents a global minimum α at with . In order to describe the concentration of around , one needs to calibrate the behavior of with respect to s. The model case is In a previous paper dedicated to the same problem with , we showed that minimizers exist only in the range , which corresponds to a dominant non-linear term. On the contrary, the linear influence for prevented their existence. The goal of this present paper is to show that for , and , minimizers do exist. 相似文献
12.
13.
14.
Miroslav Bulíček Jan Burczak Sebastian Schwarzacher 《Annales de l'Institut Henri Poincaré (C) Analyse Non Linéaire》2019,36(5):1467-1500
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 with a given strictly positive bounded function ν, such that and with . The existence, uniqueness and regularity results for are by now standard. However, even if a priori estimates are available, the existence in case 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 .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 spaces. 相似文献
15.
16.
《Discrete Mathematics》2022,345(8):112917
Let and denote the flow number and the circular flow number of a flow-admissible signed graph , respectively. It is known that for every unsigned graph G. Based on this fact, in 2011 Raspaud and Zhu conjectured that holds also for every flow-admissible signed graph . 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 if and only if and if , then . 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, , and its order, maximum degree, and chromatic index, respectively. A graph G is edge-chromatic critical if and for every proper subgraph H of G. Let G be an n-vertex connected regular class 1 graph, and let be obtained from G by splitting one vertex of G into two vertices. Hilton and Zhao in 1997 conjectured that must be edge-chromatic critical if , and they verified this when . In this paper, we prove it for . 相似文献