Abstract/Details

Two well-known graph theory results and their relationship to matroid theory


2011 2011

Other formats: Order a copy

Abstract (summary)

This thesis correlates two important graph theory ideas, Kruskal's greedy algorithm and Hall's marriage theorem, with matroid theory. Kruskal's algorithm is related to the situations in which a matroid exists. Also, Hall's marriage theorem is proved in graph theory and set systems contexts and a matroid theory analogue, Rado's theorem, is described.

Indexing (details)


Subject
Mathematics
Classification
0405: Mathematics
Identifier / keyword
Pure sciences; Greedy; Marriage; Matroid theory
Title
Two well-known graph theory results and their relationship to matroid theory
Author
Hogancamp, Aaron
Number of pages
46
Publication year
2011
Degree date
2011
School code
0390
Source
MAI 49/06M, Masters Abstracts International
Place of publication
Ann Arbor
Country of publication
United States
ISBN
9781124683720
Advisor
Mills, Allan
Committee member
Hetzel, Andrew; Smith, David
University/institution
Tennessee Technological University
Department
Mathematics
University location
United States -- Tennessee
Degree
M.S.
Source type
Dissertations & Theses
Language
English
Document type
Dissertation/Thesis
Dissertation/thesis number
1494221
ProQuest document ID
873809648
Copyright
Database copyright ProQuest LLC; ProQuest does not claim copyright in the individual underlying works.
Document URL
http://search.proquest.com/docview/873809648/fulltextPDF
Access the complete full text

You can get the full text of this document if it is part of your institution's ProQuest subscription.

Try one of the following:

  • Connect to ProQuest through your library network and search for the document from there.
  • Request the document from your library.
  • Go to the ProQuest login page and enter a ProQuest or My Research username / password.