Date of Thesis Acceptance
Major Department or Program
This thesis considers the open problem in topological graph theory: What is the largest connected graph of minimum degree 3 which has everywhere positive combinatorial curvature but is not in one of the infinite families of graphs of positive combinatorial curvature? This problem involves the generalization of the notion of curvature (a geometric concept) to graphs (a combinatorial structure). The thesis presents past progress on the upper and lower bounds for this problem as well as graph operations that may be used in the future for improving the lower bound.
Surfaces -- Mathematical models, Combinatorial geometry, Euler characteristic, Combinatorial designs and configurations, Theorie & Analyse -- topographical graph, Whitman College -- Dissertation collection 2016 -- Mathematics Department
Public Accessible Thesis
If you have questions about permitted uses of this content, please contact the ARMINDA administrator
In Copyright. URI: http://rightsstatements.org/vocab/InC/1.0/
This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s).