Soft metal-mediated base pairing with novel synthetic nucleosides possessing an O,S-donor ligand

Metal-mediated base pairing with artificial ligand-bearing nucleosides allows site-selective metal incorporation inside DNA duplexes. In particular, this strategy has provided a general way of discrete, heterogeneous metal arrays in a programmable manner. To increase the kind of metallo-building blocks, we have newly synthesized two artificial nucleosides which have an O, S-donor ligand as the nucleobase moiety, mercaptopyridone ( M) and hydroxypyridinethione ( S). These nucleosides were found to efficiently form metal-mediated base pairs with soft transition metal ions such as Pd (2+) and Pt (2+).     

Correlation between acid strength (Ho) and ammonia desorption temperature for aluminas and silica-aluminas

Correlation between the temperature at which a base is desorbed and the acid strength (H_o) of the sites set free by it, was looked for. Ammonia was employed as base. A linear correlation of the type H_o=+/T (K) is valid with and constants, dependent on the adsorbate and the adsorbent.

---

(H_o) , . H_o=+/T (K), .

     

Lines in hypergraphs

One of the De Bruijn-Erd?s theorems deals with finite hypergraphs where every two vertices belong to precisely one hyperedge. It asserts that, except in the perverse case where a single hyperedge equals the whole vertex set, the number of hyperedges is at least the number of vertices and the two numbers are equal if and only if the hypergraph belongs to one of simply described families, near-pencils and finite projective planes. Chen and Chvátal proposed to define the line uv in a 3-uniform hypergraph as the set of vertices that consists of u, v, and all w such that {u;v;w} is a hyperedge. With this definition, the De Bruijn-Erd?s theorem is easily seen to be equivalent to the following statement: If no four vertices in a 3-uniform hypergraph carry two or three hyperedges, then, except in the perverse case where one of the lines equals the whole vertex set, the number of lines is at least the number of vertices and the two numbers are equal if and only if the hypergraph belongs to one of two simply described families. Our main result generalizes this statement by allowing any four vertices to carry three hyperedges (but keeping two forbidden): the conclusion remains the same except that a third simply described family, complements of Steiner triple systems, appears in the extremal case.     

Claw-free graphs with strongly perfect complements. Fractional and integral version. Part I. Basic graphs

Strongly perfect graphs have been studied by several authors (e.g. Berge and Duchet (1984) [1], Ravindra (1984) [12] and Wang (2006) [14]). In a series of two papers, the current paper being the first one, we investigate a fractional relaxation of strong perfection. Motivated by a wireless networking problem, we consider claw-free graphs that are fractionally strongly perfect in the complement. We obtain a forbidden induced subgraph characterization and display graph-theoretic properties of such graphs. It turns out that the forbidden induced subgraphs that characterize claw-free graphs that are fractionally strongly perfect in the complement are precisely the cycle of length 6, all cycles of length at least 8, four particular graphs, and a collection of graphs that are constructed by taking two graphs, each a copy of one of three particular graphs, and joining them in a certain way by a path of arbitrary length. Wang (2006) [14] gave a characterization of strongly perfect claw-free graphs. As a corollary of the results in this paper, we obtain a characterization of claw-free graphs whose complements are strongly perfect.     

Deposition of tungsten-oxo-species on zirconia

The deposition of tungsten oxo-species on zirconia is selective. The adsorption of less polymeric species (WO₄ ²⁻ and (HW₆O₂₁)⁵⁻) produced by decomposition of the W₁₂O₃₉ ⁶⁻ is predominant during the impregnation step.     

Large cliques or stable sets in graphs with no four‐edge path and no five‐edge path in the complement

Erd?s and Hajnal [Discrete Math 25 (1989), 37–52] conjectured that, for any graph H, every graph on n vertices that does not have H as an induced subgraph contains a clique or a stable set of size n^?(H) for some ?(H)>0. The Conjecture 1. known to be true for graphs H with |V(H)|≤4. One of the two remaining open cases on five vertices is the case where H is a four‐edge path, the other case being a cycle of length five. In this article we prove that every graph on n vertices that does not contain a four‐edge path or the complement of a five‐edge path as an induced subgraph contains either a clique or a stable set of size at least n^1/6. © 2011 Wiley Periodicals, Inc. J Graph Theory     

Influence of platinum and hydrogen on n-butane isomerization on H-Mordenite

Hydrogen inhibits n-butane isomerization of H-MOR and improves catalyst stability and selectivity. Similarly, when Pt is present, hydrogen inhibits the reaction which is always controlled by the acid function.     

Skeletal isomerization of 1-butene on ZrO2/Al2O3 treated with sulfate ion

The catalytic activity for skeletal isomerization of 1-butene on ZrO₂ supported on Al₂O₃ and doped with sulfate ion has been found to be higher than on pure ZrO₂/Al₂O₃, Al₂O₃ containing sulfate ion and a commercial SiO₂–Al₂O₃ of H_o<–13.7. Sulfate ion was capable of transforming ZrO₂/Al₂O₃ into a solid superacid.

---

1- ZrO₂, Al₂O₃ , , ZrO₂, , Al₂O₃, , SiO₂–Al₂O₃ H_o < –13,7. ZrO₂/Al₂O₃ .

     

K4‐free graphs with no odd hole: Even pairs and the circular chromatic number

An odd hole in a graph is an induced cycle of odd length at least five. In this article we show that every imperfect K₄‐free graph with no odd hole either is one of two basic graphs, or has an even pair or a clique cutset. We use this result to show that every K₄‐free graph with no odd hole has circular chromatic number strictly smaller than 4. We also exhibit a sequence {H_n} of such graphs with lim_n→∞χ_c(H_n)=4. © 2010 Wiley Periodicals, Inc. J Graph Theory 65: 303–322, 2010