547 search results - page 90 / 110 » dm 2008 |
101
click to vote
DM
2008
15 years 25 days ago
2008
We introduce random recursive trees, where deterministically weights are attached to the edges according to the labeling of the trees. We will give a bijection between recursive t...
111
Voted
DM
2008
15 years 25 days ago
2008
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...
97
Voted
DM
2008
15 years 25 days ago
2008
The coefficient of fragmentability of a class of graphs measures the proportion of vertices that need to be removed from the graphs in the class in order to leave behind bounded s...
82
Voted
DM
2008
15 years 25 days ago
2008
Let G be a minimally k-connected graph with n nodes and m edges. Mader proved that if n 3k - 2 then m k(n - k), and for n 3k - 1 an equality is possible if, and only if, G is t...
60
Voted
DM
2008
15 years 25 days ago
2008
This paper examines some of the properties of point-weight incidence structures, i.e. incidence structures for which every point is assigned a positive integer weight. In particul...