Related papers: $\partial$-invariant path generators for digraphs

Entanglement is a complexity measure of digraphs that origins in fixed-point logics. Its combinatorial purpose is to measure the nested depth of cycles in digraphs. We address the problem of characterizing the structure of graphs of…

Given a connected undirected multigraph G (a graph that may contain parallel edges), the algorithm of [19] finds the 3-edge-connected components of $G$ in linear time using an innovative graph contraction technique based on a depth-first…

We present and investigate an extension of the classical random graph to a general class of inhomogeneous random graph models, where vertices come in different types, and the probability of realizing an edge depends on the types of its…

We describe polynomial time algorithms for determining whether an undirected graph may be embedded in a distance-preserving way into the hexagonal tiling of the plane, the diamond structure in three dimensions, or analogous structures in…

We say a graph $G$ has a Hamiltonian path if it has a path containing all vertices of $G$. For a graph $G$, let $\sigma_2(G)$ denote the minimum degree sum of two nonadjacent vertices of $G$; restrictions on $\sigma_2(G)$ are known as…

The action $A$ of Quadratic Gravity in FLRW metric is invariant under the group of diffeomorphisms of the time coordinate and can be written in terms of the only dynamical variable $g(\tau)\,.$ We construct perturbation theory for…

The classic theorem of Gallai and Milgram (1960) generalizes several fundamental results in Graph Theory, such as Dilworth's theorem on posets and K\H{o}nig's theorem on matchings in bipartite graphs. The theorem asserts that for every…

The $3$-admissibility of a graph is a promising measure to identify real-world networks that have an algorithmically favourable structure. We design an algorithm that decides whether the $3$-admissibility of an input graph~$G$ is at…

We investigate a graph theoretic analog of geodesic geometry. In a graph $G=(V,E)$ we consider a system of paths $\mathcal{P}=\{P_{u,v}|u,v\in V\}$ where $P_{u,v}$ connects vertices $u$ and $v$. This system is consistent in that if vertices…

We use a well known problem in discrete and computational geometry (partitions of measures by $k$-fans) as a motivation and as a point of departure to illustrate many aspects, both theoretical and computational, of the problem of…

An outline of a proof of the decomposition of linear metric perturbations into gauge-invariant and gauge-variant parts on an arbitrary background spacetime which admits ADM decomposition is briefly discussed. We explicitly construct the…

We study continuous analogues of "vitality" for discrete network flows/paths, and consider problems related to placing segment barriers that have highest impact on a flow/path in a polygonal domain. This extends the graph-theoretic notion…

We study the existence and construction of sparse supports for hypergraphs derived from subgraphs of a graph $G$. For a hypergraph $(X,\mathcal{H})$, a support $Q$ is a graph on $X$ s.t. $Q[H]$, the graph induced on vertices in $H$ is…

Let v(G) and p(G) be the number of vertices and the maximum number of disjoint 3-vertex paths in G, respectively. We discuss the following old Problem: Is the following claim (P) true ? (P) if G is a 3-connected and cubic graph, then p(G) =…

Let $G=(V,E)$ be an undirected graph with $n$ vertices and $m$ edges. We obtain the following new routing schemes: - A routing scheme for unweighted graphs that uses $\tilde O(\frac{1}{\epsilon} n^{2/3})$ space at each vertex and $\tilde…

We give a polynomial-time algorithm that, with input a graph $G$ and two vertices $u,v$ of $G$, decides whether there is an induced $uv$-path that is longer than the shortest $uv$-path.

We construct a series of finitely presented semigroups. The centers of these semigroups encode uniquely up to rigid ambient isotopy in 3-space all non-oriented spatial graphs. This encoding is obtained by using three-page embeddings of…

An outline of a proof of the decomposition of linear metric perturbations into gauge-invariant and gauge-variant parts on the an arbitrary background spacetime which admits ADM decomposition is discussed. We explicitly construct the…

We define an invariant $\nabla_G(M)$ of pairs M,G, where M is a 3-manifold obtained by surgery on some framed link in the cylinder $S\times I$, S is a connected surface with at least one boundary component, and G is a fatgraph spine of S.…

In 2015, Guth proved that for any set of $k$-dimensional bounded complexity varieties in $\mathbb{R}^d$ and for any positive integer $D$, there exists a polynomial of degree at most $D$ whose zero set divides $\mathbb{R}^d$ into open…