Related papers: A note on the computational complexity of weak sat…
Let $\mathcal{F}$ be a family of $r$-graphs. An $r$-graph $G$ is called $\mathcal{F}$-saturated if it does not contain any members of $\mathcal{F}$ but adding any edge creates a copy of some $r$-graph in $\mathcal{F}$. The saturation number…
A fiber-uniform bound on the complexity of an essential simplicial map $S^3\rightarrow S^2$ is proven, and the tightness of the bound is investigated. It follows that the triangulation of the Hopf map constructed by Madahar and Sarkaria is…
In the spanning-tree congestion problem ($\mathsf{STC}$), we are given a graph $G$, and the objective is to compute a spanning tree of $G$ that minimizes the maximum edge congestion. While $\mathsf{STC}$ is known to be $\mathbb{NP}$-hard,…
Multi-layer graphs consist of several graphs (layers) over the same vertex set. They are motivated by real-world problems where entities (vertices) are associated via multiple types of relationships (edges in different layers). We chart the…
The saturation number of a graph $G$ is the cardinality of any smallest maximal matching of $G$, and it is denoted by $s(G)$. Fullerene graphs are cubic planar graphs with exactly twelve 5-faces; all the other faces are hexagons. They are…
We consider weighted tiling systems to represent functions from graphs to a commutative semiring such as the Natural semiring or the Tropical semiring. The system labels the nodes of a graph by its states, and checks if the neighbourhood of…
We study two computational problems, parameterised by a fixed tree H. #HomsTo(H) is the problem of counting homomorphisms from an input graph G to H. #WHomsTo(H) is the problem of counting weighted homomorphisms to H, given an input graph G…
A property of weak stationarity of a matrix valued differential form at superdensity points of its vanishing set is proved. This result is then applied in the context of the Maurer-Cartan equation.
Given an edge-weighted directed graph $G=(V,E)$ on $n$ vertices and a set $T=\{t_1, t_2, \ldots, t_p\}$ of $p$ terminals, the objective of the \scss ($p$-SCSS) problem is to find an edge set $H\subseteq E$ of minimum weight such that $G[H]$…
For a given graph $F$, a graph $G$ is said to be $F$-saturated if $G$ contains no copy of $F$ but for any edge $uv\notin E(G)$, $G+uv$ contains a copy of $F$. The saturation number $sat(n,F)$ is defined as the minimum number of edges among…
This article investigates structural, geometrical, and topological characterizations and properties of weakly modular graphs and of cell complexes derived from them. The unifying themes of our investigation are various `nonpositive…
Weak gravitational lensing is an important tool to estimate the masses of galaxy clusters, as it allows us to directly access their projected surface mass density along the line-of-sight (LOS) in a manner largely independent of their…
Focke, Goldberg, and \v{Z}ivn\'y (arXiv 2017) prove a complexity dichotomy for the problem of counting surjective homomorphisms from a large input graph G without loops to a fixed graph H that may have loops. In this note, we give a short…
The graph packing problem is a well-known area in graph theory. We consider a bipartite version and give almost tight conditions on the packability of two bipartite sequences.
Let $H$ be an undirected graph. In the List $H$-Homomorphism Problem, given an undirected graph $G$ with a list constraint $L(v) \subseteq V(H)$ for each variable $v \in V(G)$, the objective is to find a list $H$-homomorphism $f:V(G) \to…
In this note we investigate the role of Lloyd's computational bound in holographic complexity. Our goal is to translate the assumptions behind Lloyd's proof into the bulk language. In particular, we discuss the distinction between…
Orderability, weak orderability and the existence of continuous weak selections on filter spaces (i.e., spaces with a single non-isolated point) and their products are discussed. We prove that a closed continuous image X of a suborderable…
A graph $G$ is called $F$-saturated if $G$ does not contain $F$ as a subgraph (not necessarily induced) but the addition of any missing edge to $G$ creates a copy of $F$. The saturation number of $F$, denoted by $sat(n,F)$, is the minimum…
We explore the relation between the topological relevance of a node in a complex network and the individual dynamics it exhibits. When the system is weakly coupled, the effect of the coupling strength against the dynamical complexity of the…
Networks are inherently vulnerable to vertex failures, making the analysis of their structural robustness a fundamental problem in graph theory. In this study, we investigate the closeness and vertex residual closeness of graphs, with a…