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     

Decay of neutron-rich Ga isotopes near N = 50 at PARRNe

The PARRNe facility has been used to produce neutron-rich isotopes ^83,84Gaby the ISOL method. Their decay has been studied, and β-γ coincidence and γ-γ coincidence data were collected as a function of time. The first two excited levels in ⁸³Ge and the first excited level in ⁸⁴Ge have been measured for the first time.     

The magnetism of rare earth intermetallics RFe4Al8

Hyperfine Interactions - The YFe4Al8 and ErFe4Al8 intermetallics were studied by57Fe Mössbauer spectroscopy between 2 K and room temperature. The spectra are consistent with iron occupying 8f...     

High pressure mössbauer studies of magnetic actinide systems

Due to the wider radial extent of 5f electrons when compared to their 4f counterparts, intermetallics of the light actinides show a broad spectrum of magnetic properties ranging from the localized magnetism of the lanthanides to the itinerant magnetism often found in transition metal compounds. One parameter which strongly influences the magnetic character of the compound is the actinide-actinide separation which can experimentally be varied by the application of high pressure. The question of 5f electron delocalization will be reviewed with respect to Moesshauer high pressure data on NpCo₂si₂, NpAl₂, NpOs₂ and new results will be presented of NpAs. The connection of hyperfine parameters with results of X-ray diffraction studies will be discussed.Work supported by the Bundesministerium für Forschung und Technologie, Federal Republic of Germany     

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.     

Temperature switch based on optical bistability

We have demonstrated a temperature switch based on an optically bistable device integrated with an optical fibre. The principle demonstrated here might lead to the development of new types of all-optical temperature sensors.     

Simple Constructions of Almost k-wise Independent Random Variables

We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is (2 + o(1)) (log log n + k/2 + log k + log 1/?), where ? is the statistical difference between the distribution induced on any k bit locations and the uniform distribution. This is asymptotically comparable to the construction recently presented by Naor and Naor (our size bound is better as long as ? < 1/(k log n)). An additional advantage of our constructions is their simplicity.