On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016     

LA RECONSTRUCTION DES TOURNOIS SANS DIAMANT

We prove that if T is a tournament of order n > 6 in which any 4-sub-tournament is hamiltonian or transitive, then T is reconstructible in the sense of Ulam.     

Linear Ramsey numbers of sparse graphs

The Ramsey number R(G₁,G₂) of two graphs G₁ and G₂ is the least integer p so that either a graph G of order p contains a copy of G₁ or its complement G^c contains a copy of G₂. In 1973, Burr and Erd?s offered a total of $25 for settling the conjecture that there is a constant c = c(d) so that R(G,G)≤ c|V(G)| for all d‐degenerate graphs G, i.e., the Ramsey numbers grow linearly for d‐degenerate graphs. We show in this paper that the Ramsey numbers grow linearly for degenerate graphs versus some sparser graphs, arrangeable graphs, and crowns for example. This implies that the Ramsey numbers grow linearly for degenerate graphs versus graphs with bounded maximum degree, planar graphs, or graphs without containing any topological minor of a fixed clique, etc. © 2005 Wiley Periodicals, Inc. J Graph Theory     

Large families of mutually embeddable vertex‐transitive graphs

For each infinite cardinal κ, we give examples of 2^κ many non‐isomorphic vertex‐transitive graphs of order κ that are pairwise isomorphic to induced subgraphs of each other. We consider examples of graphs with these properties that are also universal, in the sense that they embed all graphs with smaller orders as induced subgraphs. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 99–106, 2003     

Maximal σ‐polynomials of connected 3‐chromatic graphs

In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if c_i(G) ≤ c_i(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where c_i(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003     

Preparation and characterization of mesoporous silica thin films from polyethoxysiloxanes

Tetraethoxysilane (TEOS) and polyethoxysiloxanes (PEOSs; prepared by the acid‐catalyzed hydrolytic polycondensation of TEOS) were subjected to the sol–gel process in the presence of cetyltrimethylammonium bromide (CTAB), respectively. The PEOSs with M_w 700–26,000, as prepared by sol–gel coating of TEOS and PEOS under various conditions, were used. Uniform and crack‐free thin films of thickness 276–613 nm were prepared by spin‐coating of a PEOS solution containing CTAB. When the coating films were sintered at 400 °C, the combustion of ethoxy groups and CTAB took place to provide porous silica thin films. The structure of the thin films was found to be dependent on the molecular weight of PEOS and the molar ratio of CTAB/Si: lamellar or hexagonal phase was observed for M_w less than 15,000 and for CTAB/Si molar ratios greater than 0.10. Honeycomb structures were observed for M_w less than 5000 and for CTAB/Si molar ratios of 0.15. The honeycomb structure was also observed by atomic force microscopy and transmission electron microscope. © 2006 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 44: 2542–2550, 2006     

A “Multiplicative Coboundary” theorem for some sequences of random matrices

Schmidt(¹⁰) showed that if the family of distributions of the partial sums of a strictly stationary random sequence is tight, then that random sequence is a coboundary. Here an analog of that result is proved for some sequences of random matrices, with partial sums replaced by matrix products.     

The occupation time of Brownian motion in a ball

LetW be a Wiener process of dimensiond3, starting from 0, and letX(t) be the total time spent byW in the ball centered at 0 with radiust. We give an affirmative answer to a conjecture of Taylor and Tricot⁽¹⁶⁾ on the tail distribution ofX(t). Lévy's lower functions ofX(t) are characterized by an integral test.     

A central limit theorem for age- and density-dependent population processes

Consider a population consisting of one type of individual living in a fixed region with area A. In [8], we constructed a stochastic population model in which the death rate is affected by the age of the individual and the birth rate is affected by the population density P_A(t), i.e., the population size divided by the area A of the given region. In [8], we proposed a continuous deterministic model which in general is a nonlinear Volterra type integral equation and proved that under appropriate conditions the sequence P_A(t) would converge to the solution P(t) of our integral equation in the sense that

$\text{lim}\text{→∞}\text{P}\text{sup}\text{0?s?t}\text{|P}{}_{\mathrm{A}}\text{(s) ? P(s)|>ε}\text{=0}\text{for every}\text{ε > 0}$

.In this paper, we obtain a “central limit theorem” for the random element √A(P_A(t)?P(t)). We prove that under appropriate conditions √A(P_A(t)?P(t)) will converge to a Gaussian process. (See Theorem 3.4 for the explicit formula of this Gaussian process.)