76 search results - page 9 / 16 » jct 2008 |
JCT
2008
14 years 9 months ago
2008
A quasi-polynomial is a function defined of the form q(k) = cd(k) kd + cd-1(k) kd-1 +
JCT
2008
14 years 9 months ago
2008
We study packings of graphs with given maximal degree. We shall prove that the (hitherto unproved) Bollob
JCT
2008
14 years 8 months ago
2008
Let {a, b, c} be a triangle in a 3-connected matroid M. In this paper, we describe the structure of M relative to {a, b, c} when, for all t in {a, b, c}, either M\t is not 3-connec...
JCT
2008
14 years 9 months ago
2008
We study a discrete optimization problem introduced by Babai, Frankl, Kutin, and Stefankovic (2001), which provides bounds on degrees of polynomials with p-adically controlled beh...
JCT
2008
14 years 9 months ago
2008
Let M denote the Laplacian matrix of a graph G. Associated with G is a finite group (G), obtained from the Smith normal form of M, and whose order is the number of spanning trees o...