Hostname: page-component-7b7567c8c-8p88z Total loading time: 0 Render date: 2026-11-19T10:53:19.025Z Has data issue: false hasContentIssue false

On a matroid generalization of graph connectivity

Published online by Cambridge University Press:  24 October 2008

James G. Oxley
Affiliation:
Australian National University, Canberra
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper relates the concept of n-connection for graphs to Tutte's theory of n-connection for matroids (12). In particular, we show how Tutte's definition may be modified to give a matroid concept directly generalizing the graph-theoretic notion of n-connection.

Information

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1981