Connected matroids with the smallest whitney numbers |
| |
Authors: | Tom Brylawski |
| |
Institution: | University of North Carolina, Department of Mathematics, Chapel Hill, NC 27514, U.S.A. |
| |
Abstract: | In “The Slimmest Geometric Lattices” (Trans. Amer. Math. Soc.). Dowling and Wilson showed that if G is a combinatorial geometry of rank r(G) = n, and if X(G) = Σμ(0, x)λr ? r(x) = Σ (?1)r ? kWkλk is the characteristic polynomial of G, then Thus γ(G) ? 2r ? 1 (n+2), where γ(G) = Σwk. In this paper we sharpen these lower bounds for connected geometries: If G is connected, r(G) ? 3, and n(G) ? 2 ((r, n) ≠ (4,3)), then |μ| ? (r? 1)n; and γ ? (2r ? 1 ? 1)(2n + 2). These bounds are all achieved for the parallel connection of an r-point circuit and an (n + 1)point line. If G is any series-parallel network, , and then . Further, if β is the Crapo invariant, then β(G) ? max(1, n ? r + 2). This lower bound is achieved by the parallel connection of a line and a maximal size series-parallel network. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|