Related papers: The strong slope conjecture for cablings and conne…

In this paper we disprove a twenty-two year old theorem about the structure of the Kauffman bracket skein module of the connected sum of two handlebodies. We achieve this by analysing handle slidings on compressing discs in a handlebody. We…

We prove the following sharp estimate for the number of spanning trees of a graph in terms of its vertex-degrees: a simple graph $G$ on $n$ vertices has at most $(1/n^{2}) \prod_{v \in V(G)} (d(v)+1)$ spanning trees. This result is tight…

In this paper we consider two natural notions of connectivity for hypergraphs: weak and strong. We prove that the strong vertex connectivity of a connected hypergraph is bounded by its weak edge connectivity, thereby extending a theorem of…

In a 1977 paper, Steffens identified an elegant criterion for determining when a countable graph has a perfect matching. In this paper, we will investigate the proof-theoretic strength of this result and related theorems. We show that a…

We give short expositions of both Leighton's proof and the Bass-Kulkarni proof of Leighton's graph covering theorem, in the context of colored graphs. We discuss a further generalization, needed elsewhere, to "symmetry-restricted graphs."…

We prove the Strengthened Hanna Neumann Conjecture. We give a more direct cohomological interpretation of the conjecture in terms of "typical" covering maps, and use graph Galois theory to "symmetrize" the conjecture. The conjecture is then…

We define a new notion of thin position for a graph in a 3-manifold which combines the ideas of thin position for manifolds first originated by Scharlemann and Thompson with the idea of thin position for knots first originated by Gabai.…

In this paper we use the connected sum operation on knots to show that there is a one-to-one relation between knots and numbers. In this relation prime knots are bijectively assigned with prime numbers such that the prime number 2…

This is a companion note to our paper 'Some advances on Sidorenko's conjecture', elaborating on a remark in that paper that the approach which proves Sidorenko's conjecture for strongly tree-decomposable graphs may be extended to a broader…

We characterise the cabling operations on the weight systems of finite type knot invariants. The eigenvectors and eigenvalues of this family of operations are described over the cable eigenbasis. The action of immanent weight systems on…

Directed graphs are widely used in modelling of nonsymmetric relations in various sciences and engineering disciplines. We discuss invariants of strongly connected directed graphs - minimal number of vertices or edges necessary to remove to…

A long-standing Conjecture of S. Negami states that a connected graph has a finite planar cover if and only if it embeds in the projective plane. It is known that the Conjecture is equivalent to the fact that \emph{the graph $K_{1,2, 2, 2}$…

We provide a simple proof for the union-closed sets conjecture, a long-standing open problem in set theory with immediate applications to graph theory, number theory, and order-theory.

The generalized $k$-connectivity $\kappa_{k}(G)$ of a graph $G$, which was introduced by Chartrand et al.(1984) is a generalization of the concept of vertex connectivity. Let $G$ and $H$ be nontrivial connected graphs. Recently, Li et al.…

Throttling in graphs optimizes a sum or product of resources used, such as the number of vertices in an initial set, and time required, such as the propagation time, to complete a given task. We introduce a new technique to establish sharp…

In this paper we present a proof system that operates on graphs instead of formulas. Starting from the well-known relationship between formulas and cographs, we drop the cograph-conditions and look at arbitrary undirected) graphs. This…

A joint of a set of lines $\mathcal{L}$ in $\mathbb{F}^d$ is a point that is contained in $d$ lines with linearly independent directions. The joints problem asks for the maximum number of joints that are formed by $L$ lines. Guth and Katz…

We investigate the possibility that unification occurs at strong coupling. We show that, despite the fact the couplings pass through a strong coupling regime, accurate predictions for their low energy values are possible because the…

Let $E,F$ be two topological spaces and $u:E\rightarrow F$ be a map. \ If $F$ is Haudorff and $u$ is continuous, then its graph is closed. \ \ The Closed Graph Theorem establishes the converse when $E$ and $F$ are suitable objects of…

In this paper we study some consequences of the author's classification of graph manifolds by their profinite fundamental groups. In particular we study commensurability, the behaviour of knots, and relation to mapping classes. We prove…