On the multi‐colored Ramsey numbers of cycles

For a graph L and an integer k≥2, R_k(L) denotes the smallest integer N for which for any edge‐coloring of the complete graph K_N by k colors there exists a color i for which the corresponding color class contains L as a subgraph. Bondy and Erdos conjectured that, for an odd cycle C_n on n vertices, They proved the case when k = 2 and also provided an upper bound R_k(C_n)≤(k+ 2)!n. Recently, this conjecture has been verified for k = 3 if n is large. In this note, we prove that for every integer k≥4, When n is even, Sun Yongqi, Yang Yuansheng, Xu Feng, and Li Bingxi gave a construction, showing that R_k(C_n)≥(k?1)n?2k+ 4. Here we prove that if n is even, then © 2011 Wiley Periodicals, Inc. J Graph Theory 69: 169‐175, 2012     

Total linearization of probability density evolution equations

Total linearization of the Boltzmann and Vlasov equations is used to present a technique applicable to equations which have polynomial-type nonlinearities and describe the evolution of probability density functions or distributions. It is an extension of an earlier result, where a method yielding a linear equation with a nonlinear constraint was presented.     

Splittings in the variety of residuated lattices

It is shown that the only algebra that splits the lattice of subvarieties of the variety of residuated lattices is the two element boolean algebra. Received October 4, 1999; accepted in final form August 11, 2000.     

Turán numbers for odd wheels

The Turán number $\text{ex}(n,G)$ is the maximum number of edges in any $n$-vertex graph that does not contain a subgraph isomorphic to $G$. A wheel$W_n$ is a graph on $n$ vertices obtained from a $C_{n?1}$ by adding one vertex $w$ and making $w$ adjacent to all vertices of the $C_{n?1}$. We obtain two exact values for small wheels:

$\text{ex}(n,W_5)=?\frac{n^2}{4}+\frac{n}{2}?,$

$\text{ex}(n,W_7)=?\frac{n^2}{4}+\frac{n}{2}+1?.$

Given that $\text{ex}(n,W_6)$ is already known, this paper completes the spectrum for all wheels up to 7 vertices. In addition, we present the construction which gives us the lower bound $\text{ex}(n,W_{2k+1})>?\frac{n^2}{4}?+?\frac{n}{2}?$ in general case.     

Ergodic properties of Poisson processes with almost periodic intensity

Summary We discuss in this paper a non-homogeneous Poisson process A driven by an almost periodic intensity function. We give the stationary version A ^* and the Palm version A ⁰ corresponding to A ^*. Let (T _i ,i) be the inter-point distance sequence in A and (T _i ⁰ ,i) in A ⁰. We prove that forj, the sequence (T _i+j,i) converges in distribution to (T _i ⁰ ,i). If the intensity function is periodic then the convergence is in variation.     

A Note on the Game Chromatic Index of Graphs

In this note we prove that the game chromatic index χ _g ^′(G) of a graph G of arboricity k is at most Δ + 3k − 1. This improves a bound obtained by Cai and Zhu [J. Graph Theory 36 (2001), 144–155] for k-degenerate graphs. Tomasz Bartnicki: Research of the first author is supported by a PhD grant from Polish Ministry of Science and Higher Education N201 2128 33. Received: November 1, 2006. Final version received: December 22, 2007.     

Background removal procedure for rapid scan EPR

In rapid scan EPR the changing magnetic field creates a background signal with components at the scan frequency and its harmonics. The amplitude of the background signal increases with scan width and is more significant for weak EPR signals such as are obtained in the presence of magnetic field gradients. A procedure for distinguishing this background from the EPR signal is proposed, mathematically described, and tested for various experimental conditions.