Linear Ramsey numbers of sparse graphs

The Ramsey number R(G₁,G₂) of two graphs G₁ and G₂ is the least integer p so that either a graph G of order p contains a copy of G₁ or its complement G^c contains a copy of G₂. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory     

Chromatic Uniqueness of the Complement of T_m(l, 4, m - 6)

In the paper, we prove that the complement of Tm(1,4,m - 6)(m > 10) is chromatically unique if and only if m ≠5k(k ≥ 2).     

无原子布氏代数理论的计算复杂性

研究无原子布氏代数的计算复杂性 .得到了下面的新定理 :定理 1　无原子布氏代数理论Δ具有完全的量词消去法 ,也就是说每一个式子都Δ等价于一个开式子 .定理 2　无原子布氏代数的初等型Γ (x1,… ,xn)是由型内的不含量词的全体开式子所唯一决定 .定理 3　无原子布氏代数的一个长度为 n的语句的判断过程所消耗的 Turing时间和空间都是属于 2 2 cn指数级 .     

Strongly confined quantum wire states in strained T-shaped GaAs/InAlAs structures

The confinement energy of T-shaped quantum wires (QWRs), which were fabricated by the cleaved edge overgrowth technique in a way that the QWRs form at the intersection of In_0.2Al_0.8As stressor layers and the overgrown (1 1 0) GaAs quantum well (QW), is examined using micro-photoluminescence spectroscopy. Photoluminescence (PL) signals from individual QWRs can be spatially resolved, since the strained films are separated by 1 μm wide Al_0.3Ga_0.7As layers. We find that due to the tensile strain being transmitted to the QW, the confinement energy of the QWRs rises systematically up to 40 meV with increasing thickness of the stressor layers. By reducing the excitation power to 0.1 μW the QWR PL emission occurs 48 meV redshifted with respect to the QW. All QWR peaks exhibit smooth lineshapes, indicating the absence of pronounced exciton localization.     

Highly edge‐connected detachments of graphs and digraphs

Let G = (V,E) be a graph or digraph and r : V → Z₊. An r‐detachment of G is a graph H obtained by ‘splitting’ each vertex ν ∈ V into r(ν) vertices. The vertices ν₁,…,ν_r(ν) obtained by splitting ν are called the pieces of ν in H. Every edge uν ∈ E corresponds to an edge of H connecting some piece of u to some piece of ν. Crispin Nash‐Williams 9 gave necessary and sufficient conditions for a graph to have a k‐edge‐connected r‐detachment. He also solved the version where the degrees of all the pieces are specified. In this paper, we solve the same problems for directed graphs. We also give a simple and self‐contained new proof for the undirected result. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 67–77, 2003     

图的边韧性度

文[1]中,定义图G(V,E)的边韧性度定义为min{(|S|+T(G-S))/(ω(G-S)):S?E(G)},这里,T-(G-S)和ω(G-S)分别表示G-S中最大分支的顶点数和连通分支数.这是一个能衡量网络图稳定性较好的参数,因为它不仅考虑到了图G-S的分支数也考虑到了它的阶数.在以前的工作中,作者得到了边韧性度图的一个充要条件.利用这些结果证明了K-树是严格边韧性度图,并找到了边韧性度与较高阶的边坚韧度和边坚韧度之间的关系.     

一些包含Lucas数的恒等式

利用第一类Chebyshev多项式的性质以及其与Lucas数的关系得到了关于Lucas数立方的一些恒等式.     

基于分层光学扫描的三维数字化测量技术

采用切削分层光扫描测量与计算机数据信息合成相结合的方法，有效地解决了具有复杂内外腔结构零件的三维数字化测量。该方法比传统三维测量速度快、自动化程度高，能同时准确测量零件内外腔表面，零件边缘测量误差可控制在CCD两个像素内。利用获取的铝合金精密小箱体三维数据，在计算机上重构了零件的三维模型，并用RP技术制造出了零件物理原形。     

Maximal σ‐polynomials of connected 3‐chromatic graphs

In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if c_i(G) ≤ c_i(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where c_i(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003     

一个素变数丢番图不等式

本文证明了如果1相似文献