Ramsey Number of K_(2,s 1) vs.K_(1,n)

It is shown that the Ramsey number r(K_(2,s 1),K_(1,n))(?)n sn~(1/2) (s 3)/2 o(1) for large n,and r(K_(2,s 1),K_(1,n))∈{((q-1)~2/s) 1,((q-1)~2/s) 2},where n=((q-1)~2/s)-q 2 and q is a prime power such that s|(q-1).     

关于同余式$\sigma(n)\equiv 1\pmod n$

Let k ≥ 2 be an integer, and let σ(n) denote the sum of the positive divisors of an integer n. We call n a quasi-multiperfect number if σ(n) = kn + 1. In this paper, we give some necessary properties of them.     

关于K2,s+1 VS,K1,n的Ramsey数

It is shown that the Ramsey number r(K2,s 1, K1,n) ≤ n √sn (s 3)/2 o(1) for large n, and r(K2,s 1, K1,n)∈{(q-1)2/s 1,-(q-1)2/s 2},wheren (q-1)2/s-q 2 and q is a prime power such that s|(q - 1).     

Vertex-distinguishing E-total Coloring of Complete Bipartite Graph K_(7,n) when 7≤n≤95

Let G be a simple graph. A total coloring f of G is called an E-total coloring if no two adjacent vertices of G receive the same color, and no edge of G receives the same color as one of its endpoints. For an E-total coloring f of a graph G and any vertex x of G, let C(x) denote the set of colors of vertex x and of the edges incident with x, we call C(x) the color set of x. If C(u)≠ C(v) for any two different vertices u and v of V(G), then we say that f is a vertex-distinguishing E-total coloring of G or a VDET coloring of G for short. The minimum number of colors required for a VDET coloring of G is denoted by χ_(vt)~e(G) and is called the VDET chromatic number of G. The VDET coloring of complete bipartite graph K_(7,n)(7 ≤ n ≤ 95) is discussed in this paper and the VDET chromatic number of K_(7,n)(7 ≤ n ≤ 95) has been obtained.     

Tur´an Problems for Berge-(k, p)-Fan Hypergraph*

Let F be a graph. A hypergraph H is Berge-F if there is a bijection f : E(F) → E(H) such that e ? f(e) for every e ∈ E(F). A hypergraph is Berge-F-free if it does not contain a subhypergraph isomorphic to a Berge-F hypergraph. The authors denote the maximum number of hyperedges in an n-vertex r-uniform Berge-F-free hypergraph by ex_r(n, Berge-F).A (k, p)-fan, denoted by F_k,p, is a graph on k(p ? 1) + 1 vertices consisting of k cliques with p vertices that intersect in exactly one common vertex. In this paper they determine the bounds of ex_r(n, Berge-F) when F is a (k, p)-fan for k ≥ 2, p ≥ 3 and r ≥ 3.     

Overgroups of SU(n,K, f) or Ω(n,K, Q) in GL(n,K)

All the overgroups of SU(n, K, f) or (n, K, Q) in GL(n, K) are determined, for arbitrary division rings K and arbitrary forms f or Q with positive Witt indices.     

AgL(m,n)的gL(m,n)模结构

设g=g_(-1)+g_0+g_1是由阶化向量空间V=V_0+V_1的线性变换所构成的李超代数。通过上诱导模,定义了外代数Λ(g_1)的g模结构,这儿g_1=V_1(?)V_0~*,并决定了它的全部子(g_0+g_1),(g_0+g_(-1))、g模。     

K_(n,n)的局部最优可靠性

假设n点m边的简单无向图G=(V,E)的每个顶点完全可靠,各边相互独立地以同一概率q(0q1)发生故障,则用G不连通的概率P(G,q)作为衡量网不可靠程度的指标.如果对于充分接近q0的所有q都有P(G,q)P(H,q),则称在边故障概率q～q0时,网络G比H可靠.证明了当q～0时,Kn,n(n4)是2n点n2边图中局部最优可靠的.     

$A(n,k)$和$P(n,k)$的精确公式

设A(n,k)表示不定方程的非负整数解的个数,P(n,k)为整数n分为k个部分的无序分拆的个数,每个分部不小于1．本文给出了A(n,k)和P(n,k)的精确表达式．     

(I,K)-(m,n)-内射环

引入了(I,K)-(m,n)-内射环的概念,给出了(I,K)-(m,n)-内射环的等价刻划.讨论了(I,K)-(m,n)-内射环与(I,K)-(m,1)-内射环之间的关系及左(I,K)-(m,n)-内射环和右(I,K)-(m,n)-内射环的关系.证明了R是右(I,K)-(m,n)-内射环当且仅当如果z=(m1,m2,…,mn)∈Kn且A∈Im×n,rR(A)∈rRn(z),则存在y∈Km,使得z=yA推广了已知的相关结论.     

关于完全二部图$K_{4, n}$和$K_{n, n}$的点可区别 $IE$-全染色的一些注记

Let G be a simple graph.An IE-total coloring f of G refers to a coloring of the vertices and edges of G so that no two adjacent vertices receive the same color.Let C(u) be the set of colors of vertex u and edges incident to u under f.For an IE-total coloring f of G using k colors,if C(u)=C(v) for any two different vertices u and v of V(G),then f is called a k-vertex-distinguishing IE-total-coloring of G,or a k-VDIET coloring of G for short.The minimum number of colors required for a VDIET coloring of G is denoted by χ ie vt (G),and it is called the VDIET chromatic number of G.We will give VDIET chromatic numbers for complete bipartite graph K4,n (n≥4),K n,n (5≤ n ≤ 21) in this article.     

K(n,2n,-n)方程行波解的分支

本文研究了K(n,2n,-n)方程行波解与参数a,b,c,g,n等的关系.利用动力系统分支理论,得到了孤立波、扭结和反扭结波解,以及不可数无穷多光滑周期波解的存在性.本文推广了文献[1]中的结果.     

(m,n)模糊超环

介绍(m,n)超环等一些相关概念,之后将(m,n)超环模糊化,给出(m,n)模糊超环的定义,初步探讨(m,n)模糊超环的结构和性质,分析(m,n)模糊超环在同态下的不变性。     

广义(m,n)超环

本文研究了广义(m,n)超环,n元正则关系以及n元强正则关系等的一些性质.利用广义(m,n)超环间的同态关系以及正则和强正则关系,得到了(m,n)子超环和(m,n)超理想的不变性,广义(m,n)超环的商结构,以及构成商超环和商环的充分必要条件,推广了文献[5]的一些结果.     

完全二部图K_(1,n),K_(2,n)和K_(3,n)的点强可区别全染色

设f是图G的一个正常全染色.对任意x∈V(G),令C(x)表示与点x相关联或相邻的元素的颜色以及点x的颜色所构成的集合.若对任意u,v∈V(G),u≠v,有C(u)≠C(v),则称.f是图G的一个点强可区别全染色,对一个图G进行点强可区别全染色所需的最少的颜色的数目称为G的点强可区别全色数,记为X_(vst)(G).讨论了完全二部图K_(1,n),K_(2,n)和L_(3,n)的点强可区别全色数,利用组合分析法,得到了当n≥3时,X_(vst)(K_(1,n)=n+1,当n≥4时,X_(vst)(K_(2,n)=n+2,当n≥5时,X_(vst)(K_(3,n))=n+2.     

关于完全三部图K(n,n,n+4)的色唯一性

通过比较两个图的色多项式的系数(本文使用了五独立集数)、顶点集、边集、三角形和四圈的个数,证明了K(2,2,6)是色唯一图,从而部分地回答了文[5],[7]中遗留的一个问题,并得到图K(n,n,n 4)(n=2或n 4)是色唯一的.     

Finite Dimensional Lie Superalgebras W(m,n,t) and S(m,n,t) of Cartan Type

设Ｌ＝Ｗ或Ｓ，Ｆ是特征数大于２的域．本文证明了Ｆ上的有限维单李超代数Ｌ（ｍ，ｎ，ｔ）的自然滤过是不变的．进而得出了Ｌ（ｍ，ｎ，ｔ）与Ｌ（ｍ′，ｎ′，ｔ′）同构的充要条件是ｍ＝ｍ′，ｎ＝ｎ′和ｔｉ＝τ（ｔ′ｉ），ｉ＝１，２，…，ｍ，这里τ是｛１，２，…，ｍ｝的一个置换．     

完全三部图K(n-k,n,n)的色唯一性

通过对图的特征子图个数的比较,给出了图K(n-k,n,n)色唯一性的数值条件.     

SL(n,K)在 GL(n,F)(KF)中的扩群

设 F 是任意域.当 K 是 F 的子域且[F:K]<(?)时,或当 K 是 F 的极大子环但不是域时,本文定出了 SL(n,K)在 GL(n,F)中的全部扩群,从而得出了 SL(n,F)的一类极大子群.