Related papers: How Many Links Fit in a Box?

A matching in a graph is uniquely restricted if no other matching covers exactly the same set of vertices. We establish tight lower bounds on the maximum size of a uniquely restricted matching in terms of order, size, and maximum degree.

We introduce the four-page index of a knot or link as a presentation invariant arising from embeddings in a four-page open book decomposition. Using spanning trees of the checkerboard graph of a reduced non-split diagram, we construct a…

Let P be a closed smooth (4j-2)-connected 8j-manifold. We complete Wilkens' classification of the manifolds P for j = 1,2 and give an alternative proof to Wall's classification of the manifolds for j > 2. The Hopf-invariant-one dimensions…

Fix an integer m and a multi-index p = (p_1, ..., p_r) of integers p_i < m-2. The set of links of codimension > 2, with multi-index p, E(p, m), is the set of smooth isotopy classes of smooth embeddings of the disjoint union of the…

We consider arrangements of n hyperplanes of codimension one in a real projective space of dimension d. Let us denote by F the maximal possible number f of connected components of the complement in the projective space of dimension d to the…

We prove that the Jones diameter of a link is twice its crossing number whenever the breadth of its Jones polynomial equals the difference between the crossing number and the Turaev genus. This implies that such link is adequate, as per the…

This paper gives the first examples of gordian unlinks. The components of these unlinks cannot be separated while maintaining constant length and thickness. We construct infinite families of 2-component gordian unlinks and also construct…

We consider hyperbolic links that admit alternating projections on surfaces in compact, irreducible 3-manifolds. We show that, under some mild hypotheses, the volume of the complement of such a link is bounded below in terms of a Kauffman…

We develop a word mechanism applied in knot and link diagrams for the illustration of a diagrammatic property. We also give a necessary condition for determining incompressible and pairwise incompressible surfaces, that are embedded in knot…

Let $L$ be a prime alternating link with $n$ crossings. We show that for each fixed $g$, the number of genus $g$ incompressible surfaces in the complement of $L$ is bounded by a polynomial in $n$. Previous bounds were exponential in $n$.

Packing a given sequence of items into as few bins as possible in an online fashion is a widely studied problem. We improve lower bounds for packing boxes into bins in two or more dimensions, both for general algorithms for squares and…

We proved in another paper that every connected graph can be realized as the cut locus of some point on some riemannian surface. Here we give upper bounds on the number of such realizations.

Let $L$ be a non-split prime alternating link with $n>0$ crossings. We show that for each fixed $g$, the number of genus-$g$ Seifert surfaces for $L$ is bounded by an explicitly given polynomial in $n$. The result also holds for all…

The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if, for every set of $k$ disjoint pairs of vertices, there are $k$ vertex-disjoint paths joining the…

Link prediction in collaboration networks is often solved by identifying structural properties of existing nodes that are disconnected at one point in time, and that share a link later on. The maximally possible recall rate or upper bound…

In $d$-dimensional space (over any field), given a set of lines, a joint is a point passed through by $d$ lines not all lying in some hyperplane. The joints problem asks to determine the maximum number of joints formed by $L$ lines, and it…

We show that any $2-$factor of a cubic graph can be extended to a maximum $3-$edge-colorable subgraph. We also show that the sum of sizes of maximum $2-$ and $3-$edge-colorable subgraphs of a cubic graph is at least twice of its number of…

An immersed concordance between two links is a concordance with possible self-intersections. Given an immersed concordance we construct a smooth four-dimensional cobordism between surgeries on links. By applying $d$-invariant inequalities…

A link in the 3-sphere is called (smoothly) slice if its components bound disjoint smoothly embedded disks in the 4-ball. More generally, given a 4-manifold M with a distinguished circle in its boundary, a link in the 3-sphere is called…

This paper studies the linking numbers of random links within the grid model. The linking number is treated as a random variable on the isotopy classes of 2-component links, with the paper exploring its asymptotic growth as the diagram size…