DM
2010
13 years 11 months ago
2010
DM
2010
13 years 11 months ago
2010
DM
2010
13 years 11 months ago
2010
For a graph G, denote by fk(G) the smallest number of vertices that must be deleted from G so that the remaining induced subgraph has its maximum degree shared by at least k verti...
DM
2010
13 years 11 months ago
2010
We resolve affirmatively some conjectures of Reiner, Stanton, and White [6] regarding enumeration of various classes of matrices which are invariant under certain cyclic row and co...
DM
2010
13 years 11 months ago
2010
DM
2010
13 years 11 months ago
2010
DM
2010
13 years 11 months ago
2010
Recently, Keller and Pilpel conjectured that the influence of a monotone Boolean function does not decrease if we apply to it an invertible linear transformation. Our aim in this s...
DM
2010
13 years 11 months ago
2010
Arratia, Bollob
DM
2010
13 years 11 months ago
2010
We say that a hypergraph H is hamiltonian path (cycle) saturated if H does not contain an open (closed) hamiltonian chain but by adding any new edge we create an open (closed) ham...
DM
2010
13 years 11 months 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...