No label defined (Q3315524)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3845597
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3845597

      Statements

      0 references
      1983
      0 references
      cycle matroid
      0 references
      edge coloring
      0 references
      Poincaré conjecture
      0 references
      cover of a graph
      0 references
      [For the entire collection see Zbl 0523.00001.] A cover S of a graph G is a set of induced subgraphs of G, the union of all of which is G and the intersection of any pair of which is connected. In this paper the author uses this notion to define a generalization \(M_ S(G)\) of the cycle matroid M(G) of G. If E is the edge-set of G, C is its set of cycles and \(C_ S\) is the set of cycles that are contained in some member of S, then \(M_ S(G)=(E,C_ S)\) where the role of \(C_ S\) here is the same as that of C in M(G). Thus a subset A of E is S- closed if, for all elements e of E-A, \(A\cup e\) does not contain a member of \(C_ S\) containing e; the S-closure \(c_ S(A)\) of A is the intersection of all S-closed sets containing A; and an S-basis is a subset B of E such that \(c_ S(B)=E\) and B does not contain a member of \(C_ S\). Clearly if \(S=\{G\}\) then \(M_ S(G)\) is the same as M(G). However, in general, \(c_ S\) may not satisfy the exchange property. The primary concern of this paper is with certain topologically-motivated questions about the S-bases of \(M_ S(G)\). In particular, the author formulates a graph-theoretic conjecture the truth of which would imply the 3-dimensional Poincaré Conjecture. The proofs of the main results of this paper have appeared elsewhere [the author, Geom. Dedicata 14, 303-314 (1983; Zbl 0518.05027)].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references