EJC
2007
13 years 11 months ago
2007
Let G be a nonsingular connected mixed graph. We determine the mixed graphs G on at least seven vertices with exactly two Laplacian eigenvalues greater than 2. In addition, all mi...
EJC
2007
13 years 11 months ago
2007
EJC
2007
13 years 11 months ago
2007
Let the sign of a skew standard Young tableau be the sign of the permutation you get by reading it row by row from left to right, like a book. We examine how the sign property is ...
EJC
2007
13 years 11 months ago
2007
Abstract. We extend the Cayley-Sylvester formula for symmetric powers of SL2(C)modules, to plethysms defined by rectangle partitions. Ordinary partitions are replaced by plane par...
EJC
2007
13 years 11 months ago
2007
Balanced incomplete-block designs (BIBDs) with repeated blocks are studied and constructed. We continue work initiated by van Lint and Ryser in 1972 and pursued by van Lint in 197...
EJC
2007
13 years 11 months ago
2007
EJC
2007
13 years 11 months ago
2007
We present results on the size of the smallest maximal partial ovoids and on the size of the smallest maximal partial spreads of the generalized quadrangles W(q) and Q(4, q). Key ...
EJC
2007
13 years 11 months ago
2007
We study the notion of hypertree width of hypergraphs. We prove that, up to a constant factor, hypertree width is the same as a number of other hypergraph invariants that resemble...
EJC
2007
13 years 11 months ago
2007
Let K− r denote the graph obtained from Kr by deleting one edge. We show that for every integer r ≥ 4 there exists an integer n0 = n0(r) such that every graph G whose order n ...
EJC
2007
13 years 11 months ago
2007
