Related papers: Obstructions of Connectivity 2 for Embedding Graph…
A special case of a conjecture by Thomass\'e is that any oriented graph with minimum outdegree k contains a dipath of length 2k. For the sake of proving whether or not a counterexample exists, we present reductions and establish bounds on…
We address various topologies (de Bruijn, chordal ring, generalized Petersen, meshes) in various ways ( isometric embedding, embedding up to scale, embedding up to a distance) in a hypercube or a half-hypercube. Example of obtained…
A map $\varphi:K\to R^2$ of a graph $K$ is approximable by embeddings, if for each $\varepsilon>0$ there is an $\varepsilon$-close to $\varphi$ embedding $f:K\to R^2$. Analogous notions were studied in computer science under the names of…
A covariant functor from the category of mapping tori to a category of AF-algebras is constructed; the functor takes continuous maps between such manifolds to stable homomorphisms between the corresponding AF-algebras. We use this functor…
We study smooth maps between smooth manifolds with only fold points as their singularities, and clarify the obstructions to the existence of such a map in a given homotopy class for certain dimensions. The obstructions are described in…
By a well known theorem of Robbins, a graph $G$ has a strongly connected orientation if and only if $G$ is 2-edge-connected and it is easy to find, in linear time, either a cut edge of $G$ or a strong orientation of $G$. A result of Durand…
We present an easy structure theorem for graphs which do not admit an immersion of the complete graph. The theorem motivates the definition of a variation of tree decompositions based on edge cuts instead of vertex cuts which we call…
We explore the interaction between connectivity and Lin-Lu-Yau curvature of graphs systematically. The intuition is that connected graphs with large Lin-Lu-Yau curvature also have large connectivity, and vice versa. We prove that the…
One of the important features of an interconnection network is its ability to efficiently simulate programs or parallel algorithms written for other architectures. Such a simulation problem can be mathematically formulated as a graph…
Let G be a complete convex geometric graph, and let F be a family of subgraphs of G. A blocker for F is a set of edges, of smallest possible size, that has an edge in common with every element of F. In [C. Keller and M. A. Perles, Blockers…
Graph embedding is a transformation of nodes of a graph into a set of vectors. A~good embedding should capture the graph topology, node-to-node relationship, and other relevant information about the graph, its subgraphs, and nodes. If these…
What kind of schemes are embeddable into good toric prevarieties? To shed some light on this question, we construct proper normal surfaces that are embeddable into neither simplicial toric prevarieties nor toric prevarieties of affine…
We consider two possible extensions of a theorem of Thomassen characterizing the graphs admitting a 2-vertex-connected orientation. First, we show that the problem of deciding whether a mixed graph has a 2-vertex-connected orientation is…
We prove a structural characterization of graphs that forbid a fixed graph $H$ as an immersion and can be embedded in a surface of Euler genus $\gamma$. In particular, we prove that a graph $G$ that excludes some connected graph $H$ as an…
Greene and Owens explore cubiquitous lattices as an obstruction to rational homology 3-spheres bounding rational homology 4-balls. The purpose of this article is to better understand which sublattices of $\mathbb{Z}^n$ are cubiquitous with…
This paper studies smooth obstructions to integrability and proves two main results. First, it is shown that if a smooth topological n-torus admits a real-analytically completely integrable convex hamiltonian on its cotangent bundle, then…
A connected graph is 2K2-free if it does not contain a pair of independent edges as an induced subgraph. In this paper, we present the structural characterization of minimal vertex separator and show that there are polynomial number of…
In the previous paper, we studied obstructions to the existence of complex sections on almost complex manifolds up to cobordism. We determined the obstruction rationally, in terms of the Chern classes. In this paper, we study the torsion…
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…
Extending the work of Godsil and others, we investigate the notion of the inverse of a graph (specifically, of bipartite graphs with a unique perfect matching). We provide a concise necessary and sufficient condition for the invertibility…