Clique-cutsets beyond chordal graphs

Truemper configurations (thetas, pyramids, prisms, and wheels) have played an important role in the study of complex hereditary graph classes (eg, the class of perfect graphs and the class of even-hole-free graphs), appearing both as excluded configurations, and as configurations around which graphs can be decomposed. In this paper, we study the structure of graphs that contain (as induced subgraphs) no Truemper configurations other than (possibly) universal wheels and twin wheels. We also study several subclasses of this class. We use our structural results to analyze the complexity of the recognition, maximum weight clique, maximum weight stable set, and optimal vertex coloring problems for these classes. Furthermore, we obtain polynomial -bounding functions for these classes.     

弱Orlicz鞅空间的弱原子分解及其应用

对3类由凹函数生成的弱Orlicz鞅空间建立了相应的弱原子分解.作为应用,首先给出了这些弱Orlicz鞅空间上次线性算子有界的一个充分条件,并在此基础上证明了一些弱型鞅不等式,然后证明了关于这些弱Orlicz鞅空间的Marcinkiewicz型插值定理.     

Reachable set bounding for nonlinear perturbed time-delay systems: The smallest bound

In this letter, we propose a new approach to obtain the smallest box which bounds all reachable sets of a class of nonlinear time-delay systems with bounded disturbances. A numerical example is studied to illustrate the obtained result.     

Large Cross‐Free Sets in Steiner Triple Systems

A cross‐free set of size m in a Steiner triple system is three pairwise disjoint m‐element subsets such that no intersects all the three ‐s. We conjecture that for every admissible n there is an STS(n) with a cross‐free set of size which if true, is best possible. We prove this conjecture for the case , constructing an STS containing a cross‐free set of size 6k. We note that some of the 3‐bichromatic STSs, constructed by Colbourn, Dinitz, and Rosa, have cross‐free sets of size close to 6k (but cannot have size exactly 6k). The constructed STS shows that equality is possible for in the following result: in every 3‐coloring of the blocks of any Steiner triple system STS(n) there is a monochromatic connected component of size at least (we conjecture that equality holds for every admissible n). The analog problem can be asked for r‐colorings as well, if and is a prime power, we show that the answer is the same as in case of complete graphs: in every r‐coloring of the blocks of any STS(n), there is a monochromatic connected component with at least points, and this is sharp for infinitely many n.     

酒类中微量甲醛的快速测定新方法

在FeCl3存在条件下,甲醛与自制蛋白液显色剂能生成紫色化合物,藉此可以定量测定微量甲醛。方法线性范围为1~10μg/10mL,线性相关系数r2=0.996,检出限为0.05μg/mL。用该法测定经活性炭脱色的啤酒和白酒中的甲醛含量,回收率为96.46%~103.32%,相对标准偏差为1.36%~2.09%(n=6)。     

Halin-图的邻强边染色

图G(V,E)的正常κ-边染色f叫做图G(V,E)的κ-邻强边染色当且仅当任意uv∈E(G)满足f[u]≠f[v],其中,f[u]={f(uw)|uw∈E(G)},称f是G的κ-临强边染色,简记为κ-ASEC.并且x′_as(G)=min{k|κ-ASEC of G}叫做G(V,E)的邻强边色数.本文研究了△(G)≥5的Halin-图的邻强边色数.