Open Access Te Herenga Waka-Victoria University of Wellington
Browse
thesis_access.pdf (608.79 kB)

Tangles, Trees and Flowers

Download (608.79 kB)
thesis
posted on 2021-11-10, 23:47 authored by Clark, Ben

A tangle of order k in a connectivity function λ may be thought of as a "k-connected component" of λ. For a connectivity function λ and a tangle in λ of order k that satisfies a certain robustness condition, we describe a tree decomposition of λ that displays, up to a certain natural equivalence, all of the k-separations of λ that are non-trivial with respect to the tangle. In particular, for a tangle in a matroid or graph of order k that satisfies a certain robustness condition, we describe a tree decomposition of the matroid or graph that displays, up to a certain natural equivalence, all of the k- separations of the matroid or graph that are non-trivial with respect to the tangle.

History

Copyright Date

2011-01-01

Date of Award

2011-01-01

Publisher

Te Herenga Waka—Victoria University of Wellington

Rights License

Author Retains Copyright

Degree Discipline

Mathematics

Degree Grantor

Te Herenga Waka—Victoria University of Wellington

Degree Level

Masters

Degree Name

Master of Science

Victoria University of Wellington Item Type

Awarded Research Masters Thesis

Language

en_NZ

Victoria University of Wellington School

School of Mathematics, Statistics and Operations Research

Advisors

Whittle, Geoff