Related papers: Equitable 2-partitions of the Johnson graphs $J(n,…

We show that given an $n$-vertex graph $G$ of diameter 3 we can decide if $G$ is $3$-colourable in time $2^{O(n^{2/3-\varepsilon})}$ for any $\varepsilon < 1/33$. This improves on the previous best algorithm of $2^{O((n\log n)^{2/3})}$ from…

This study is the first part of a detailed study on Type-2 isomorphic circulant graphs having ten parts \cite{v2-1}-\cite{v2-10}. Circulant graphs $C_n(R)$ and $C_n(S)$ are said to be \emph{Adam's isomorphic} if there exist some $a\in…

In this paper we compute the signature for a family of knots $W(k,n)$, the weaving knots of type $(k,n)$. By work of E.~S.~Lee the signature calculation implies a vanishing theorem for the Khovanov homology of weaving knots. Specializing to…

We compute the Orchard crossing number, which is defined in a similar way to the rectilinear crossing number, for the complete bipartite graphs K_{n,n}.

Token ring topology has been frequently used in the design of distributed loop computer networks and one measure of its performance is the diameter. We propose an algorithm for constructing hamiltonian graphs with $n$ vertices and maximum…

In the paper, we first classify all polynomial maps of the form $H=(u(x,y,z),v(x,y,z), h(x,y))$ in the case that $JH$ is nilpotent and $\deg_zv\leq 1$. After that, we generalize the structure of $H$ to…

We consider the problem of partitioning a graph into a non-fixed number of non-overlapping subgraphs of maximum density. The density of a partition is the sum of the densities of the subgraphs, where the density of a subgraph is its average…

We suggest an extension of a certain logarithm of the total Johnson map in terms of solvable Lie groups. Here, the domain of the map is extended to a subset consisting of exponential solvable elements in the mapping class group of a…

If an integer $n$ is written as a sum of two biquadrates in two different ways, then the elliptic curve $y^2=x^3-nx$ has rank $\geq 3$. If moreover $n$ is odd and the parity conjecture is true, then it has even rank $\geq 4$. Finally, some…

In this paper, we present two main results. First, by only one conjecture (Conjecture 2.9) for recognizing a vertex symmetric graph, which is the hardest task for our problem, we construct an algorithm for finding an isomorphism between two…

The Unfriendly Partition Conjecture posits that every countable graph admits a 2-colouring in which for each vertex there are at least as many bichromatic edges containing that vertex as monochromatic ones. This is not known in general, but…

We consider the problem of partitioning the edge set of a graph $G$ into the minimum number $\tau(G)$ of edge-disjoint complete bipartite subgraphs. We show that for a random graph $G$ in $G(n,p)$, for $p$ is a constant no greater than…

Even the most superficial glance at the vast majority of crossing-minimal geometric drawings of $K_n$ reveals two hard-to-miss features. First, all such drawings appear to be 3-fold symmetric (or simply {\em 3-symmetric}) . And second, they…

We classify closed, conformally flat Lorentzian manifolds of dimension $n \geq 3$ with unipotent holonomy in PO(2,n). They are all Kleinian and fall into four different geometric types according to the intersection of the image of the…

We describe computational results about undirected graphs having $10$ vertices and automorphism group isomorphic to $\mathbb{Z}/4\mathbb{Z}$.

Let $G$ be the circulant graph $C_n(S)$ with $S\subseteq\{ 1,\ldots,\left \lfloor\frac{n}{2}\right \rfloor\}$ and let $\Delta$ be its independence complex. We describe the well-covered circulant graphs with 2-dimensional $\Delta$ and…

Let $C$ be a curve of genus 2 and $\psi_1:C \lar E_1$ a map of degree $n$, from $C$ to an elliptic curve $E_1$, both curves defined over $\bC$. This map induces a degree $n$ map $\phi_1:\bP^1 \lar \bP^1$ which we call a Frey-Kani covering.…

We exhibit a one-to-one correspondence between $3$-colored graphs and subarrangements of certain hyperplane arrangements denoted $\mathcal J_n$, $n \in \mathbb N$. We define the notion of centrality of $3$-colored graphs which corresponds…

Let $G$ be a graph which belongs to either of the following classes: (i) bipartite graphs, (ii) unmixed graphs, or (iii) claw--free graphs. Assume that $J(G)$ is the cover ideal $G$ and $J(G)^{(k)}$ is its $k$-th symbolic power. We prove…

A bipartite graph $G=(V,E)$ with $V=V_1\cup V_2$ is biregular if all the vertices of each stable set, $V_1$ and $V_2$, have the same degree, $r$ and $s$, respectively. This paper studies difference sets derived from both Abelian and…