In this paper we study totally half-modular matrices obtained from {0,±1}-matrices with at most two nonzero entries per column by multiplying by 2 some of the columns. We give an excluded-minor characterization of the matrices in this class having strong Chv`atal rank 1. Our result is a special case of a conjecture by Gerards and Schrijver [11]. It also extends a well known theorem of Edmonds and Johnson [10]
AbstractLet E∗ denote the class of square matrices M such that the linear complementarity problem Mz...
AbstractWe define a 0, 1 matrix M to be ideal if all vertices of the polyhedron { x: Mx ≥ 1, x ≥ 0 }...
AbstractFor an undirected simple graph G, the minimum rank among all positive semidefinite matrices ...
In this paper we study totally half-modular matrices obtained from {0,±1}-matrices with at most two ...
The strong Chvátal rank of a rational matrix A is the smallest number t such that the polyhedron def...
We study a new geometric graph parameter $egd(G)$, defined as the smallest integer $r\ge 1$ for whic...
AbstractA 0–1 matrix A is said to avoid a forbidden 0–1 matrix (or pattern) P if no submatrix of A m...
In this thesis we investigate combinatorial conditions that guarantee the existence of low-rank opti...
The Gram dimension gd(G) of a graph G is the smallest integer k≥1 such that any partial real symmetr...
We study a new geometric graph parameter $egd(G)$, defined as the smallest integer $r\ge 1$ for whic...
AbstractIn this paper we consider the class C0f of fully copositive and the class E0f of fully semim...
AbstractThrough a succession of results, it is known that if the graph of an Hermitian matrix A is a...
The Gram dimension gd(G) of a graph G is the smallest inte- ger k ≥ 1 such that any partial real sym...
In this paper we study systems of the form $b\leq Mx\leq d$, $l\leq x\leq u$, where $M$ is obtained ...
AbstractIt is shown how a wide variety of transversal theorems can be given a common proof. The proo...
AbstractLet E∗ denote the class of square matrices M such that the linear complementarity problem Mz...
AbstractWe define a 0, 1 matrix M to be ideal if all vertices of the polyhedron { x: Mx ≥ 1, x ≥ 0 }...
AbstractFor an undirected simple graph G, the minimum rank among all positive semidefinite matrices ...
In this paper we study totally half-modular matrices obtained from {0,±1}-matrices with at most two ...
The strong Chvátal rank of a rational matrix A is the smallest number t such that the polyhedron def...
We study a new geometric graph parameter $egd(G)$, defined as the smallest integer $r\ge 1$ for whic...
AbstractA 0–1 matrix A is said to avoid a forbidden 0–1 matrix (or pattern) P if no submatrix of A m...
In this thesis we investigate combinatorial conditions that guarantee the existence of low-rank opti...
The Gram dimension gd(G) of a graph G is the smallest integer k≥1 such that any partial real symmetr...
We study a new geometric graph parameter $egd(G)$, defined as the smallest integer $r\ge 1$ for whic...
AbstractIn this paper we consider the class C0f of fully copositive and the class E0f of fully semim...
AbstractThrough a succession of results, it is known that if the graph of an Hermitian matrix A is a...
The Gram dimension gd(G) of a graph G is the smallest inte- ger k ≥ 1 such that any partial real sym...
In this paper we study systems of the form $b\leq Mx\leq d$, $l\leq x\leq u$, where $M$ is obtained ...
AbstractIt is shown how a wide variety of transversal theorems can be given a common proof. The proo...
AbstractLet E∗ denote the class of square matrices M such that the linear complementarity problem Mz...
AbstractWe define a 0, 1 matrix M to be ideal if all vertices of the polyhedron { x: Mx ≥ 1, x ≥ 0 }...
AbstractFor an undirected simple graph G, the minimum rank among all positive semidefinite matrices ...