A note on Hadwiger’s conjecture for W5-free graphs with independence number two

The Hadwiger number of a graph $G$, denoted $h\left(G\right)$, is the largest integer $t$ such that $G$ contains $K_t$ as a minor. A famous conjecture due to Hadwiger in 1943 states that for every graph $G$, $h\left(G\right)\ge \chi \left(G\right)$, where $\chi \left(G\right)$ denotes the chromatic number of $G$. Let $\alpha \left(G\right)$ denote the independence number of $G$. A graph is $H$-free if it does not contain the graph $H$ as an induced subgraph. In 2003, Plummer, Stiebitz and Toft proved that $h\left(G\right)\ge \chi \left(G\right)$ for all $H$-free graphs $G$ with $\alpha \left(G\right)\le 2$, where $H$ is any graph on four vertices with $\alpha \left(H\right)\le 2$, $H=C_5$, or $H$ is a particular graph on seven vertices. In 2010, Kriesell subsequently generalized the statement to include all forbidden subgraphs $H$ on five vertices with $\alpha \left(H\right)\le 2$. In this note, we prove that $h\left(G\right)\ge \chi \left(G\right)$ for all $W_5$-free graphs $G$ with $\alpha \left(G\right)\le 2$, where $W_5$ denotes the wheel on six vertices.     

Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups

We examine two criteria for balance of a gain graph, one based on binary cycles and one on circles. The graphs for which each criterion is valid depend on the set of allowed gain groups. The binary cycle test is invalid, except for forests, if any possible gain group has an element of odd order. Assuming all groups are allowed, or all abelian groups, or merely the cyclic group of order 3, we characterize, both constructively and by forbidden minors, the graphs for which the circle test is valid. It turns out that these three classes of groups have the same set of forbidden minors. The exact reason for the importance of the ternary cyclic group is not clear. © 2005 Wiley Periodicals, Inc. J Graph Theory     

Achievable sets, brambles, and sparse treewidth obstructions

One consequence of the graph minor theorem is that for every k there exists a finite obstruction set Obs(TW?k). However, relatively little is known about these sets, and very few general obstructions are known. The ones that are known are the cliques, and graphs which are formed by removing a few edges from a clique. This paper gives several general constructions of minimal forbidden minors which are sparse in the sense that the ratio of the treewidth to the number of vertices n does not approach 1 as n approaches infinity. We accomplish this by a novel combination of using brambles to provide lower bounds and achievable sets to demonstrate upper bounds. Additionally, we determine the exact treewidth of other basic graph constructions which are not minimal forbidden minors.     

Some Recent Progress and Applications in Graph Minor Theory

In the core of the seminal Graph Minor Theory of Robertson and Seymour lies a powerful theorem capturing the ``rough' structure of graphs excluding a fixed minor. This result was used to prove Wagner's Conjecture that finite graphs are well-quasi-ordered under the graph minor relation. Recently, a number of beautiful results that use this structural result have appeared. Some of these along with some other recent advances on graph minors are surveyed. Research partly supported by Japan Society for the Promotion of Science, Grant-in-Aid for Scientific Research, Grant number 16740044, by Sumitomo Foundation, by C & C Foundation and by Inoue Research Award for Young Scientists Supported in part by the Research Grant P1–0297 and by the CRC program On leave from: IMFM & FMF, Department of Mathematics, University of Ljubljana, Ljubljana, Slovenia     

Intensités des Transitions Électroniques de [PdCl4]2− Intensities of Electronic Transitions of [PdCl4]2−

The oscillator strengths of the symmetry-forbidden transitions of the ion [PdCl₄]^2– were calculated by a method based on the evaluation of the MO of the distorted ion. It is not very likely that the transition to¹ B _1g (a _1g (d _z ²)b _1g ) state, weak, mainlyz polarized, explains the band that appears as a shoulder observed towards 30 000 cm^–1 in the absorption spectrum. If this band is specific of the ion [PdCl₄]^2–, the assignment to the forbidden charge-transfer transition,¹ A _1g ¹ B _2g , is more plausible.

     

The influence of minor components on the structural reorganization in glassforming materials

Correlation of structure parameters of glasses and related crystals formed in homogeneous or heterogeneous nucleation processes by thermal treatment is discussed on the basis of DTA, TG and EGA measurements in relation to the textural patterns of the materials. For cordierite glass, crystallization of metastable disordered cordierite polymorphs is related to an exothermic heat evolution and simultaneous with a small weight loss (appr. 0.025%). By MS-EGA, evolution of water was determined during the transformation of the metastable melt to a metastable intermediate crystalline phase. Interpretation of the crystallization by comparing the available structure parameters of cordierite glasses and crystals alone is insufficient to explain the role of water in the kinetics of crystallization. Optical and electron microscopy of the primary crystallization phenomena show the metastable solid solution with low quartz-type structure. Interpretation of the crystallization behaviour in terms of conventional theory of nucleation and crystal growth is impossible.     

Anomalies of the partition coefficient and properties of crystals in the region of low concentrations of an isomorphous admixture. 1. Unusual decomposition of solid solutions of the NaCl—CdCl2 system

Solid solutions NaCl—CdCl₂ were studied in an interval of CdCl₂ concentrations of 0.05—3 mol.% by Raman spectroscopy. The molecular form Na₂CdCl₄ decomposes: Na₂CdCl₄ 2Na⁺ + Cd²⁺ + 2Cl₂ ^– + 2e^–; 2Na + 2e^– 2Na⁰. Free sodium atoms form color centers of crystal (F centers) in the region of jumpwise changing the partition coefficient of CdCl₂ in NaCl (K jump).