121 search results - page 12 / 25 » dm 2010 |
89
Voted
DM
2010
15 years 20 days ago
2010
A graph G is loosely-c-connected, or -c-connected, if there exists a number d depending on G such that the deletion of fewer than c vertices from G leaves precisely one infinite co...
93
Voted
DM
2010
15 years 20 days ago
2010
We answer the following question of R. L. Graham: What is the discrepancy of the lexicographically-least binary de Bruijn sequence? Here, "discrepancy" refers to the max...
99
Voted
DM
2010
15 years 20 days ago
2010
We show that the firefighter problem is NP-complete for cubic graphs. We also show that given a rooted tree of maximum degree three in which every leaf is the same distance from t...
101
Voted
DM
2010
14 years 10 months ago
2010
Suppose is a dual polar space of rank n and H is a hyperplane of . Cardinali, De Bruyn and Pasini have already shown that if n 4 and the line size is greater than or equal to fo...
85
Voted
DM
2010
15 years 20 days ago
2010
The stability method is very useful for obtaining exact solutions of many extremal graph problems. Its key step is to establish the stability property which, roughly speaking, sta...