108 search results - page 19 / 22 » siamdm 2008 |
SIAMDM
2008
13 years 7 months ago
2008
We study the variety of subtrees lying on the fringe of recursive trees and binary search trees by analyzing the distributional behavior of Xn,k, which counts the number of subtree...
SIAMDM
2008
13 years 7 months ago
2008
Let m and b be positive integers and let F be a hypergraph. In an (m, b) Maker-Breaker game F two players, called Maker and Breaker, take turns selecting previously unclaimed vert...
SIAMDM
2008
13 years 7 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
SIAMDM
2008
13 years 7 months ago
2008
We count all latin cubes of order n 6 and latin hypercubes of order n 5 and dimension d 5. We classify these (hyper)cubes into isotopy classes and paratopy classes (main classe...
SIAMDM
2008
13 years 7 months ago
2008
For a real c 1 and an integer n, let f(n, c) denote the maximum integer f such that every graph on n vertices contains an induced subgraph on at least f vertices in which the max...