Name
Abstract | ||
|---|---|---|
We revisit the problem of computing the spreading and covering numbers. We show a connection between some of the spreading numbers and the number of non-negative integer 2 x 2 matrices whose entries sum to d, and we construct an algorithm to compute improved upper bounds for the covering numbers. |
Year | Venue | Keywords |
|---|---|---|
2013 | AUSTRALASIAN JOURNAL OF COMBINATORICS | projective space,graph theory,integer sequence |
DocType | Volume | ISSN |
Journal | 56 | 2202-3518 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| ben babcock | 1 | 0 | 0.34 |
| Adam Van Tuyl | 2 | 15 | 4.32 |