SIAMDM
2008
13 years 4 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 4 months ago
2008
Let Kn,n denote the complete bipartite graph with n vertices in each partite set and Kn,n +I denote Kn,n with a 1-factor added. It is proved in this paper that there exists an m-c...
SIAMDM
2008
13 years 4 months ago
2008
We consider the class of graphs that contain no bull, no odd hole, and no antihole of length at least five. We present a new algorithm that colors optimally the vertices of every g...
SIAMDM
2008
13 years 4 months ago
2008
SIAMDM
2008
13 years 4 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 4 months ago
2008
An n-lift of a digraph K, is a digraph with vertex set V (K)
SIAMDM
2008
13 years 4 months ago
2008
The power system monitoring problem asks for as few as possible measurement devices to be put in an electric power system. The problem has a graph theory model involving power dom...
SIAMDM
2008
13 years 4 months ago
2008
In [5], Reed conjectures that every graph satisfies ++1 2 . We prove this holds for graphs with disconnected complement. Combining this fact with a result of Molloy proves the co...
SIAMDM
2008
13 years 4 months ago
2008
SIAMDM
2008
13 years 4 months ago
2008
Based on a computer search, Anne Canteaut conjectured that the exponent 22r +2r + 1 in F26r and the exponent (2r + 1)2 in F24r yield bent monomial functions. These conjectures are ...