The Moore Bound for Irregular Graphs

 What is the largest number of edges in a graph of order n and girth g? For d-regular graphs, essentially the best known answer is provided by the Moore bound. This result is extended here to cover irregular graphs as well, yielding an affirmative answer to an old open problem ([4] p. 163, problem 10). Received: June 27, 2000 Final version received: July 3, 2001     

Investigation of hard magnetic properties in the Fe-Pt system by combinatorial deposition of thin film multilayer libraries

The magnetic properties of annealed Fe-Pt multilayer thin films with a broad composition range were investigated in order to identify the effects of composition and annealing temperature on the achievable coercive field, and to identify its maximum at low processing temperatures. Two types of multilayer systems were deposited as materials libraries to vary the composition from Fe₂₀Pt₈₀ to Fe₇₅Pt₂₅. The first type of multilayer was comprised of alternating opposing wedges, whereas the second type consisted of repeated uniform Fe and Pt layers interspersed periodically with Fe wedge layers. It was found that coercive fields μ₀H_C > 0.7 T can be achieved at an annealing temperature of about 300 °C (60 min) for both types of multilayers as long as the composition is close to 50:50. Higher annealing temperatures are needed for films, which deviate from this composition. Increasing the annealing temperature up to 700 °C leads to increased coercivity values. Multilayers with additional Fe layers showed increased remanence but reduced coercive fields.     

Allgemeine Untersuchungen über Rectification der Curven

Ohne Zusammenfassung     

Diels-Alder-Reaktionen von Vinylindolen mit Arin und 1,4-Benzochinonen: Neue potentielle DNA-Interkalatoren

Summary Diels-Alder reactions of 2- and 3-vinylindoles with aryne, 1,4-benzo- and 1,4-naphtho-quinone lead to new six-ring annellated carbazoles. Molecular modeling studies predict that the compounds with coplanar framework are able to intercalate with the B-DNA.

     

A Ramsey‐type result for the hypercube

We prove that for every fixed k and ? ≥ 5 and for sufficiently large n, every edge coloring of the hypercube Q_n with k colors contains a monochromatic cycle of length 2 ?. This answers an open question of Chung. Our techniques provide also a characterization of all subgraphs H of the hypercube which are Ramsey, that is, have the property that for every k, any k‐edge coloring of a sufficiently large Q_n contains a monochromatic copy of H. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 196–208, 2006     

On the evolution of islands

Letn cells be arranged in a ring, or alternatively, in a row. Initially, all cells are unmarked. Sequentially, one of the unmarked cells is chosen at random and marked until, aftern steps, each cell is marked. After thekth cell has been marked the configuration of marked cells defines some number of islands: maximal sets of adjacent marked cells. Let ξ _k denote the random number of islands afterk cells have been marked. We give explicit expressions for moments of products of ξ _k ’s and for moments of products of 1/ξ _k ’s. These are used in a companion paper to prove that if a random graph on the natural number is made by drawing an edge betweeni≧1 andj>i with probabilityλ/j, then the graph is almost surely connected ifλ>1/4 and almost surely disconnected ifλ≦1/4.     

Die mikroanalytische Bestimmung des Thalliums und des Bleis

Ohne Zusammenfassung