Properly colored subgraphs and rainbow subgraphs in edge‐colorings with local constraints

We consider a canonical Ramsey type problem. An edge‐coloring of a graph is called m‐good if each color appears at most m times at each vertex. Fixing a graph G and a positive integer m, let f(m, G) denote the smallest n such that every m‐good edge‐coloring of K_n yields a properly edge‐colored copy of G, and let g(m, G) denote the smallest n such that every m‐good edge‐coloring of K_n yields a rainbow copy of G. We give bounds on f(m, G) and g(m, G). For complete graphs G = K_t, we have c₁mt²/ln t ≤ f(m, K_t) ≤ c₂mt², and cmt³/ln t ≤ g(m, K_t) ≤ cmt³/ln t, where c₁, c₂, c, c are absolute constants. We also give bounds on f(m, G) and g(m, G) for general graphs G in terms of degrees in G. In particular, we show that for fixed m and d, and all sufficiently large n compared to m and d, f(m, G) = n for all graphs G with n vertices and maximum degree at most d. © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2003     

包含极值点和分枝点的解曲线跟踪算法的摄动解法

本文提出了采用摄动格式求解非线性方程组的解曲线跟踪算法的计算格式.文中着重讨论了解曲线上非正则点的搜索,以及从这些非正则点——转向点或分枝点——继续跟踪超临界平衡路径的计算方法.文中把这一算法应用于弹性薄壳的屈曲分析。通过柱壳和环壳的算例得到它们的整个屈曲过程的平衡路径和变形形态.     

The WKBZ mode approach to sound propagation in range-independent ocean channels

I.IntroductionThenorma1-modeapproachcangiveanexactso1utiontotheacousticfie1dinastratifiedmedium,soitisoftenusedtocomparewithotherapproximatemethodssuchasraytheory,parabo1icequationl'](PE)methodandGaussianbeam[21approach,andtakenasacriteriontochecktheaccuracyofapproximatemeth0dsl3J.Themodeapproachmayalsobeextendedtorange-dcpendente..i,onmentsl4.5l.Thoughtherearemanynumerica1propagationcodesbasedonthemodeapproachI'],theconventionalmodeapproachisawkwardtoapplyt0'higherfrequencya-ndbroadbandprop…     

轮图的广义Mycielski图的邻强边色数

设图 G(V,E)为简单图 ,V(Mn(G) ) |{ v0 1,v0 2 ,… ,v0 p;v11,v12 ,… ,v1p,… ,vn1,vn2 ,… ,vnp}E(Mn(G) ) =E(G)∪ { vijv(i+ 1) k|v0 jv0 k ∈ E(G) ,1≤ j,k≤ p ,i =0 ,1,… ,n - 1}称 Mn(G)为 G的 n广义 Mycielski图 ,n为自然数 .本文得到了轮的广义 Mycielski图的临强边色数 .     

基于增广Lagrange函数的RQP方法

Recursive quadratic programming is a family of techniques developd by Bartholomew-Biggs and other authors for solving nonlinear programming problems.This paperdescribes a new method for constrained optimization which obtains its search di-rections from a quadratic programming subproblem based on the well-known aug-mented Lagrangian function.It avoids the penalty parameter to tend to infinity.We employ the Fletcher‘s exact penalty function as a merit function and the use of an approximate directional derivative of the function that avoids the need toevaluate the second order derivatives of the problem functions.We prove that thealgorithm possesses global and superlinear convergence properties.At the sametime, numerical results are reported.     

广义Sierpinski集

本文考察了包括平面上的各种广义 Cantor集 ,Sierpinski集和包括某些连续不可微曲线在内的广义 Sierpinski集 .由相似变换 ,导出了它们的级数表达式 ,并利用它和字符串空间的对应关系 ,计算出它们的Hausdorff维数     

一个耦合系统自由边界问题的整体古典解

§ 1　ＩｎｔｒｏｄｕｃｔｉｏｎＩｎｔｈｉｓｐａｐｅｒｗｅｄｉｓｃｕｓｓｔｈｅｇｌｏｂａｌｃｌａｓｓｉｃａｌｓｏｌｕｔｉｏｎｏｆａｍｕｌｔｉｄｉｍｅｎｓｉｏｎａｌｑｕａｓｉｓｔａｔｉｏｎａｒｙｐｒｏｂｌｅｍ .Ｔｈｅｐｒｏｂｌｅｍｃｏｍｅｓｆｒｏｍｔｈｅｄｉｓｃｕｓｓｉｏｎｏｆａｇｒｏｗｔｈｍｏｄｅｌｏｆｓｅｌｆｍａｉｎｔａｉｎｉｎｇｐｒｏｔｏｃｅｌｌ(ｓｅｅ [1— 3])ｉｎｍｕｌｔｉｄｉｍｅｎｓｉｏｎａｌｃａｓｅ .Ｔｈｅｐｒｏｔｏｃｅｌｌｃａｎｂｅｖｉｓｕａｌｉｚｅｄａｓｈａｖｉｎｇａｐｏｒｏｕｓｓｔ…     

面积比较与上调和函数及其应用

本文研究了无穷远处具非负截曲率的完备非紧流形的几何和解析性质,并将 它应用于调和映照.     

积域上一类奇异积分算子的L~p有界性

本文证明,对于Ω∈(1)∩L(log~+L)~2(S~(n-1)×S~(m-1)),h(r,s)∈L~∞(R_+~1×R_+~1)和P_(N_1),P_(N_2)∈(2),带粗糙核的奇异积分算子为L~p有界。