首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
For a given structure D (digraph, multidigraph, or pseudodigraph) and an integer r large enough, a smallest inducing r-regularization of D is constructed. This regularization is an r-regular superstructure of the smallest possible order with bounded arc multiplicity, and containing D as an induced substructure. The sharp upper bound on the number, ρ, of necessary new vertices among such superstructures for n-vertex general digraphs D is determined, ρ being called the inducing regulation number of D. For being the maximum among semi-degrees in D, simple n-vertex digraphs D with largest possible ρ are characterized if either or (where the case is not a trivial subcase of ).  相似文献   

2.
For an r-graph H, let C(H)=minSd(S), where the minimum is taken over all (r−1)-sets of vertices of H, and d(S) is the number of vertices v such that S∪{v} is an edge of H. Given a family F of r-graphs, the co-degree Turán number is the maximum of C(H) among all r-graphs H which contain no member of F as a subhypergraph. Define the co-degree density of a family F to be
  相似文献   

3.
4.
Let G be a graph and for any natural number r, denotes the minimum number of colors required for a proper edge coloring of G in which no two vertices with distance at most r are incident to edges colored with the same set of colors. In [Z. Zhang, L. Liu, J. Wang, Adjacent strong edge coloring of graphs, Appl. Math. Lett. 15 (2002) 623-626] it has been proved that for any tree T with at least three vertices, . Here we generalize this result and show that . Moreover, we show that if for any two vertices u and v with maximum degree d(u,v)?3, then . Also for any tree T with Δ(T)?3 we prove that . Finally, it is shown that for any graph G with no isolated edges, .  相似文献   

5.
Let −D<−4 denote a fundamental discriminant which is either odd or divisible by 8, so that the canonical Hecke character of exists. Let d be a fundamental discriminant prime to D. Let 2k−1 be an odd natural number prime to the class number of . Let χ be the twist of the (2k−1)th power of a canonical Hecke character of by the Kronecker's symbol . It is proved that the vanishing order of the Hecke L-function L(s,χ) at its central point s=k is determined by its root number when , where the constant implied in the symbol ? depends only on k and ?, and is effective for L-functions with root number −1.  相似文献   

6.
7.
8.
9.
Let S be a finite set with m elements in a real linear space and let JS be a set of m intervals in R. We introduce a convex operator co(S,JS) which generalizes the familiar concepts of the convex hull, , and the affine hull, , of S. We prove that each homothet of that is contained in can be obtained using this operator. A variety of convex subsets of with interesting combinatorial properties can also be obtained. For example, this operator can assign a regular dodecagon to the 4-element set consisting of the vertices and the orthocenter of an equilateral triangle. For two types of families JS we give two different upper bounds for the number of vertices of the polytopes produced as co(S,JS). Our motivation comes from a recent improvement of the well-known Gauss-Lucas theorem. It turns out that a particular convex set co(S,JS) plays a central role in this improvement.  相似文献   

10.
11.
12.
13.
14.
In this paper, we show that if is an n-dimensional subspace of L(V) such that every nonzero transformation of has rank greater than or equal to 2n−1 then is algebraically reflexive. If is an n-dimensional subspace of B(H) such that every nonzero transformation of  has rank greater than or equal to 2n−1 then is hyperreflexive. We also consider how to construct some new hyperreflexive subspaces.  相似文献   

15.
For the sets , 1?p<∞, of positive finite Borel measures μ on the real axis with the set of algebraic polynomials P dense in Lp(R,dμ), we establish a majorization principle of their “boundaries,” i.e. for every there exists such that dμ/dν?1. A corresponding principle holds for the sets , p>0, of non-negative upper semi-continuous on R functions (weights) w such that P is dense in the space : For every there exists such that w?ω.  相似文献   

16.
We study the existence of positive solutions to the elliptic equation ε2Δu(x,y)−V(y)u(x,y)+f(u(x,y))=0 for (x,y) in an unbounded domain subject to the boundary condition u=0 whenever is nonempty. Our potential V depends only on the y variable and is a bounded or unbounded domain which may coincide with . The positive parameter ε is tending to zero and our solutions uε concentrate along minimum points of the unbounded manifold of critical points of V.  相似文献   

17.
18.
Given a graph G, we construct an auxiliary graph with vertices such that the set of all stable sets of is in one-to-one correspondence with the set of all colorings of G. Then, we show that the Max-Coloring problem in G reduces to the Maximum Weighted Stable set problem in .  相似文献   

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

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