Vertex-disjoint rainbow triangles in edge-colored graphs

Let $G$ be an edge-colored graph of order $n$. The minimum color degree of $G$, denoted by ${\delta }^c\left(G\right)$, is the largest integer $k$ such that for every vertex $v$, there are at least $k$ distinct colors on edges incident to $v$. We say that an edge-colored graph is rainbow if all its edges have different colors. In this paper, we consider vertex-disjoint rainbow triangles in edge-colored graphs. Li (2013) showed that if ${\delta }^c\left(G\right)\ge (n+1)∕2$, then $G$ contains a rainbow triangle and the lower bound is tight. Motivated by this result, we prove that if $n\ge 20$ and ${\delta }^c\left(G\right)\ge (n+2)∕2$, then $G$ contains two vertex-disjoint rainbow triangles. In particular, we conjecture that if ${\delta }^c\left(G\right)\ge (n+k)∕2$, then $G$ contains $k$ vertex-disjoint rainbow triangles. For any integer $k\ge 2$, we show that if $n\ge 16k-12$ and ${\delta }^c\left(G\right)\ge n∕2+k-1$, then $G$ contains $k$ vertex-disjoint rainbow triangles. Moreover, we provide sufficient conditions for the existence of $k$ edge-disjoint rainbow triangles.     

Design and development of a two‐dimensional system based on hydrophilic and reversed‐phase liquid chromatography with on‐line sample treatment for the simultaneous separation of excreted xenobiotics and endogenous metabolites in urine

In the present work we describe a two‐dimensional liquid chromatographic system (2D‐LC) with detection by mass spectrometry (MS) for the simultaneous separation of endogenous metabolites of clinical interest and excreted xenobiotics deriving from exposure to toxic compounds. The 2D‐LC system involves two orthogonal chromatographic modes, hydrophilic interaction liquid chromatography (HILIC) to separate polar endogenous metabolites and reversed‐phase (RP) chromatography to separate excreted xenobiotics of low and intermediate polarity. Additionally, the present proposal has the novelty of incorporating an on‐line sample treatment based on the use of restricted access materials (RAMs), which permits the direct injection of urine samples into the system. The work is focused on the instrumental coupling, studying all possible options and attempting to circumvent the problems of solvent incompatibility between the RAM device and the two chromatographic columns, HILIC and RP. The instrumental configuration developed, RAM‐HILIC‐RPLC‐MS/MS, allows the simultaneous assessment of urinary metabolites of clinical interest and excreted compounds derived from exposure to toxic agents with minimal sample manipulation. Thus, it may be of interest in areas such as occupational and environmental toxicology in order to explore the possible relationship between the two types of compounds. Copyright © 2015 John Wiley & Sons, Ltd.     

Strong edge-coloring for planar graphs with large girth

A strong edge-coloring of a graph $G=(V,E)$ is a partition of its edge set $E$ into induced matchings. Let $G$ be a connected planar graph with girth $k\ge 26$ and maximum degree $\Delta$. We show that either $G$ is isomorphic to a subgraph of a very special $\Delta$-regular graph with girth $k$, or $G$ has a strong edge-coloring using at most $2\Delta +\lceil \frac{12(\Delta -2)}{k}\rceil$ colors.     

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     

Coxeter Transformation and Quasiquivers

Mathematical Notes -