Related papers: Structure and enumeration of K4-minor-free links a…

Jin and Lee proved the following: Suppose that $D_1, \dots, D_n$ are link diagrams. Given a link $L$ which is partitioned into sublinks $L_1, \dots, L_n$ admitting diagrams $D_1, \dots, D_n$ respectively, there is a diagram $D$ of $L$ whose…

We find the minimal number of links in an embedding of any complete $k$-partite graph on 7 vertices (including $K_7$, which has at least 21 links). We give either exact values or upper and lower bounds for the minimal number of links for…

We introduce a 4-dimensional analogue of the rational Seifert genus of a knot $K\subset Y$, which we call the rational slice genus, that measures the complexity of a homology class in $H_2(Y\times [0,1],K;\mathbb{Q})$. Our main theorem is a…

The nonorientable four-ball genus of a knot $K$ in $S^3$ is the minimal first Betti number of nonorientable surfaces in $B^4$ bounded by $K$. By amalgamating ideas from involutive knot Floer homology and unoriented knot Floer homology, we…

The purpose of this paper is to characterize graphs that do not have a large $K_{2,n}$-minor. As corollaries, it is proved that, for any given positive integer $n$, every sufficiently large 3-connected graph with minimum degree at least…

We characterize classes of graphs closed under taking vertex-minors and having no $P_n$ and no disjoint union of $n$ copies of the $1$-subdivision of $K_{1,n}$ for some $n$. Our characterization is described in terms of a tree of radius $2$…

A connected graph $G$ with at least two vertices is matching covered if each of its edges lies in a perfect matching. A matching covered graph is minimal if the removal of any edge results in a graph that is no longer matching covered. An…

There are many results asserting the existence of tree-decompositions of minimal width which still represent local connectivity properties of the underlying graph, perhaps the best-known being Thomas' theorem that proves for every graph $G$…

In this paper we introduce a representation of a embedded knotted (sometimes Lagrangian) tori in $\BR^4$ called a hypercube diagram, i.e., a 4-dimensional cube diagram. We prove the existence of hypercube homology that is invariant under…

A diamond is the graph that is obtained from removing an edge from the complete graph on $4$ vertices. A ($C_4$,diamond)-free graph is a graph that does not contain a diamond or a cycle on four vertices as induced subgraphs. Let $G$ be a…

Consider a setting where possibly sensitive information sent over a path in a network is visible to every {neighbor} of the path, i.e., every neighbor of some node on the path, thus including the nodes on the path itself. The exposure of a…

Let $T$ be a tree. A vertex of degree one is a \emph{leaf} of $T$ and a vertex of degree at least three is a \emph{branch vertex} of $T$. A graph is said to be claw-free if it does not contain $K_{1,3}$ as an induced subgraph. In this…

We consider large uniform labeled random graphs in different classes with few induced $P_4$ ($P_4$ is the graph consisting of a single line of $4$ vertices) which generalize the case of cographs. Our main result is the convergence to a…

Understanding the structure of minor-free metrics, namely shortest path metrics obtained over a weighted graph excluding a fixed minor, has been an important research direction since the fundamental work of Robertson and Seymour. A…

Let $k\geq2$ be an integer. A $k$-tree is a tree with maximum degree at most $k$. In this paper, we give a closure result on spanning $k$-trees of graphs with given minimum degree. Let $\delta\geq1$ be an integer, and $G$ be a connected…

The simple connected graphs may be classified by their cycle composition (number and lengths of cycles). This work derives the counting series of the simple connected graphs that have cycles of unrestricted number and length, but no…

Results on the existence of various types of spanning subgraphs of graphs are milestones in structural graph theory and have been diversified in several directions. In the present paper, we consider "local" versions of such statements. In…

A classical enumerative result states that, given a graph $G$ and a vertex $u$, the number of connected subgraphs of $G$ is equal to the number of orientations of $G$ such that every vertex can reach $u$ by a directed path. We show that…

In 2009, Kyaw proved that every $n$-vertex connected $K_{1,4}$-free graph $G$ with $\sigma_4(G)\geq n-1$ contains a spanning tree with at most $3$ leaves. In this paper, we prove an analogue of Kyaw's result for connected $K_{1,5}$-free…

The family of graphs of reduced words of a certain subcollection of permutations in the union $\cup_{n\geq 4}\frak{S}_{n}$ of symmetic groups is investigated. The subcollection is characterised by the hook cycle type $(n-2,1,1)$ with…