In 5-benzyl-1,7-dimethyl-4,5,6,7-tetrahydro-1H-pyrazolo[3,4-d]pyrimidine-4,6-dione, C14H14N4O2, which crystallizes in space group P, weak intermolecular C—H⋯O hydrogen bonds generate dimers. The isomeric compound 1-benzyl-5,7-dimethyl-4,5,6,7-tetrahydro-1H-pyrazolo[3,4-d]pyrimidine-4,6-dione, C14H14N4O2, crystallizes in space group P21/n, and shows no such dimerization. Instead, it exhibits C—H⋯π interactions with the phenyl ring. In both structures, the molecules are linked by aromatic π–π-stacking interactions. 相似文献
Let be a perfect matching in a graph. A subset of is said to be a forcing set of , if is the only perfect matching in the graph that contains . The minimum size of a forcing set of is called the forcing number of . Pachter and Kim (1998) conjectured that the forcing number of every perfect matching in the -dimensional hypercube is , for all . This was revised by Riddle (2002), who conjectured that it is at least , and proved it for all even . We show that the revised conjecture holds for all . The proof is based on simple linear algebra. 相似文献
The present study highlights uranium levels, associated health effects, and physicochemical properties of ground water samples collected from Rajnandgaon District of Chhattisgarh State, Central India. Uranium concentrations of ground water samples are found to exceed than 30 µg/L (United States Environmental Protection Agency and World Health Organisation recommended limit) at two villages in summer and at one village in winter while it is found higher than 60 µg/L (Atomic Energy Regulatory Board, Department of Atomic Energy, India recommended limit) at only one village in summer. Correlation analysis between uranium and physicochemical parameters suggest that Ca2+ ion and total alkalinity play an important role in uranium contamination of ground water.
Herein, we report enhanced intravenous mouse lung transfection using novel cyclic-head-group analogs of usually open-head cationic transfection lipids. Design and synthesis of the new cyclic-head lipid N,N-di-n-tetradecyl-3,4-dihydroxy-pyrrolidinium chloride (lipid 1) and its higher alkyl-chain analogs (lipids 2-4) and relative in vitro and in vivo gene transfer efficacies of cyclic-head lipids 1-4 to their corresponding open-head analogs [lipid 5, namely N,N-di-n-tetradecyl-N,N-(2-hydroxyethyl)ammonium chloride and its higher alkyl-chain analogs, lipids 6-8] have been described. In stark contrast to comparable in vitro transfection efficacies of both the cyclic- and open-head lipids, lipids 1-4 with cyclic heads were found to be significantly more efficient (by 5- to 11-fold) in transfecting mouse lung than their corresponding open-head analogs (5-8) upon intravenous administration. The cyclic-head lipid 3 with di-stearyl hydrophobic tail was found to be the most promising for future applications. 相似文献
Erd?s conjectured that if G is a triangle free graph of chromatic number at least k≥3, then it contains an odd cycle of length at least k2?o(1) [13,15]. Nothing better than a linear bound ([3], Problem 5.1.55 in [16]) was so far known. We make progress on this conjecture by showing that G contains an odd cycle of length at least Ω(k log logk). Erd?s’ conjecture is known to hold for graphs with girth at least five. We show that if a graph with girth four is C5 free, then Erd?s’ conjecture holds. When the number of vertices is not too large we can prove better bounds on χ. We also give bounds on the chromatic number of graphs with at most r cycles of length 1 mod k, or at most s cycles of length 2 mod k, or no cycles of length 3 mod k. Our techniques essentially consist of using a depth first search tree to decompose the graph into ordered paths, which are then fed to an online coloring algorithm. Using this technique we give simple proofs of some old results, and also obtain several other results. We also obtain a lower bound on the number of colors which an online coloring algorithm needs to use to color triangle free graphs. 相似文献