首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 7 毫秒
1.
The Randi? index of a graph G is defined as , where d(u) is the degree of vertex u and the summation goes over all pairs of adjacent vertices u, v. A conjecture on R(G) for connected graph G is as follows: R(G)≥r(G)−1, where r(G) denotes the radius of G. We proved that the conjecture is true for biregular graphs, connected graphs with order n≤10 and tricyclic graphs.  相似文献   

2.
The Randi? index R(G) of a graph G is defined by R(G)=uv1d(u)d(v), where d(u) is the degree of a vertex u and the summation extends over all edges uv of G. Delorme et al. (2002)  [6] put forward a conjecture concerning the minimum Randi? index among alln-vertex connected graphs with the minimum degree at least k. In this work, we show that the conjecture is true given the graph contains k vertices of degree n?1. Further, it is true among k-trees.  相似文献   

3.
The set of homotopy classes of self maps of a compact, connected Lie group G is a group by the pointwise multiplication which we denote by H(G), and it is known to be nilpotent. ōshima [H. ōshima, Self homotopy group of the exceptional Lie group G2, J. Math. Kyoto Univ. 40 (1) (2000) 177-184] conjectured: if G is simple, then H(G) is nilpotent of class ?rankG. We show this is true for PU(p) which is the first high rank example.  相似文献   

4.
5.
We consider the following Brezis–Nirenberg problem on S3
?ΔS3u=λu+u5inD,u>0inDandu=0on ?D,
where D is a geodesic ball on S3 with geodesic radius θ1, and ΔS3 is the Laplace–Beltrami operator on S3. We prove that for any λ<?34 and for every θ1<π with π?θ1 sufficiently small (depending on λ), there exists bubbling solution to the above problem. This solves a conjecture raised by Bandle and Benguria [J. Differential Equations 178 (2002) 264–279] and Brezis and Peletier [C. R. Acad. Sci. Paris, Ser. I 339 (2004) 291–394]. To cite this article: W. Chen, J. Wei, C. R. Acad. Sci. Paris, Ser. I 341 (2005).  相似文献   

6.
7.
Füredi conjectured that the Boolean lattice 2[n] can be partitioned into (nn/2) chains such that the size of any two differs in at most one. In this paper, we prove that there is an absolute constant α0.8482 with the following property: for every ϵ>0, if n is sufficiently large, the Boolean lattice 2[n] has a chain partition into (nn/2) chains, each of them of size between (αϵ)n and O(n/ϵ).We deduce this result by looking at the more general setup of unimodal normalized matching posets. We prove that a unimodal normalized matching poset P of width w has a chain partition into w chains, each of size at most 2|P|w+5, and it has a chain partition into w chains, where each chain has size at least |P|2w12.  相似文献   

8.
The objective of the present paper is to study the logarithmic coefficients of Bazilevic? functions. We obtain the inequality ∣γn∣ ? An−1logn (A is an absolute constant) which holds for Bazilevic? functions.  相似文献   

9.
10.
We give a new proof of a 4φ3 summation due to G.E. Andrews and confirm another 4φ3 summation conjectured by him recently. Some variations of these two 4φ3 summations are also given.  相似文献   

11.
We prove that any arithmetically Gorenstein curve on a smooth, general hypersurface of degree at least 6, is a complete intersection. This gives a characterisation of complete intersection curves on general type hypersurfaces in . We also verify that certain 1-cycles on a general quintic hypersurface are non-trivial elements of the Griffiths group.  相似文献   

12.
13.
14.
15.
We prove that there exists a Lipschitz function froml 1 into ℝ2 which is Gateaux-differentiable at every point and such that for everyx, y εl 1, the norm off′(x) −f′(y) is bigger than 1. On the other hand, for every Lipschitz and Gateaux-differentiable function from an arbitrary Banach spaceX into ℝ and for everyε > 0, there always exist two pointsx, y εX such that ‖f′(x) −f′(y)‖ is less thanε. We also construct, in every infinite dimensional separable Banach space, a real valued functionf onX, which is Gateaux-differentiable at every point, has bounded non-empty support, and with the properties thatf′ is norm to weak* continuous andf′(X) has an isolated pointa, and that necessarilya ε 0. This work has been initiated while the second-named author was visiting the University of Bordeaux. The second-named author is supported by grant AV 1019003, A1 019 205, GA CR 201 01 1198.  相似文献   

16.
We prove some results related to a conjecture of Hivert and Thiéry about the dimension of the space of q-harmonics (F. Hivert and N. Thiéry, 2004 [HT]). In the process we compute the actions of the involved operators on symmetric and alternating functions, which have some independent interest. We then use these computations to prove other results related to the same conjecture.  相似文献   

17.
Let F be a family of graphs. A graph is F-free if it contains no copy of a graph in F as a subgraph. A cornerstone of extremal graph theory is the study of the Turán number ex(n,F), the maximum number of edges in an F-free graph on n vertices. Define the Zarankiewicz number z(n,F) to be the maximum number of edges in an F-free bipartite graph on n vertices. Let C k denote a cycle of length k, and let C k denote the set of cycles C ?, where 3≤?≤k and ? and k have the same parity. Erd?s and Simonovits conjectured that for any family F consisting of bipartite graphs there exists an odd integer k such that ex(n,FC k ) ~ z(n,F) — here we write f(n)g(n) for functions f,g: ? → ? if lim n→∞ f(n)/g(n)=1. They proved this when F ={C 4} by showing that ex(n,{C 4;C 5})~z(n,C 4). In this paper, we extend this result by showing that if ?∈{2,3,5} and k>2? is odd, then ex(n,C 2? ∪{C k }) ~ z(n,C 2? ). Furthermore, if k>2?+2 is odd, then for infinitely many n we show that the extremal C 2? ∪{C k }-free graphs are bipartite incidence graphs of generalized polygons. We observe that this exact result does not hold for any odd k<2?, and furthermore the asymptotic result does not hold when (?,k) is (3, 3), (5, 3) or (5, 5). Our proofs make use of pseudorandomness properties of nearly extremal graphs that are of independent interest.  相似文献   

18.
We prove a conjecture of Zahariuta which itself solves a problem of Kolmogorov on the -entropy of some classes of analytic functions. For a given holomorphically convex compact subset K in a pseudoconvex domain D in Cn, Zahariutas conjecture consists in approximating the relative extremal function u*K,D, uniformly on any compact subset of DK, by pluricomplex Green functions on D with logarithmic poles in the compact subset K.  相似文献   

19.
In this paper, some classes of differentiation basis are investigated and several positive answers to a conjecture of Zygmund on differentiation of integrals are presented.  相似文献   

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

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