61 search results - page 5 / 13 » siamdm 2010 |
SIAMDM
2010
13 years 8 months ago
2010
Reed conjectured that for every ε > 0 and every integer ∆, there exists g such that the fractional total chromatic number of every graph with maximum degree ∆ and girth at...
SIAMDM
2010
13 years 8 months ago
2010
We introduce notions of linear reduction and linear equivalence of bijections for the purposes of study bijections between Young tableaux. Originating in Theoretical Computer Scie...
SIAMDM
2010
13 years 4 months ago
2010
We prove that if T is a tree on n vertices with maximum degree and the edge probability p(n) satisfies: np C max{ log n, n } for some constant > 0, then with high probability...
SIAMDM
2010
13 years 4 months ago
2010
Bounds on the minimum degree and on the number of vertices attaining it have been much studied for finite edge-/vertex-minimally kconnected/k-edge-connected graphs. We give an ove...
SIAMDM
2010
13 years 4 months ago
2010
A d-simplex is a collection of d + 1 sets such that every d of them have non-empty intersection and the intersection of all of them is empty. A strong d-simplex is a collection of...