Abstract
An area of much recent research activity has been involved with tying the presence of certain minors in a matroid to specific elements of this matroid. The aim of this paper is to show that there are exactly two 3-connected simple graphsG with at least four edges and the property that ifH is a 3-connected simple graph havingG as a minor ande andf are edges ofH, thenH has a minor isomorphic toG which containse andf in its edge set. Some extensions of this result are also considered.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Asano, T., Nishizeki, T., Seymour, P.D.: A note on non-graphic matroids, J. Comb. Theory Ser. B37, 290–293 (1984)
Bixby, R.E.:L-matrices and a characterization of binary matroids, Discrete Math.8, 139–145 (1974)
Bondy, J.A., Murty, U.S.R.: “Graph theory with applications”, North-Holland (1976)
Coullard, C.R.: Counterexamples to conjectures on 4-connected matroids, Combinatorica6, 315–320 (1986)
Harary, F.: Graph theory, Addison Wesley, Reading (1969)
Kahn, J.: On the uniqueness of matroid representation over GF(4), Bull. London Math. Soc.20, 5–10 (1988)
Lazarson, T.: The representation problem for independence functions, J. London Math. Soc.33, 21–25 (1958)
Oxley, J.G.: On singleton 1-rounded sets of matroids, J. Comb. Theory Ser.B 37, 189–197 (1984)
Oxley, J.G.: On non-binary 3-connected matroids, Trans. Amer. Math. Soc.300, 663–679 (1987)
Oxley, J.G.: The regular matroids with no 5-wheel minor, J. Comb. Theory Ser. B46, 292–305 (1989)
Oxley, J.G., Reid, T.J.: The smallest rounded sets of binary matroids, Europ. J. Comb.11, 47–56 (1990)
Reid, T.J.: Triangles in 3-connected matroids, Discrete Math.90, 281–296 (1991)
Reid, T.J.: On roundedness in Matroid Theory, Ph.D. Thesis, Louisiana State University (1988)
Seymour, P.D.: On minors of non-binary matriods, Combinatorica1, 387–394 (1981)
Seymour, P.D.: Minors of 3-connected matroids, Europ. J. Comb.6, 375–382 (1985)
Seymour, P.D.: Adjacency in binary matroids, Europ. J. Comb.7, 171–176 (1986)
Seymour, P.D.: Matroid minors, In Handbook of combinatorics (Graham, R., Grötschel, M., Lovász, L., eds.). Elsevier (to be published)
Truemper, K., Tseng, F.T.: A decomposition of the matroids with the max-flow min-cut property, Discrete Applied Math.15, 329–364 (1986)
Tutte, W.T.: A theory of 3-connected graphs, Nederl. Akad. Wetensch. Proc. Ser. A64, 441–455 (1961)
Welsh, D.J.A.: Matroid Theory, Academic Press, London (1976)
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Reid, T.J. On fixing edges in graph minors. Graphs and Combinatorics 12, 59–68 (1996). https://doi.org/10.1007/BF01858445
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF01858445