61 search results - page 8 / 13 » siamdm 2010 |
177
click to vote
SIAMDM
2010
15 years 15 days 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...
168
click to vote
SIAMDM
2010
15 years 15 days ago
2010
In this paper we consider the problem of computing the expected hitting time to a vertex for random walks on graphs. We give a method for computing an upper bound on the expected ...
123
click to vote
SIAMDM
2010
15 years 15 days 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...
119
click to vote
SIAMDM
2010
15 years 4 months ago
2010
Let F be an r-uniform hypergraph with f vertices, where f > r ≥ 3. In [12], R. Yuster posed the problem of whether there exists an algorithm which, for a given r-uniform hyper...
142
click to vote
SIAMDM
2010
15 years 4 months ago
2010
Let g1, . . . , gk be tropical polynomials in n variables with Newton polytopes P1, . . . , Pk. We study combinatorial questions on the intersection of the tropical hypersurfaces d...