Related papers: Planar rook algebra with colors and Pascal's simpl…
Mantel's Theorem asserts that a simple $n$ vertex graph with more than $\frac{1}{4}n^2$ edges has a triangle (three mutually adjacent vertices). Here we consider a rainbow variant of this problem. We prove that whenever $G_1, G_2, G_3$ are…
In this paper we prove that every recursively presented Lie algebra over a field which is a finite extention of its simple subfield can be embedded in a recursively presented Lie algebra defined by relations which are equalities of…
A path in an edge-colored graph is said to be rainbow if no color repeats on it. An edge-colored graph is said to be rainbow $k$-connected if every pair of vertices is connected by $k$ internally disjoint rainbow paths. The rainbow…
A k-edge-weighting of a graph G is a function w: E(G)->{1,2,...,k}. An edge-weighting naturally induces a vertex coloring c, where for every vertex v in V(G), c(v) is sum of weights of the edges that are adjacent to vertex v. If the induced…
Fomin and Zelevinsky show that a certain two-parameter family of rational recurrence relations, here called the (b,c) family, possesses the Laurentness property: for all b,c, each term of the (b,c) sequence can be expressed as a Laurent…
Given two planar graphs that are defined on the same set of vertices, a RAC simultaneous drawing is one in which each graph is drawn planar, there are no edge overlaps and the crossings between the two graphs form right angles. The…
Trace diagrams are structured graphs with edges labeled by matrices. Each diagram has an interpretation as a particular multilinear function. We provide a rigorous combinatorial definition of these diagrams using a notion of signed graph…
We introduce the notion of a properly ordered coloring (POC) of a weighted graph, that generalizes the notion of vertex coloring of a graph. Under a POC, if $xy$ is an edge, then the larger weighted vertex receives a larger color; in the…
The clique chromatic number of a graph is the smallest number of colors in a vertex coloring so that no maximal clique is monochromatic. In this paper, we determine the order of magnitude of the clique chromatic number of the random graph…
A path in an edge-colored graph $G$ is called a rainbow path if no two edges of the path are colored the same. The minimum number of colors required to color the edges of $G$ such that every pair of vertices are connected by at least $k$…
A proper coloring of a graph $G$ is said to be a strong odd coloring of $G$, if for every vertex $v$ and every color $c$, either $c$ appears on an odd number of vertices in the neighborhood of $v$ or $c$ is absent in the neighborhood of…
A mixed hypergraph is a triple $H=(V,\mathcal{C},\mathcal{D})$, where $V$ is a set of vertices, $\mathcal{C}$ and $\mathcal{D}$ are sets of hyperedges. A vertex-coloring of $H$ is proper if $C$-edges are not totally multicolored and…
In this paper we construct inverse bijections between two sequences of finite sets. One sequence is defined by planar diagrams and the other by lattice walks. G. Kuperberg has shown that the number of elements in these two sets are equal.…
It is shown that a SU(1,1) algebra may be used to provide a unified description of the simple hamonic oscillator and the angular momentum algebras and a class of other semi-infinite algebras. A normal ordered representation of a Unitary…
Here we show that by expressing a van der Waerden number $W(r, k)$ by its radix polynomial representation, it not only is possible to locate each proper subset on $\mathbb{R}$ in which the van der Waerden number lies, but also to show that…
This article is about applications of linear algebra to knot theory. For example, for odd prime p, there is a rule (given in the article) for coloring the arcs of a knot or link diagram from the residues mod p. This is a knot invariant in…
Answering a question raised by Dudek and Pra\l{}at, we show that if $pn\rightarrow \infty$, w.h.p.,~whenever $G=G(n,p)$ is $2$-coloured, there exists a monochromatic path of length $n(2/3+o(1))$. This result is optimal in the sense that…
In this paper we have given a unified graph coloring algorithm for planar graphs. The problems that have been considered in this context respectively, are vertex, edge, total and entire colorings of the planar graphs. The main tool in the…
We introduce a class of pairs of graphs consisting of two cliques joined by an arbitrary number of edges. The members of a pair have the property that the clique-bridging edge-set of one graph is the complement of that of the other. We…
Denote by $R(G_1, G_2, G_3)$ the minimum integer $N$ such that any three-colouring of the edges of the complete graph on $N$ vertices contains a monochromatic copy of a graph $G_i$ coloured with colour $i$ for some $i\in{1,2,3}$. In a…