Given a directed graph D = (N, A) and a sequence of positive integers 1 <= c_1 < c_2 < ... < c_m <= |N|, we consider those path and cycle polytopes that are defined as the convex hulls of simple paths and cycles of D of cardinality c_p for some p, respectively. We present integer characterizations of these polytopes by facet defining linear inequalities for which the separation problem can be solved in polynomial time. These inequalities can simply be transformed into inequalities that characterize the integer points of the undirected counterparts of cardinality constrained path and cycle polytopes. Beyond we investigate some further inequalities, in particular inequalities that are specific to odd/even paths and cycles.
给定一个组合最优化问题$Π$和一个自然数的递增有限序列$c$，通过只允许$Π$中基数为$c$成员的可行解，得到了$Π$的基数约束版本$Π_c$.我们感兴趣的多面体与这些问题，特别是在不平等，切断解决方案的禁止基数。Maurras（1977）和Camion and Maurras（1982）引入了一族不等式，我们称之为禁止集不等式，它可以用来截断那些解。然而，这些不等式通常不是与$Π_c$相关联的多面体的刻面定义。Kaibel和Stephan（2007）展示了如何将循环和路径多面体的整数特征与禁止集不等式的修改形式相结合，以给出这些多面体的基数限制版本的刻面定义整数表示。受这项工作的启发，我们将同样的方法应用于拟阵多面体。众所周知，所谓的秩不等式与非负性约束一起提供了拟阵多面体的完整线性描述（参见Edmonds（1971））。通过适当形式的禁止集不等式的本质相加，得到了基数约束拟阵多面体的完备线性描述，该拟阵多面体是具有可行基数的独立集的关联向量的凸包.此外，我们展示了如何分离问题的禁止集不等式可以减少到秩不等式。给出了一个禁止集不等式是刻面定义的充要条件。
Let $G$ be an $n$-node graph without two disjoint odd cycles. The algorithm of Artmann, Weismantel and Zenklusen (STOC'17) for bimodular integer programs can be used to find a maximum weight stable set in $G$ in strongly polynomial time. Building on structural results characterizing sufficiently connected graphs without two disjoint odd cycles, we construct a size-$O(n^2)$ extended formulation for the stable set polytope of $G$.
It is folklore that the cycle space of graphs of polytopes is generated by the cycles bounding the 2-faces. We provide a proof of this result that bypass homological arguments, which seem to be the most widely known proof. As a corollary, we obtain a result of Blind & Blind (1994) stating that graphs of polytopes are bipartite if and only if graphs of every 2-face are bipartite.
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an algebraic and geometric investigation of these polytopes by studying their toric algebras, called cycle algebras, and their defining ideals. Several matroid operations are considered which determine faces of cycle polytopes that belong again to this class of polyhedral objects. As a key technique used in this paper, we study certain minors of given matroids which yi…
Let $R$ be the Ehrhart ring of the stable set polytope of a cycle graph which is not Gorenstein. We describe the non-Gorenstein locus of $\mathrm{Spec} R$. Further, we show that $R$ is almost Gorenstein. Moreover, we show that the conjecture of Hibi and Tsuchiya is true.
We study proportions of consecutive occurrences of permutations of a given size. Specifically, the limit of such proportions on large permutations forms a region, called \emph{feasible region}. We show that this feasible region is a polytope, more precisely the cycle polytope of a specific graph called \emph{overlap graph}. This allows us to compute the dimension, vertices and faces of the polytope, and to determine the equations that define it. Finally we prove that the limit of classical occurrences and consecutive occurrences are in some sense independent. As a consequence, the scaling limi…
We consider a Hamiltonian decomposition problem of partitioning a regular graph into edge-disjoint Hamiltonian cycles. A sufficient condition for vertex adjacency in the 1-skeleton of the traveling salesperson polytope can be formulated as the Hamiltonian decomposition problem in a 4-regular multigraph. We introduce a heuristic general variable neighborhood search algorithm for this problem based on finding a vertex-disjoint cycle cover of the multigraph through reduction to perfect matching and several cycle merging operations. The algorithm has a one-sided error: the answer "not adjacent" is…
We study proportions of consecutive occurrences of permutations of a given size. Specifically, the feasible limits of such proportions on large permutations form a region, called feasible region. We show that this feasible region is a polytope, more precisely the cycle polytope of a specific graph called overlap graph. This allows us to compute the dimension, vertices and faces of the polytope. Finally, we prove that the limits of classical occurrences and consecutive occurrences are independent, in some sense made precise in the extended abstract. As a consequence, the scaling limit of a sequ…
A cosmological polytope is defined for a given Feynman diagram, and its canonical form may be used to compute the contribution of the Feynman diagram to the wavefunction of certain cosmological models. Given a subdivision of a polytope, its canonical form is obtained as a sum of the canonical forms of the facets of the subdivision. In this paper, we identify such formulas for the canonical form via algebraic techniques. It is shown that the toric ideal of every cosmological polytope admits a Gröbner basis with a squarefree initial ideal, yielding a regular unimodular triangulation of the polyt…
In a graph G, cardinality of the smallest ordered set of vertices that distinguishes every element of V (G) is the (vertex) metric dimension of G. Similarly, the cardinality of such a set is the edge metric dimension of G, if it distinguishes E(G). In this paper these invariants are considered first for unicyclic graphs, and it is shown that the vertex and edge metric dimensions obtain values from two particular consecutive integers, which can be determined from the structure of the graph. In particular, as a consequence, we obtain that these two invariants can differ for at most one for a sam…
Faculty of Computer Science, TU Dresden（德累斯顿工业大学计算机学院）；Center for Scalable Data Analytics and AI (ScaDS.AI) Dresden/Leipzig（德累斯顿/莱ipzig可扩展数据分析与人工智能中心）；Université Sorbonne Paris Nord（巴黎北索邦大学）；CNRS（法国国家科学研究中心）
The independent domination number $i(G)$ of a graph $G$ is the minimum cardinality of a maximal independent set of $G$, also called an $i(G)$-set. The $i$-graph of $G$, denoted $\mathscr{I}(G)$, is the graph whose vertices correspond to the $i(G)$-sets, and where two $i(G)$-sets are adjacent if and only if they differ by two adjacent vertices. Although not all graphs are $i$-graph realizable, that is, given a target graph $H$, there does not necessarily exist a source graph $G$ such that $H \cong \mathscr{I}(G)$, all graphs have $i$-graphs. We determine the $i$-graphs of paths and cycles and, …
Let $G$ be a connected graph and $g$ be a non-negative integer. The $g$-extra connectivity of $G$ is the minimum cardinality of a set of vertices in $G$, if it exists, whose removal disconnects $G$ and leaves every component with more than $g$ vertices. The strong product $G_1 \boxtimes G_2$ of graphs $G_1=(V_{1}, E_{1})$ and $G_2=(V_{2}, E_{2})$ is the graph with vertex set $V(G_1 \boxtimes G_2)=V_{1} \times V_{2}$, where two distinct vertices $(x_{1}, x_{2}), (y_{1}, y_{2}) \in V_{1} \times V_{2}$ are adjacent in $G_1 \boxtimes G_2$ if and only if $x_{i}=y_{i}$ or $x_{i} y_{i} \in E_{i}$ for…
We introduce the Hopf monoid of sets of cycles and paths, which contains the Faà di Bruno Hopf monoid as a submonoid. We give cancellation-free and grouping-free formulas for its antipode, one in terms of tubings and one in terms of \emph{pointed} noncrossing partitions. We provide an explicit description of the group of characters of this Hopf monoid in terms of pairs of power series. Using graph associahedra, we relate paths and cycles to associahedra and cyclohedra, respectively. We give formulas for inversion in the group of characters in terms of the faces of these polytopes.
Given a graph $G=(V,E)$ and a set $S \subseteq \binom{V}{2}$ of terminal pairs, the minimum multicut problem asks for a minimum edge set $δ\subseteq E$ such that there is no $s$-$t$-path in $G -δ$ for any $\{s,t\}\in S$. For $|S|=1$ this is the well known $s$-$t$-cut problem, but in general the minimum multicut problem is NP-complete, even if the input graph is a tree. The multicut polytope $\text{MultC}^\square (G,S)$ is the convex hull of all multicuts in $G$; the multicut dominant is given by $\text{MultC}(G,S)=\text{MultC}^\square (G,S)+\mathbb{R}^E$. The latter is the relevant object for …
