相关论文: On the Bond Polytope

The vertex connectivity of a graph $G$ is the size of the smallest set of vertices $S$ such that $G \setminus S$ is disconnected. For the class of planar graphs, the problem of vertex connectivity is well-studied, both from structural and…

Let $G=(V,E)$ be a simple connected graph. A connected edge cover of $G$ is a subset $S\subseteq E$ such that every vertex of $G$ is incident with at least one edge in $S$ and the subgraph induced by $S$ is connected. The connected edge…

Let $k$ be a positive integer and let $G$ be a graph with $n$ vertices. A connected $k$-subpartition of $G$ is a collection of $k$ pairwise disjoint sets (a.k.a. classes) of vertices in $G$ such that each set induces a connected subgraph.…

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$. An edge subset $F\subseteq E(G)$ is called a restricted edge-cut if $G-F$ is disconnected and has no isolated vertices. The restricted edge-connectivity $\lambda'(G)$ of $G$ is…

Given $n$ symmetric Bernoulli variables, what can be said about their correlation matrix viewed as a vector? We show that the set of those vectors $R(\mathcal{B}_n)$ is a polytope and identify its vertices. Those extreme points correspond…

Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that contains an edge-cut. We show that this problem is NP-complete for planar graphs with maximum degree four, for planar graphs with girth five, for…

We initiate the algorithmic study of the following "structured augmentation" question: is it possible to increase the connectivity of a given graph G by superposing it with another given graph H? More precisely, graph F is the superposition…

Let $G$ be a graph with $m$ edges and let $\mathrm{mc}(G)$ denote the size of a largest cut of $G$. The difference $\mathrm{mc}(G)-m/2$ is called the surplus $\mathrm{sp}(G)$ of $G$. A fundamental problem in MaxCut is to determine…

A graph $G$ is well-covered if all maximal independent sets are of the same cardinality. Let $w:V(G) \longrightarrow\mathbb{R}$ be a weight function. Then $G$ is $w$-well-covered if all maximal independent sets are of the same weight. An…

The max-cut problem is a classical graph theory problem which is NP-complete. The best polynomial time approximation scheme relies on \emph{semidefinite programming} (SDP). We study the conditions under which graphs of certain classes have…

MaxCut is a classical NP-complete problem and a crucial building block in many combinatorial algorithms. The famous Edwards-Erd\H{o}s bound states that any connected graph on n vertices with m edges contains a cut of size at least $m/2 +…

The Maximum s-Bundle Problem (MBP) addresses the task of identifying a maximum s-bundle in a given graph. A graph G=(V, E) is called an s-bundle if its vertex connectivity is at least |V|-s, where the vertex connectivity equals the minimum…

Let $G=(V,E)$ be a graph. A subset $S \subseteq V$ is a dominating set of $G$ if every vertex not in $S$ is adjacent to a vertex in $S$. A set $\tilde{D} \subseteq V$ of a graph $G=(V,E) $ is called an outer-connected dominating set for $G$…

Let $G$ be an undirected graph. An edge of $G$ dominates itself and all edges adjacent to it. A subset $E'$ of edges of $G$ is an edge dominating set of $G$, if every edge of the graph is dominated by some edge of $E'$. We say that $E'$ is…

We initiate the study of the shortest reconfiguration problem for independent sets under the adjacency relation derived from the independent set polytope. Given a graph and two independent sets, the problem asks for a shortest sequence…

The perfect matching polytope, i.e. the convex hull of (incidence vectors of) perfect matchings of a graph is used in many combinatorial algorithms. Kotzig, Lov\'asz and Plummer developed a decomposition theory for graphs with perfect…

We consider a class of diffusion problems defined on simple graphs in which the populations at any two vertices may be averaged if they are connected by an edge. The diffusion polytope is the convex hull of the set of population vectors…

In this paper, we investigate the relationships between the volumes of four convex bodies: the cut polytope, metric polytope, rooted metric polytope, and elliptope, defined on graphs with $n$ vertices. The cut polytope is contained in each…

We introduce an optimal transport based approach for comparing undirected graphs with non-negative edge weights and general vertex labels, and we study connections between the resulting linear program and the graph isomorphism problem. Our…

The \textit{longest path transversal number} of a connected graph $G$, denoted by $lpt(G)$, is the minimum size of a set of vertices of $G$ that intersects all longest paths in $G$. We present constant upper bounds for the longest path…