Graphs, matroids and polymatroids all have associated connectivity functions, and many properties of these structures follow from properties of their connectivity functions. This motivates the study of connectivity functions in general. It turns out that connectivity functions are surprisingly highly structured. We prove some interesting results about connectivity functions. In particular we show that every connectivity function is a connectivity function of a half-integral polymatroid.
History
Copyright Date
2014-01-01
Date of Award
2014-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
ANZSRC Type Of Activity code
970101 Expanding Knowledge in the Mathematical Sciences
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