Minimum Sum Edge Colorings of Multicycles

In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assigned to the edges is minimum. The {\em chromatic edge strength} of a graph is the minimum number of colors required in a minimum sum edge coloring of this graph. We study the case of multicycles, defined as cycles with parallel edges, and give a closed-form expression for the chromatic edge strength of a multicycle, thereby extending a theorem due to Berge. It is shown that the minimum sum can be achieved with a number of colors equal to the chromatic index. We also propose simple algorithms for finding a minimum sum edge coloring of a multicycle. Finally, these results are generalized to a large family of minimum cost coloring problems

Knot Theory: from Fox 3-colorings of links to Yang-Baxter homology and Khovanov homology

This paper is an extended account of my "Introductory Plenary talk at Knots in Hellas 2016" conference We start from the short introduction to Knot Theory from the historical perspective, starting from Heraclas text (the first century AD), mentioning R.Llull (1232-1315), A.Kircher (1602-1680), Leibniz idea of Geometria Situs (1679), and J.B.Listing (student of Gauss) work of 1847. We spend some space on Ralph H. Fox (1913-1973) elementary introduction to diagram colorings (1956). In the second section we describe how Fox work was generalized to distributive colorings (racks and quandles) and eventually in the work of Jones and Turaev to link invariants via Yang-Baxter operators, here the importance of statistical mechanics to topology will be mentioned. Finally we describe recent developments which started with Mikhail Khovanov work on categorification of the Jones polynomial. By analogy to Khovanov homology we build homology of distributive structures (including homology of Fox colorings) and generalize it to homology of Yang-Baxter operators. We speculate, with supporting evidence, on co-cycle invariants of knots coming from Yang-Baxter homology. Here the work of Fenn-Rourke-Sanderson (geometric realization of pre-cubic sets of link diagrams) and Carter-Kamada-Saito (co-cycle invariants of links) will be discussed and expanded. Dedicated to Lou Kauffman for his 70th birthday.Comment: 35 pages, 31 figures, for Knots in Hellas II Proceedings, Springer, part of the series Proceedings in Mathematics & Statistics (PROMS

Ramsey-nice families of graphs

For a finite family $\mathcal{F}$ of fixed graphs let $R_k(\mathcal{F})$ be the smallest integer $n$ for which every $k$-coloring of the edges of the complete graph $K_n$ yields a monochromatic copy of some $F\in\mathcal{F}$. We say that $\mathcal{F}$ is $k$-nice if for every graph $G$ with $\chi(G)=R_k(\mathcal{F})$ and for every $k$-coloring of $E(G)$ there exists a monochromatic copy of some $F\in\mathcal{F}$. It is easy to see that if $\mathcal{F}$ contains no forest, then it is not $k$-nice for any $k$. It seems plausible to conjecture that a (weak) converse holds, namely, for any finite family of graphs $\mathcal{F}$ that contains at least one forest, and for all $k\geq k_0(\mathcal{F})$ (or at least for infinitely many values of $k$), $\mathcal{F}$ is $k$-nice. We prove several (modest) results in support of this conjecture, showing, in particular, that it holds for each of the three families consisting of two connected graphs with 3 edges each and observing that it holds for any family $\mathcal{F}$ containing a forest with at most 2 edges. We also study some related problems and disprove a conjecture by Aharoni, Charbit and Howard regarding the size of matchings in regular 3-partite 3-uniform hypergraphs.Comment: 20 pages, 2 figure