On-line arbitrarily vertex decomposable trees

A tree T is arbitrarily vertex decomposable if for any sequence τ of positive integers adding up to the order of T there is a sequence of vertex-disjoint subtrees of T whose orders are given by τ. An on-line version of the problem of characterizing arbitrarily vertex decomposable trees is completely solved here.     

Degree Sums and Covering Cycles

It is shown that if in a simple graph G of order n the sum of degrees of any three pairwise non-adjacent vertices is at least n, then there are two cycles (or one cycle and an edge or a vertex) of GF that contain all the vertices. © 1995 John Wiley & Sons, Inc.     

Contractions and minimalk-colorability

Coloring the vertex set of a graphG with positive integers, thechromatic sum (G) ofG is the minimum sum of colors in a proper coloring. Thestrength ofG is the largest integer that occurs in every coloring whose total is(G). Proving a conjecture of Kubicka and Schwenk, we show that every tree of strengths has at least ((2 + ) ^s–1 – (2 – ) ^s–1)/ vertices (s 2). Surprisingly, this extremal result follows from a topological property of trees. Namely, for everys 3 there exist precisely two treesT _s andR _s such that every tree of strength at leasts is edge-contractible toT _s orR _s .     

Sub-Ramsey numbers for arithmetic progressions

Letm 3 andk 1 be two given integers. Asub-k-coloring of [n] = {1, 2,...,n} is an assignment of colors to the numbers of [n] in which each color is used at mostk times. Call an arainbow set if no two of its elements have the same color. Thesub-k-Ramsey number sr(m, k) is defined as the minimumn such that every sub-k-coloring of [n] contains a rainbow arithmetic progression ofm terms. We prove that((k – 1)m ²/logmk) sr(m, k) O((k – 1)m ² logmk) asm , and apply the same method to improve a previously known upper bound for a problem concerning mappings from [n] to [n] without fixed points.Research supported in part by Allon Fellowship and by a Bat Sheva de-Rothschild grant.Research supported in part by the AKA Research Fund of the Hungarian Academy of Sciences, grant No. 1-3-86-264.     

Haplotyping by capillary electrophoresis

The investigation of the genetic background and phenotype structures of complex diseases, such as cardiovascular or psychiatric disorders and tumors, is one of the most scrutinized fields of the post genomic era. Besides the multiplex analysis of genetic markers and polymorphisms throughout the whole genome, more and more attention is focused on the interaction between the etiological factors of these traits. Haplotype determination, rather than multiplex genotyping seems to be one of the first building blocks of this endeavor. This review focuses on the importance and theoretical background of haplotyping, and summarizes the recent examples of novel and emerging haplotyping techniques by capillary gel electrophoresis based DNA fragment analysis, a powerful tool for the examination of the inheritance of complex traits.     

Cellulose production based on hemicellulose hydrolysate from steam-pretreated willow

The production cost of cellulolytic enzymes is a major contributor to the high cost of ethanol production from lignocellulosics using enzymatic hydrolysis. The aim of the present study was to investigate the cellulolytic enzyme production ofTrichoderma reesei Rut C 30, which is known as a good cellulase secreting micro-organism, using willow as the carbon source. The willow, which is a fast-growing energy crop in Sweden, was impregnated with 1–4% SO₂ and steam-pretreated for 5 min at 206°C. The pretreated willow was washed and the wash water, which contains several soluble sugars from the hemicellulose, was supplemented with fibrous pretreated willow and used for enzyme production. In addition to sugars, the liquid contains degradation products such as acetic acid, furfural, and 5-hydroxy-methylfurfural, which are inhibitory for microorganisms. The results showed that 50% of the cellulose can be replaced with sugars from the wash water. The highest enzyme activity, 1.79 FPU/mL and yield, 133 FPU/g carbohydrate, was obtained at pH 6.0 using 20 g/L carbon source concentration. At lower pHs, a total lack of growth and enzyme production was observed, which probably could be explained by furfural inhibition.     

Mass spectrometric analysis of porcine rhodopsin

Rhodopsin is the dim light photosensitive pigment of animals. In this work, we undertook to study the structure of rhodopsin from swine and compare it with bovine and rat rhodopsin. Porcine rhodopsin was analyzed using methodology developed previously for mass spectrometric analysis of integral membrane proteins. Combining efficient protein cleavage and high performance liquid chromatography separation with the sensitivity of mass spectrometry (MS), this technique allows the observation of the full protein map and the posttranslational modifications of the protein in a single experiment. The rhodopsin protein from a single porcine eye was sequenced completely, with the exception of two single-amino acid fragments and one two-amino acid fragment, and the gene sequence reported previously was confirmed. The posttranslational modifications, similar to the ones reported previously for bovine and rat rhodopsin, were also identified. Although porcine rhodopsin has a high degree of homology to bovine and rat rhodopsins and most of their posttranslational modifications are identical, the glycosylation and phosphorylation patterns observed were different. These results show that rhodopsin from a single porcine eye can be characterized completely by MS. This technology opens the possibility of rhodopsin structural and functional studies aided by powerful mass spectrometric analysis, using the fellow eye as an internal control.     

Environmental and economic comparison of waste solvent treatment options

The sustainable development and consumption need more efficient use of natural resources. As a consequence, the use of industrial solvents demands their recovery instead of end-of-pipe treatment. It is not always clear, however, which treatment alternative should be applied. Based on an industrial case study, the environmental and economic evaluation and comparison of the treatment alternatives of a non-ideal solvent mixture containing azeotropes is investigated for determining the preferable option. For the recovery of the industrial solvent mixture, two different separation alternatives are evaluated: a less effective alternative and a novel design based on hybrid separation tools. An end-of-pipe treatment alternative, incineration, is also considered and the split of the solvent mixtures between recovery and incineration is investigated. The environmental evaluation of the alternatives is carried out using ‘Eco-indicator 99 life-cycle impact assessment methodology’. Economic investigation is also accomplished. The economic features clearly favour the total recovery, however, the environmental evaluation detects that if a recovery process of low efficiency is applied, its environmental burden can be similar or even higher than that of the incineration. This motivates engineers to design more effective recovery processes and reconsider the evaluation of process alternatives at environmental decision making.     

Intersection Dimensions of Graph Classes

The intersection dimension of a graphG with respect to a classA of graphs is the minimumk such thatG is the intersection of at mostk graphs on vertex setV(G) each of which belongs toA. We consider the question when the intersection dimension of a certain family of graphs is bounded or unbounded. Our main results are (1) ifA is hereditary, i.e., closed on induced subgraphs, then the intersection dimension of all graphs with respect toA is unbounded, and (2) the intersection dimension of planar graphs with respect to the class of permutation graphs is bounded. We also give a simple argument based on [Ben-Arroyo Hartman, I., Newman, I., Ziv, R.:On grid intersection graphs, Discrete Math.87 (1991) 41-52] why the boxicity (i.e., the intersection dimension with respect to the class of interval graphs) of planar graphs is bounded. Further we study the relationships between intersection dimensions with respect to different classes of graphs.