Irreducibility of the Tutte Polynomial of a Connected Matroid
β Scribed by C. Merino; A. de Mier; M. Noy
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 117 KB
- Volume
- 83
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper, we shall consider the following problem: up to duality, is a connected matroid reconstructible from its connectivity function? Cunningham conjectured that this question has an affirmative answer, but Seymour gave a counter-example for it. In the same paper, Seymour proved that a conne
## Abstract The concept of a matroid vertex is introduced. The vertices of a matroid of a 3βconnected graph are in oneβtoβone correspondence with vertices of the graph. Thence directly follows Whitney's theorem that cyclic isomorphism of 3βconnected graphs implies isomorphism. The concept of a vert
## Abstract In this paper we present a relatively simple proof of Tutt's characterization of graphic matroids. The proof uses the notion of βsigned graphβ and it is βgraphicβ in the sense that it can be presented almost entirely by drawing (signed) graphs. Β© 1995 John Wiley & Sons, Inc.
W. T. Tutte conjectured that the coefficients \(t_{i, j}\) of his dichromate form unimodal sequences in \(i\) and \(j\) separately. P. D. Seymour and D. J. A. Welsh conjectured more generally that the same holds for the coefficients of the Tutte polynomial of an arbitrary matroid. We show, by an exa
An element e of a 3-connected matroid M is essential if neither the deletion M\e nor the contraction M/e is 3-connected. Tutte's Wheels and Whirls Theorem proves that the only 3-connected matroids in which every element is essential are the wheels and whirls. In this paper, we consider those 3-conne