547 search results - page 43 / 110 » dm 2008 |
126
click to vote
DM
2000
15 years 3 months ago
2000
The graph G(N; d) has vertex set V = {0; 1; : : : ; N - 1}, with {v; w} an edge if v - w
DM
2000
15 years 3 months ago
2000
We will prove a d-dimensional version of the Geelen and Simpson theorem. c 2000 Elsevier Science B.V. All rights reserved.
123
click to vote
DM
2000
15 years 3 months ago
2000
Let G be a Q4-free median graph on n vertices and m edges. Let k be the number of equivalence classes of Djokovi
119
click to vote
DM
2000
15 years 3 months ago
2000
It is well known that there is a simple equivalence between isoperimetric inequalities and certain analytic inequalities in Riemannian manifolds (see Rothaus, J. Funct. Anal. 64 (...