61 search results - page 4 / 13 » siamdm 2010 |
SIAMDM
2010
13 years 2 months ago
2010
Let d = d1 d2
SIAMDM
2010
13 years 2 months ago
2010
Let (Cd m) denote the graph whose set of vertices is Zd m in which two distinct vertices are adjacent iff in each coordinate either they are equal or they differ, modulo m, by at
SIAMDM
2010
13 years 2 months ago
2010
Abstract. We study face vectors of barycentric subdivisions of simplicial homology manifolds. Recently, Kubitzke and Nevo proved that the g-vector of the barycentric subdivision of...
SIAMDM
2010
13 years 2 months ago
2010
Let A be a 0/1 matrix of size m
SIAMDM
2010
13 years 5 months ago
2010
A connected graph G is called t-perfect if its stable set polytope is determined by the non-negativity, edge and odd-cycle inequalities. Moreover, G is called strongly t-perfect i...