Electrophoregrams with bands of green chlorophyll-containing protein complexes separated by native polyacrylamide gel electrophoresis (PAGE) are usually photographed in white light or scanned by a narrow beam of monochromatic light using densitometers. Present CCD cameras allow taking densitograms of a whole gel surface with many samples. However, commercial CCD imaging systems use mostly white...

Given graphs G and H, and a colouring of the edges of G with k colours, a monochromatic H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a monochromatic graph isomorphic to H. Let φk(n,H) be the smallest number φ such that any k-edge-coloured graph G of order n, admits a monochromatic H-decomposition with at most φ parts. Here we stud...

Thus if all primes are colored with k colors, then there exist arbitrarily long monochromatic arithmetic progressions. This is a van der Waerden-type [9] theorem for primes. (The well-known van der Waerden theorem states that for any m-coloring of all positive integers, there exist arbitrarily long monochromatic arithmetic progressions.) On the other hand, Schur’s theorem [7] is another importa...

Thus if all primes are colored with k colors, then there exist arbitrarily long monochromatic arithmetic progressions. This is a van der Waerden-type [9] theorem for primes. (The well-known van der Waerden theorem states that for any k-coloring of all positive integers, there exist arbitrarily long monochromatic arithmetic progressions.) On the other hand, Schur’s theorem [7] is another famous ...

Given graphs G and H, and a colouring of the edges of G with k colours, a monochromatic H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a monochromatic graph isomorphic to H. Let φk(n,H) be the smallest number φ such that any k-edge-coloured graph G of order n, admits a monochromatic H-decomposition with at most φ parts. Here we stud...

Given graphs G and H, and a colouring of the edges of G with k colours, a monochromatic H-decomposition of G is a partition of the edge set of G such that each part is either a single edge or forms a monochromatic graph isomorphic to H. Let φk(n,H) be the smallest number φ such that any graph G of order n and any colouring of its edges with k colours, admits a monochromatic Hdecomposition with ...

Glucose cultures of Chlorella vulgaris were grown in white light, in monochromatic light, and in darkness. Difference spectra showed that all wavelengths resulted in increased pigmentation over the dark controls.Cells irradiated with the 600 mmu beam showed a much higher absorption in the blue end of the spectrum with respect to the red end than is normally found in absorption spectra of white-...

A multilayered parabolic mirror with six W/Al bilayers was designed and fabricated to generate monochromatic parallel x-rays using a lab-based x-ray source. Using this mirror, curved bright bands were obtained in x-ray images as reflected x-rays. The parallelism of the reflected x-rays was investigated using the shape of the bands. The intensity and monochromatic characteristics of the reflecte...

An r-edge-coloring of a graph G is a surjective assignment of r colors to the edges of G. The monochromatic tree partition number of an redge-colored graph G is defined to be the minimum positive integer k such that whenever the edges of G are colored with r colors, the vertices of G can be covered by at most k vertex-disjoint monochromatic trees. In this paper, we give a direct proof for the m...