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     

Ferromagnetic Properties of Bond-Dilution and Random Positive or Negative Uniaxial Anisotropy Blume-Capel Model

We study the ferromagnetic properties of spin-1 system, which is considered in the frame of the bond dilution and random positive or negative anisotropy Blume-Capel model in the effective field theory and a cutting approximation. The investigation of phase diagrams displays some rich properties of the trajectory of tricritical point, reentrant henomena at low temperatures. Under certain both bond concentrations and random negative anisotropy, there are new transition lines of double tricritical points. So special emphasis is placed on the influence of the bond dilution and random anisotropy on phase diagrams. The magnetizations of the system are also discussed. Some results have not been evealed in previous reports.     

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     

Ab initio calculations of small hydrides including electron correlation

Five different structures of CH₅ ⁺ and one structure of CH₅ ^– are calculated using a gaussian basis both in the SCF approximation and with the inclusion of electron correlation in the independent electron pair approximation (IEPA). While on SCF level the C _sstructure of CH₅ ⁺ has to lowest energy, the energy difference between the C _sand C _2vstructures becomes negligible if correlation is included. In contrast to this the approach of a proton to CH₄ at large and intermediate distances is most favorable towards a corner of the CH₄ tetrahedron which means a structure. The decomposition of CH₅ ⁺ into CH₃ ⁺ and H₂ requires 20kcal/mol on SCF level and 40 kcal/mol if correlation is included.     

Self-avoiding walks and trees in spread-out lattices

LetG _R be the graph obtained by joining all sites ofZ ^d which are separated by a distance of at mostR. Let (G _R ) denote the connective constant for counting the self-avoiding walks in this graph. Let (G _R ) denote the coprresponding constant for counting the trees embedded inG _R . Then asR, (G _R ) is asymptotic to the coordination numberk _R ofG _R , while (G _R ) is asymptotic toek _R. However, ifd is 1 or 2, then (G _R )-k _R diverges to –.Dedicated to Oliver Penrose on this occasion of his 65th birthday.