Factorizations of complete graphs into caterpillars of diameter 5

We examine factorizations of complete graphs K_2n into caterpillars of diameter 5. First we present a construction generalizing some previously known methods. Then we use the new method along with some previous partial results to give a complete characterization of caterpillars of diameter 5, which factorize the complete graph K_2n.     

A generalization of the Erdös-Ko-Rado theorem

In this note, we investigate some properties of local Kneser graphs defined in [János Körner, Concetta Pilotto, Gábor Simonyi, Local chromatic number and sperner capacity, J. Combin. Theory Ser. B 95 (1) (2005) 101-117]. In this regard, as a generalization of the Erdös-Ko-Rado theorem, we characterize the maximum independent sets of local Kneser graphs. Next, we provide an upper bound for their chromatic number.     

Regular saturated graphs and sum-free sets

In a recent paper, Gerbner, Patkós, Tuza and Vizer studied regular F-saturated graphs. One of the essential questions is given F, for which n does a regular n-vertex F-saturated graph exist. They proved that for all sufficiently large n, there is a regular $K_3$-saturated graph with n vertices. We extend this result to both $K_4$ and $K_5$ and prove some partial results for larger complete graphs. Using a variation of sum-free sets from additive combinatorics, we prove that for all $k\ge 2$, there is a regular $C_{2k+1}$-saturated with n vertices for infinitely many n. Studying the sum-free sets that give rise to $C_{2k+1}$-saturated graphs is an interesting problem on its own and we state an open problem in this direction.     

Segmentation of synthetic aperture radar image using multiscale information measure-based spectral clustering

A multiscale information measure （MIM）, calculable from per-pixel wavelet coefficients, but relying on global statistics of synthetic aperture radar （SAR） image, is proposed. It fully exploits the variations in speckle pattern when the image resolution varies from course to fine, thus it can capture the intrinsic texture of the scene backscatter and the texture due to speckle simultaneously. Graph spectral segmen- tation methods based on MIM and the usual similarity measure are carried out on two real SAR images. Experimental results show that MIM can characterize texture information of SAR image more effectively than the commonly used similarity measure.     

图中具有某种性质的子图

设ｇ和ｆ是定义在图Ｇ的顶点集合Ｖ（Ｇ）上的整数值函数且对每个ｘ∈Ｖ（Ｇ）都有０≤ｇ（ｘ）≤ｆ（ｘ）且ｇ（ｘ）和ｆ（ｘ）为偶数。本文证明了：若Ｇ是一个（ｍｇ＋ｋ－１,ｍｆ－ｋ＋１）－图,１≤ｋ≤ｍ,Ｈ是Ｇ中一个给定的有ｋ条边的子图,则Ｇ存在一个子图Ｒ使得Ｒ有一个（ｇ,ｆ）－因子分解与Ｈ正交。     

Some Results on Evolutionary Equations Involving Functions of the Curvatures of the Graph

51.Introducti0nandMainResultlnthepaperL1J,Caffarelli,NirenbergandSpruckdiscussedtheDirichletproblemforthenonlinearellipticequationforunknownu=u(x):{':<;;>:,<";>:are,vxeD,(1-1)where0lsab0undedstrictlyconvexdomaininR"withsmoothboundaryare,K(u)=(K,(u),Kz(u),..',K"(u))denotestheprincipalcurvaturesofthegraph(x,u(x))andfisofaspecialnatureasinL2J'L3j.Typicalcasesoftheequationin(1.l),whichweretreatedaswellbyIvochkina[4J,isf=Sl/*(K),whereS*(K)arethee1ementarysymmetricfunctions,Recently,Ivochki…     

Some remarks on compact constant mean curvature hypersurfaces in a halfspace of ℍ n+1

We consider embedded compact hypersurfacesM in a halfspace of hyperbolic space with boundaryM in the boundary geodesic hyperplaneP of the halfspace and with non-zero constant mean curvature. We prove the following. Let {M _n } be a sequence of such hypersurfaces withM _n contained in a disk of radiusr _n centered at a point P such thatr _n 0 and that eachM _n is a large. H-hypersurface,H > 1. Then there exists a subsequence of {M _n } converging to the sphere of mean curvatureH tangent toP at. In the case of smallH-hypersurfaces orH 1, if we add a condition on the curvature of the boundary, there exists a subsequence of {M _n } which are graphs. The convergence is smooth on compact subset of ³ .     

欧拉游历间K1—变换下的算法复杂性

本文主要讨论了欧拉图方面的国际权威ＨｅｒｂｅｒｔＦｌｅｉｃｈｎｅｒ教授所著书［１］中的一个问题；对欧拉图Ｇ的任意两个欧拉游历要经过多少Ｋ－变换或Ｋ＾＊－变换才能从一个游历得到另一个游历？我们得到的结论是：对欧拉图Ｇ中的任两个欧拉游历Ｔ、Ｔ＇最多经过‖Ｅ（Ｇ）‖－‖Ｖ（Ｇ）‖－变换可以使Ｔ变换成Ｔ＇。且此结果不能再改进。进一步我们分别对Ｋ－变换和Ｋ＆－变换的算法复杂性进行了讨论。