Related papers: Reductions of (v_3) configurations

In a graph, a matching cut is an edge cut that is a matching. Matching Cut is the problem of deciding whether or not a given graph has a matching cut, which is known to be NP-complete even when restricted to bipartite graphs. It has been…

We define the class of high dimensional graph manifolds. These are compact smooth manifolds supporting a decomposition into finitely many pieces, each of which is diffeomorphic to the product of a torus with a finite volume hyperbolic…

A vertex set $U \subseteq V$ of an undirected graph $G=(V,E)$ is a $\textit{resolving set}$ for $G$, if for every two distinct vertices $u,v \in V$ there is a vertex $w \in U$ such that the distances between $u$ and $w$ and the distance…

Flat structure was introduced by K. Saito and his collaborators at the end of 1970's. Independently the WDVV equation arose from the 2D topological field theory. B. Dubrovin unified these two notions as Frobenius manifold structure. In this…

We introduce a new approach for computing curvature of sub-Riemannian manifolds. Curvature is here meant as symplectic invariants of Jacobi curves of geodesics, as introduced by Zelenko and Li. We describe how they can be expressed using a…

How much cutting is needed to simplify the topology of a surface? We provide bounds for several instances of this question, for the minimum length of topologically non-trivial closed curves, pants decompositions, and cut graphs with a given…

We define the $k$-cut complex of a graph $G$ with vertex set $V(G)$ to be the simplicial complex whose facets are the complements of sets of size $k$ in $V(G)$ inducing disconnected subgraphs of $G$. This generalizes the Alexander dual of a…

Combinatorial problems are formulated to find optimal designs within a fixed set of constraints. They are commonly found across diverse engineering and scientific domains. Understanding how to best use quantum computers for combinatorial…

The \textsc{Bipartite Contraction} problem is to decide, given a graph $G$ and a parameter $k$, whether we can can obtain a bipartite graph from $G$ by at most $k$ edge contractions. The fixed-parameter tractability of the problem was shown…

We propose a new shape-based modeling technique for applications in imaging problems. Given a collection of shape priors (a shape dictionary), we define our problem as choosing the right dictionary elements and geometrically composing them…

Cutwidth is one of the classic layout parameters for graphs. It measures how well one can order the vertices of a graph in a linear manner, so that the maximum number of edges between any prefix and its complement suffix is minimized. As…

We show how ideas coming out of gauge theory can be used to prove configurations in the list of ``633 unavoidable configurations" are reducible. In this paper, we prove the smallest nontrivial example, the Birkhoff diamond, is reducible…

In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…

A conjecture of Fan and Raspaud [3] asserts that every bridgeless cubic graph con-tains three perfect matchings with empty intersection. Kaiser and Raspaud [6] sug-gested a possible approach to this problem based on the concept of a…

We describe an algorithm for the enumeration of (candidates of) vertex-transitive combinatorial $d$-manifolds. With an implementation of our algorithm, we determine, up to combinatorial equivalence, all combinatorial manifolds with a…

This paper is the first from a series of papers that provide a characterization of maximum packings of $T$-cuts in bipartite graphs. Given a connected graph, a set $T$ of an even number of vertices, and a minimum $T$-join, an edge weighting…

Starting from the classical notion of an oriented congruence (i.e. a foliation by oriented curves) in $R^3$, we abstract the notion of an oriented congruence structure. This is a 3-dimensional CR manifold $(M,H, J)$ with a preferred…

We give a construction that provides infinitely many 2-connected, cubic, bipartite, and planar graphs G with 3k vertices and such that the number of disjoint copies of a 3-vertex path in G is less than k.

Reynolds' theory of relational parametricity formalizes parametric polymorphism for System F, thus capturing the idea that polymorphically typed System F programs always map related inputs to related results. This paper shows that Reynolds'…

A graph is called hypohamiltonian if it is not hamiltonian but becomes hamiltonian if any vertex is removed. Many hypohamiltonian planar cubic graphs have been found, starting with constructions of Thomassen in 1981. However, all the…