Related papers: Scramble number and tree-cut decompositions
Random spanning trees of a graph $G$ are governed by a corresponding probability mass distribution (or "law"), $\mu$, defined on the set of all spanning trees of $G$. This paper addresses the problem of choosing $\mu$ in order to utilize…
The metric dimension of a graph is the minimum size of a set of vertices such that each vertex is uniquely determined by the distances to the vertices of that set. Our aim is to upper-bound the order $n$ of a graph in terms of its diameter…
We study the scenario of graph-based clustering algorithms such as spectral clustering. Given a set of data points, one first has to construct a graph on the data points and then apply a graph clustering algorithm to find a suitable…
The paper provides bounds for the ropelength of a link in terms of the crossing numbers of its split components. As in earlier papers, the bounds grow with the square of the crossing number; however, the constant involved is a substantial…
This article investigates the relation between the distributional chaos and the existence of a scrambled triple. We show that for a continuous mapping $f$ acting on a compact metric space $(X,d)$, the possession of an infinite extremal…
In this paper extremal values of the difference between several graph invariants related to the metric dimension are studied: mixed metric dimension, edge metric dimension and strong metric dimension. These non-trivial extremal values are…
We introduce a new numerical invariant of knots and links from the descending diagrams. It is considered to live between the unknotting number and the bridge number.
In the theory of divisors on multigraphs, the $r^{th}$ divisorial gonality of a graph is the minimum degree of a rank $r$ divisor on that graph. It was proved by Gijswijt et al. that the first divisorial gonality of a finite graph is…
We extend the study of the occupancy fraction of the hard-core model in two novel directions. One direction gives a tight lower bound in terms of individual vertex degrees, extending work of Sah, Sawhney, Stoner and Zhao which bounds the…
A tree $t$-spanner of a graph $G$ is a spanning tree of $G$ such that the distance between pairs of vertices in the tree is at most $t$ times their distance in $G$. Deciding tree $t$-spanner admissible graphs has been proved to be tractable…
Computing the edge expansion of a graph is a famously hard combinatorial problem for which there have been many approximation studies. We present two variants of exact algorithms using semidefinite programming (SDP) to compute this constant…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
Several different measures for digraph width have appeared in the last few years. However, none of them shares all the "nice" properties of treewidth: First, being \emph{algorithmically useful} i.e. admitting polynomial-time algorithms for…
How does the chromatic number of a graph chosen uniformly at random from all graphs on $n$ vertices behave? This quantity is a random variable, so one can ask (i) for upper and lower bounds on its typical values, and (ii) for bounds on how…
We explore the notion of sectional number of a group homomorphism, leading to a generalization of the covering number of a group, and present several characterizations when the sectional number is finite, providing estimates for computing…
A sequence of graphs with diverging number of nodes is a dense graph sequence if the number of edges grows approximately as for complete graphs. To each such sequence a function, called graphon, can be associated, which contains information…
We study the problem of maximizing the number of spanning trees in a connected graph by adding at most $k$ edges from a given candidate edge set. We give both algorithmic and hardness results for this problem: - We give a greedy algorithm…
Fractional (hyper-)graph theory is concerned with the specific problems that arise when fractional analogues of otherwise integer-valued (hyper-)graph invariants are considered. The focus of this paper is on fractional edge covers of…
We present the Boolean dimension of a graph, we relate it with the notions of inner, geometric and symplectic dimensions, and with the rank and minrank of a graph. We obtain an exact formula for the Boolean dimension of a tree in terms of a…
The recently introduced graph parameter tree-cut width plays a similar role with respect to immersions as the graph parameter treewidth plays with respect to minors. In this paper, we provide the first algorithmic applications of tree-cut…