15 research outputs found
A minor-monotone graph parameter based on oriented matroids
AbstractFor an undirected graph G = (V,E) let λ ′(G) be the largest d for which there exists an oriented matroid M on V of corank d such that for each nonzero vector (x+,x−) of M, x+ is nonempty and induces a connected subgraph of G.We show that λ′(G) is monotone under taking minors and clique sums. Moreover, we show that λ′(G) ⩽ 3 if and only if G has no K5- or V8-minor; that is, if and only if G arises from planar graphs by taking clique sums and subgraphs
Even maps, the Colin de~Verdi\`ere number and representations of graphs
Van der Holst and Pendavingh introduced a graph parameter , which
coincides with the more famous Colin de Verdi\`{e}re graph parameter for
small values. However, the definition of is much more
geometric/topological directly reflecting embeddability properties of the
graph. They proved and conjectured for any graph . We confirm this conjecture. As far as we know,
this is the first topological upper bound on which is, in general,
tight.
Equality between and does not hold in general as van der Holst
and Pendavingh showed that there is a graph with and
. We show that the gap appears on much smaller values,
namely, we exhibit a graph for which and .
We also prove that, in general, the gap can be large: The incidence graphs
of finite projective planes of order satisfy and .Comment: 28 pages, 4 figures. In v2 we slightly changed one of the core
definitions (previously "extended representation" now "semivalid
representation"). We also use it to introduce a new graph parameter, denoted
eta, which did not appear in v1. It allows us to establish an extended
version of the main result showing that mu(G) is at most eta(G) which is at
most sigma(G) for every graph
Recommended from our members
Discrete Geometry
A number of important recent developments in various branches of discrete geometry were presented at the workshop. The presentations illustrated both the diversity of the area and its strong connections to other fields of mathematics such as topology, combinatorics or algebraic geometry. The open questions abound and many of the results presented were obtained by young researchers, confirming the great vitality of discrete geometry
Geometric Ramifications of the Lovász Theta Function and Their Interplay with Duality
The Lovasz theta function and the associated convex sets known as theta bodies are fundamental objects in combinatorial and
semidefinite optimization. They are accompanied by a rich duality theory and
deep connections to the geometric concept of orthonormal representations of graphs. In this thesis, we investigate several ramifications of the theory underlying these objects, including those arising from the illuminating viewpoint of duality. We study some optimization problems over unit-distance representations of graphs, which are intimately related to the Lovasz theta function and orthonormal representations. We also strengthen some known results about dual descriptions of theta bodies and their variants. Our main goal throughout the thesis is to lay some of the foundations for using semidefinite optimization and convex analysis in a way analogous to how polyhedral combinatorics has been using linear optimization to prove min-max theorems.
A unit-distance representation of a graph maps its nodes to some Euclidean space so that adjacent nodes are sent to pairs of points at distance one. The hypersphere number of , denoted by , is the (square of the) minimum radius of a hypersphere that contains a unit-distance representation of . Lovasz proved a min-max relation describing as a function of , the theta number of the complement of . This relation provides a dictionary between unit-distance representations in hyperspheres and orthonormal representations, which we exploit in a number of ways: we develop a weighted generalization of , parallel to the weighted version of ; we prove that is equal to the (square of the) minimum radius of an Euclidean ball that contains a unit-distance representation of ; we abstract some properties of that yield the famous Sandwich Theorem and use them to define another weighted generalization of , called ellipsoidal number of , where the unit-distance representation of is required to be in an ellipsoid of a given shape with minimum volume. We determine an analytic formula for the ellipsoidal number of the complete graph on nodes whenever there exists a Hadamard matrix of order .
We then study several duality aspects of the description of the theta body . For a graph , the convex corner is known to be the projection of a certain convex set, denoted by , which lies in a much higher-dimensional matrix space. We prove that the vertices of are precisely the symmetric tensors of incidence vectors of stable sets in , thus broadly generalizing previous results about vertices of the elliptope due to Laurent and Poljak from 1995. Along the way, we also identify all the vertices of several variants of and of the elliptope. Next we introduce an axiomatic framework for studying generalized theta bodies, based on the concept of diagonally scaling invariant cones, which allows us to prove in a unified way several characterizations of and the variants and , introduced independently by Schrijver, and by McEliece, Rodemich, and Rumsey in the late 1970's, and by Szegedy in 1994. The beautiful duality equation which states that the antiblocker of is is extended to this setting. The framework allows us to treat the stable set polytope and its classical polyhedral relaxations as generalized theta bodies, using the completely positive cone and its dual, and it allows us to derive a (weighted generalization of a) copositive formulation for the fractional chromatic number due to Dukanovic and Rendl in 2010 from a completely positive formulation for the stability number due to de Klerk and Pasechnik in 2002. Finally, we study a non-convex constraint for semidefinite programs (SDPs) that may be regarded as analogous to the usual integrality constraint for linear programs. When applied to certain classical SDPs, it specializes to the standard rank-one constraint. More importantly, the non-convex constraint also applies to the dual SDP, and for a certain SDP formulation of , the modified dual yields precisely the clique covering number. This opens the way to study some exactness properties of SDP relaxations for combinatorial optimization problems akin to the corresponding classical notions from polyhedral combinatorics, as well as approximation algorithms based on SDP relaxations