اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدStable set polytopes and their 1-skeleta
66
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We characterize the edges of two classes of $0/1$-polytopes. The first class corresponds to the stable set polytope of a graph $G$ and includes chain polytopes of posets, some instances of matroid independence polytopes, as well as newly-defined polytopes whose vertices correspond to noncrossing set partitions. In analogy with matroid basis polytopes, the second class is obtained by considering the stable sets of maximal cardinality. We investigate how the class of $0/1$-polytopes whose edges satisfy our characterization is situated within the hierarchy of $0/1$-polytopes. This includes the class of matroid polytopes. We also study the diameter of these classes of polytopes and improve slightly on the Hirsch bound.
قيم البحث
اقرأ أيضاً
We express the matroid polytope $P_M$ of a matroid $M$ as a signed Minkowski sum of simplices, and obtain a formula for the volume of $P_M$. This gives a combinatorial expression for the degree of an arbitrary torus orbit closure in the Grassmannian
$Gr_{k,n}$. We then derive analogous results for the independent set polytope and the associated flag matroid polytope of $M$. Our proofs are based on a natural extension of Postnikovs theory of generalized permutohedra.
The extension complexity $mathsf{xc}(P)$ of a polytope $P$ is the minimum number of facets of a polytope that affinely projects to $P$. Let $G$ be a bipartite graph with $n$ vertices, $m$ edges, and no isolated vertices. Let $mathsf{STAB}(G)$ be the
convex hull of the stable sets of $G$. It is easy to see that $n leqslant mathsf{xc} (mathsf{STAB}(G)) leqslant n+m$. We improve both of these bounds. For the upper bound, we show that $mathsf{xc} (mathsf{STAB}(G))$ is $O(frac{n^2}{log n})$, which is an improvement when $G$ has quadratically many edges. For the lower bound, we prove that $mathsf{xc} (mathsf{STAB}(G))$ is $Omega(n log n)$ when $G$ is the incidence graph of a finite projective plane. We also provide examples of $3$-regular bipartite graphs $G$ such that the edge vs stable set matrix of $G$ has a fooling set of size $|E(G)|$.
Let $G$ be an $n$-node graph without two disjoint odd cycles. The algorithm of Artmann, Weismantel and Zenklusen (STOC17) for bimodular integer programs can be used to find a maximum weight stable set in $G$ in strongly polynomial time. Building on s
tructural 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$.
Given a graph $G$, the $G$-parking function ideal $M_G$ is an artinian monomial ideal in the polynomial ring $S$ with the property that a linear basis for $S/M_G$ is provided by the set of $G$-parking functions. It follows that the dimension of $S/M_
G$ is given by the number of spanning trees of $G$, which by the Matrix Tree Theorem is equal to the determinant of the reduced Laplacian of $G$. The ideals $M_G$ and related algebras were introduced by Postnikov and Shapiro where they studied their Hilbert functions and homological properties. The author and Sanyal showed that a minimal resolution of $M_G$ can be constructed from the graphical hyperplane arrangement associated to $G$, providing a combinatorial interpretation of the Betti numbers. Motivated by constructions in the theory of chip-firing on graphs, we study certain `skeleton ideals $M_G^{(k)} subset M_G$ generated by subsets of vertices of $G$ of size at most $k+1$. Here we focus our attention on the case $k=1$, the $1$-skeleton of the $G$-parking functions ideals. We consider standard monomials of $M_G^{(1)}$ and provide a combinatorial interpretation for the dimension of $S/M_G^{(1)}$ in terms of the signless Laplacian for the case $G = K_{n+1}$ is the complete graph. Our main study concerns homological properties of these ideals. We study resolutions of $M_G^{(1)}$ and show that for a certain class of graphs minimal resolution is supported on decompositions of Euclidean space coming from the theory of tropical hyperplane arrangements. This leads to combinatorial interpretations of the Betti numbers of these ideals.
Let $G$ be a graph, and let $w$ be a positive real-valued weight function on $V(G)$. For every subset $S$ of $V(G)$, let $w(S)=sum_{v in S} w(v).$ A non-empty subset $S subset V(G)$ is a weighted safe set of $(G,w)$ if, for every component $C$ of the
subgraph induced by $S$ and every component $D$ of $G-S$, we have $w(C) geq w(D)$ whenever there is an edge between $C$ and $D$. If the subgraph of $G$ induced by a weighted safe set $S$ is connected, then the set $S$ is called a connected weighted safe set of $(G,w)$. The weighted safe number $mathrm{s}(G,w)$ and connected weighted safe number $mathrm{cs}(G,w)$ of $(G,w)$ are the minimum weights $w(S)$ among all weighted safe sets and all connected weighted safe sets of $(G,w)$, respectively. Note that for every pair $(G,w)$, $mathrm{s}(G,w) le mathrm{cs}(G,w)$ by their definitions. Recently, it was asked which pair $(G,w)$ satisfies the equality and shown that every weighted cycle satisfies the equality. In this paper, we give a complete list of connected bipartite graphs $G$ such that $mathrm{s}(G,w)=mathrm{cs}(G,w)$ for every weight function $w$ on $V(G)$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
