SIAMDM
2010
12 years 11 months ago
2010
We first present an equivalent definition of relative generalized Hamming weights of a linear code and its subcodes, and we develop a method using finite projective geometry. Makin...
SIAMDM
2010
12 years 11 months ago
2010
Let G be a graph with n vertices and independence number . Hadwiger's conjecture implies that G contains a clique minor of order at least n/. In 1982, Duchet and Meyniel prov...
SIAMDM
2010
12 years 11 months ago
2010
Let d = d1 d2
SIAMDM
2010
12 years 11 months ago
2010
We show that maximal S-free convex sets are polyhedra when S is the set of integral points in some rational polyhedron of Rn . This result extends a theorem of Lov
SIAMDM
2010
12 years 11 months ago
2010
We consider a matching market, in which the aim is to maintain a popular matching between a set of applicants and a set of posts, where each applicant has a preference list rankin...
SIAMDM
2010
12 years 11 months ago
2010
Let A be a 0/1 matrix of size m
SIAMDM
2010
13 years 2 months ago
2010
Reed conjectured that for every ε > 0 and every integer ∆, there exists g such that the fractional total chromatic number of every graph with maximum degree ∆ and girth at...
SIAMDM
2010
13 years 2 months ago
2010
This paper is concerned with the minimum distance computation for higher dimensional toric codes defined by lattice polytopes in Rn . We show that the minimum distance is multipli...
SIAMDM
2010
13 years 2 months ago
2010
For a graph G = (V, E) we consider vertex-k-labellings f : V → {1, 2, . . . , k} for which the induced edge weighting w : E → {2, 3, . . . , 2k} with w(uv) = f(u) + f(v) is inj...
SIAMDM
2010
13 years 2 months ago
2010
Graph theory has been used to characterize the solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs betwee...