Graduation Year

2016

Date of Thesis Acceptance

Spring 5-11-2016

Major Department or Program

Mathematics

Advisor(s)

Barry Balof

Abstract

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.

Page Count

46

Subject Headings

Surfaces -- Mathematical models, Combinatorial geometry, Eluer characteristic, Combinatorial designs and configurations, Theorie & Analyse -- topographical graph, Whitman College 2016 -- Dissertation collection -- Mathematics Department

Permanent URL

http://hdl.handle.net/10349/201608081286

Document Type

Public Accessible Thesis

Terms of Use

If you have questions about permitted uses of this content, please contact the ARMINDA administrator

Included in

Mathematics Commons

Share

COinS
 

Rights Statement

Rights Statement

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).