A reconfigurations analogue of Brooks’ theorem.

Let G be a simple undirected graph on n vertices with maximum degree Δ. Brooks’ Theorem states that G has a Δ-colouring unless G is a complete graph, or a cycle with an odd number of vertices. To recolour G is to obtain a new proper colouring by changing the colour of one vertex. We show that from a k-colouring, k > Δ, a Δ-colouring of G can be obtained by a sequence of O(n 2) recolourings using only the original k colours unless G is a complete graph or a cycle with an odd number of vertices, or k = Δ + 1, G is Δ-regular and, for each vertex v in G, no two neighbours of v are coloured alike. We use this result to study the reconfiguration graph R k (G) of the k-colourings of G. The vertex set of R k (G) is the set of all possible k-colourings of G and two colourings are adjacent if they differ on exactly one vertex. It is known that if k ≤ Δ(G), then R k (G) might not be connected and it is possible that its connected components have superpolynomial diameter, if k ≥ Δ(G) + 2, then R k (G) is connected and has diameter O(n 2). We complete this structural classification by settling the missing case: if k = Δ(G) + 1, then R k (G) consists of isolated vertices and at most one further component which has diameter O(n 2). We also describe completely the computational complexity classification of the problem of deciding whether two k-colourings of a graph G of maximum degree Δ belong to the same component of R k (G) by settling the case k = Δ(G) + 1. The problem is O(n 2) time solvable for k = 3, PSPACE-complete for 4 ≤ k ≤ Δ(G), O(n) time solvable for k = Δ(G) + 1, O(1) time solvable for k ≥ Δ(G) + 2 (the answer is always yes)

Reconfiguration of Dominating Sets

We explore a reconfiguration version of the dominating set problem, where a dominating set in a graph $G$ is a set $S$ of vertices such that each vertex is either in $S$ or has a neighbour in $S$. In a reconfiguration problem, the goal is to determine whether there exists a sequence of feasible solutions connecting given feasible solutions $s$ and $t$ such that each pair of consecutive solutions is adjacent according to a specified adjacency relation. Two dominating sets are adjacent if one can be formed from the other by the addition or deletion of a single vertex. For various values of $k$, we consider properties of $D_k(G)$, the graph consisting of a vertex for each dominating set of size at most $k$ and edges specified by the adjacency relation. Addressing an open question posed by Haas and Seyffarth, we demonstrate that $D_{\Gamma(G)+1}(G)$ is not necessarily connected, for $\Gamma(G)$ the maximum cardinality of a minimal dominating set in $G$. The result holds even when graphs are constrained to be planar, of bounded tree-width, or $b$-partite for $b \ge 3$. Moreover, we construct an infinite family of graphs such that $D_{\gamma(G)+1}(G)$ has exponential diameter, for $\gamma(G)$ the minimum size of a dominating set. On the positive side, we show that $D_{n-m}(G)$ is connected and of linear diameter for any graph $G$ on $n$ vertices having at least $m+1$ independent edges.Comment: 12 pages, 4 figure

Independent Set Reconfiguration in Cographs

We study the following independent set reconfiguration problem, called TAR-Reachability: given two independent sets $I$ and $J$ of a graph $G$, both of size at least $k$, is it possible to transform $I$ into $J$ by adding and removing vertices one-by-one, while maintaining an independent set of size at least $k$ throughout? This problem is known to be PSPACE-hard in general. For the case that $G$ is a cograph (i.e. $P_4$-free graph) on $n$ vertices, we show that it can be solved in time $O(n^2)$, and that the length of a shortest reconfiguration sequence from $I$ to $J$ is bounded by $4n-2k$, if such a sequence exists. More generally, we show that if $X$ is a graph class for which (i) TAR-Reachability can be solved efficiently, (ii) maximum independent sets can be computed efficiently, and which satisfies a certain additional property, then the problem can be solved efficiently for any graph that can be obtained from a collection of graphs in $X$ using disjoint union and complete join operations. Chordal graphs are given as an example of such a class $X$

Ladder proof of nonlocality for two spin-half particles revisited

In this paper we extend the ladder proof of nonlocality without inequalities for two spin-half particles given by Boschi et al [PRL 79, 2755 (1997)] to the case in which the measurement settings of the apparatus measuring one of the particles are different from the measurement settings of the apparatus measuring the other particle. It is shown that, in any case, the proportion of particle pairs for which the contradiction with local realism goes through is maximized when the measurement settings are the same for each apparatus. Also we write down a Bell inequality for the experiment in question which is violated by quantum mechanics by an amount which is twice as much as the amount by which quantum mechanics violates the Bell inequality considered in the above paper by Boschi et al.Comment: LaTeX, 7 pages, 1 figure, journal versio

Reconfiguring Independent Sets in Claw-Free Graphs

We present a polynomial-time algorithm that, given two independent sets in a claw-free graph $G$, decides whether one can be transformed into the other by a sequence of elementary steps. Each elementary step is to remove a vertex $v$ from the current independent set $S$ and to add a new vertex $w$ (not in $S$) such that the result is again an independent set. We also consider the more restricted model where $v$ and $w$ have to be adjacent

A feasible quantum optical experiment capable of refuting noncontextuality for single photons

Elaborating on a previous work by Simon et al. [PRL 85, 1783 (2000)] we propose a realizable quantum optical single-photon experiment using standard present day technology, capable of discriminating maximally between the predictions of quantum mechanics (QM) and noncontextual hidden variable theories (NCHV). Quantum mechanics predicts a gross violation (up to a factor of 2) of the noncontextual Bell-like inequality associated with the proposed experiment. An actual maximal violation of this inequality would demonstrate (modulo fair sampling) an all-or-nothing type contradiction between QM and NCHV.Comment: LaTeX file, 8 pages, 1 figur

Two-particle entanglement as a property of three-particle entangled states

In a recent article [Phys. Rev. A 54, 1793 (1996)] Krenn and Zeilinger investigated the conditional two-particle correlations for the subensemble of data obtained by selecting the results of the spin measurements by two observers 1 and 2 with respect to the result found in the corresponding measurement by a third observer. In this paper we write out explicitly the condition required in order for the selected results of observers 1 and 2 to violate Bell's inequality for general measurement directions. It is shown that there are infinitely many sets of directions giving the maximum level of violation. Further, we extend the analysis by the authors to the class of triorthogonal states |Psi> = c_1 |z_1>|z_2>|z_3> + c_2 |-z_1>|-z_2>|-z_3>. It is found that a maximal violation of Bell's inequality occurs provided the corresponding three-particle state yields a direct ("all or nothing") nonlocality contradiction.Comment: REVTeX, 7 pages, no figure

Three-particle entanglement versus three-particle nonlocality

The notions of three-particle entanglement and three-particle nonlocality are discussed in the light of Svetlichny's inequality [Phys. Rev. D 35, 3066 (1987)]. It is shown that there exist sets of measurements which can be used to prove three-particle entanglement, but which are nevertheless useless at proving three-particle nonlocality. In particular, it is shown that the quantum predictions giving a maximal violation of Mermin's three-particle Bell inequality [Phys. Rev. Lett. 65, 1838 (1990)] can be reproduced by a hybrid hidden variables model in which nonlocal correlations are present only between two of the particles. It should be possible, however, to test the existence of both three-particle entanglement and three-particle nonlocality for any given quantum state via Svetlichny's inequality.Comment: REVTeX4, 4 pages, journal versio

Analysis of s-triazine-degrading microbial communities in soils using most-probable-number enumeration and tetrazolium-salt detection

A simple and sensitive method for the detection and enumeration of microbial s-triazine-degrading microorganisms in soil was designed. The procedure is based on the ability of some microbes to use s-triazines, such as simazine, atrazine, and cyanuric acid, as sole nitrogen source. It employs the respiration indicator 2,3,5-triphenyl-2H-tetrazolium chloride (TTC) to detect metabolic activity and the most-probable-number (MPN) enumeration in microtiter plates. The method was used to identify simazine- and cyanuric acid-degrading activities in agricultural soils treated with the herbicide simazine. The MPN-TTC method showed that the number of simazine- and cyanuric acid-degrading microorganisms increased four weeks after the herbicide simazine had been applied. [Int Microbiol 2007; 10(3):209-215