A Ramsey‐type result for the hypercube

We prove that for every fixed k and ? ≥ 5 and for sufficiently large n, every edge coloring of the hypercube Q_n with k colors contains a monochromatic cycle of length 2 ?. This answers an open question of Chung. Our techniques provide also a characterization of all subgraphs H of the hypercube which are Ramsey, that is, have the property that for every k, any k‐edge coloring of a sufficiently large Q_n contains a monochromatic copy of H. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 196–208, 2006     

关于Ramsey数下界的部分结果

本文得到 Ramsey数下界的一个计算公式 :R( l,s+ t-2 )≥ R( l,s) + R( l,t) -1 ,(式中 l、s、t≥ 3) .用此公式算得的 Ramsey数的下界比用其它公式算得的下界好 .     

Derived Lengths of Solvable Groups Having Five Irreducible Character Degrees II

Let G be a solvable group with five character degrees. Suppose that there is some prime p so that G/O ^p (G) is not Abelian. Also, assume that cd(G) contains a degree that is not divisible by p. Under these hypotheses, we show that the derived length of G is at most 4.     

双电荷交换反应与双重子共振态

提出了核双电荷交换反应的双重子共振态的反应机制,成功地解释了长期以来一直困惑着人们的共振区反应的角分布的实验结果.说明了共振区核双电荷交换反应是寻找双重子共振态的一个可能的途径.     

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     

代数构造及在Ramsey理论中的应用

这篇文章在伽罗瓦域上的代数构造和关于一些特定类型图的Ramsey数之间建立了一个关系. 研究了关于伽罗瓦域上的代数构造的方程及方程组的解. 我们得到了一些关于二部图的Ramsey数的新的下界和上界.     

On Ramsey numbers of uniform hypergraphs with given maximum degree

For every ?>0 and every positive integers Δ and r, there exists C=C(?,Δ,r) such that the Ramsey number, R(H,H) of any r-uniform hypergraph H with maximum degree at most Δ is at most C|V(H)|^1+?.     

One-dimensional model with rotational and liquid-crystalline phase transitions

A one-dimensional system of hard-rod particles with rotational-like internal degrees of freedom is considered. Particles interact with each other through the infinite-range, infinitely weak attractive Kac potential, and through a nearest-neighbor short-range potential. The latter depends also on the internal states of the interacting particles. Exact results for thermodynamic properties and for some correlation functions are obtained. It is found that the considered system exhibits several first-order transitions between phases with different rotational structure, i.e., with different ordering with respect to the internal degrees of freedom. The calculated equation of state seems to suggest that in the solutions of liquid-crystalline substances in neutral solvents there may exist regions in which the coefficient of thermal expansion is negative—an effect similar to that well known in liquid water.