6连通图中的可收缩边

Kriesell(2001年)猜想：如果κ连通图中任意两个相邻顶点的度的和至少是2[5κ/4]-1则图中有κ-可收缩边．本文证明每一个收缩临界6连通图中有两个相邻的度为6的顶点，由此推出该猜想对κ=6成立。     

两个轮换对称不等式猜想的证明

文[1]提出了四个不等式猜想,其中的猜想1和猜想2已分别在文[2]和[3]中解决．在本文中,笔者将给出猜想3和猜想4的证明．     

一个猜想的解决

司志本老师在文[1]中提出的猜想是： 猜想：对于任意的正三棱柱和正四棱柱，其体积函数的导数都不可能等于表面积函数．笔者对该猜想进行了研究，得出的结论是：     

非奇异单圈图的刻划

边数等于顶点个数的连通图称为单圈图.本文修正了文献[1]中关于奇异单圈图的充要条件,并且利用该条件证明了文献[2]中一个关于非奇异单圈图的猜想.     

几个猜想不等式的探究

文[1]对一道不等式再思考后提出了四个猜想，现对这四个猜想逐一加以探究。为了证明猜想，需用到下面的引理．     

关于2-连通“几乎正则”图的Jackson猜想

Bill Jackson在[1]中作为猜想,提出了一个2-连通“几乎正则”(almost regular)图存在Hamilton圈的充分条件:“如果G是一个次序列为(k,k,…,k,k+1,k+1)的2-连通图,其顶点数不大于3k+2时,G是Hamilton图.本文举例说明     

循环分布图最大边数猜想的一个反例

令f(n)为恰有n个顶点，任意两个循环长度都不相等的图的最多边数．1975年，Erdos提出确定f(n)的问题(见[1]P274，Problem11)．1986年．Y．Shi证明了对任意自然数．≥3，有f(n)≥n [(√8n-23 1／1)／2]，且当3≤n≤17时．等号成立．进而猜想：对于任何自然数n≥3，上述等式都成立．本文对该猜想给出一个反例。     

K1,4-自由的模κ泛圈图

设G是2-连通的K1，4自由图．本文证明了当δ(G)≥κ 1时，G是模κ泛圈图．这一结果肯定了猜想2，继而也肯定了Thomassen猜想在2-连通图中的正确性．     

一对姊妹不等式的联想

受文[1]和文[2]启发，本文将给出与不等式①类似的一个不等式．文末提出三个与②，③，④三式类似的不等式猜想．     

一个不等式猜想的证明

文[1]末提出了四个不等式猜想,文[2],文[3]均给出了猜想1的详细证明,文[2]还对猜想1作了更深入的讨论.事实上,只要取a=-1,b=-2,c=32,便可知:abc>1,因而猜想2并非十分准确,同样猜想3,4亦有漏洞,本文对猜想4作一细小的修正,并给予证明.作为特例的猜想2,3也就一并解决了.猜想4若ni     

Global asymptotical stability in a rational difference equation

In this paper we prove a global attractivity result for the unique positive equilibrium point of a difference equation, which improves and generalizes some known ones in the existing literature. Especially, our results completely solve an open problem and some conjectures proposed in [1, 2, 3, 4].     

Koszul cohomology and singular curves

We investigate Koszul cohomology on irreducible nodal curves following the lines of [2]. In particular, we prove both Green and Green-Lazarsfeld conjectures for any k-gonal nodal curve which is general in the sense of [4].     

Open problems and conjectures

In this section we present some open problems and conjectures about some interesting types of difference equations. Please submit your problems and conjectures with all relevant information to G. Ladas.     

Open problems and conjectures

In this section we present some open problems and conjectures about some interesting types of difference equations. Please submit your problems and conjectures with all relavant information to G.Ladas     

Open problems and conjectures

In this section we present some open problems and conjectures about some interesting types of difference equations, Please submit your problems and conjectures with all relevant information to G. Ladas.     

On the recursive sequence

In this section we present some open problems and conjectures about some interesting types of difference equations. Please submit your problems and conjectures with all relevant information to G. Ladas.     

Open problems and conjectures

In this section we present some pen problems and conjectures about some interesting types of difference equations. Please submit your problems and conjectures with all relevant information to G. Ladas.     

Open problems and conjectures,optimal rearrangement problems related to discrete loaded strings

In this section we present some open problems and conjectures about some interesting types of difference equations. Please submit your problems and conjectures with all relevant information to G. Ladas.     

Open problem and conjectures,countably many solutions for a bvp on a measure chain

In this section we present some open problems and conjectures about some interesting types of difference equations. Please submit your problems and conjectures with all relevant information to G. Ladas.     

On the Toughness of Cycle Permutation Graphs

Motivated by the conjectures in [11], we introduce the maximal chains of a cycle permutation graph, and we use the properties of maximal chains to establish the upper bounds for the toughness of cycle permutation graphs. Our results confirm two conjectures in [11].