Duality principles for binary matroids and graphs
β Scribed by T.A. McKee
- Publisher
- Elsevier Science
- Year
- 1983
- Tongue
- English
- Weight
- 750 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
In hopes of better understanding graph-theoretic duality, a syntactical 'duality principle' is proved for circuit-cutset duality in binary matroids. The principle is shown to characterize binarity, and its theoretical and practicat applicability is discussed.
π SIMILAR VOLUMES
Three formulations and various consequences of a compactness principle are given. For example it is shown that an infinite partially ordered set has the jump number at most k if and only if none of its finite subsets has the jump number greater than k. Other applications include Ramsey-type results
In this paper we study the question of existence of a basis consisting only of cycles for the lattice Z(M) generated by the cycles of a binary matroid M. We show that if M has no Fano dual minor, then any set of fundamental circuits can be completed to a cycle basis of Z(M); moreover, for any one-el
Natural languages and random structures are given for which there are sentences A with no limit probability, yet for every A the difference between the probabilities that A holds on random structures of sizes n and n + 1 approaches zero with n.
In this chapter, the basic mathematical concepts necessary for working with non-binary error-correcting codes are presented. The elements of the non-binary codes described in this book belong to a non-binary alphabet and so this chapter begins with a discussion of the definition and properties of a