Ramsey regions and simplicial homology tables for graphs

Ramsey Theory is the investigation of edge-colored graphs which force a monochromatic subgraph. We devise a way of breaking certain Ramsey Theory problems into "smaller" pieces so that information about Ramsey Theory can be gained without solving the entire problem, (which is often difficult to solve). Next the work with Ramsey Regions for graphs is translated into the language of hypergraphs. Theorems and techniques are reworked to fit appropriately into the setting of hypergraphs. The work of persistence complex on large data sets is examined in the setting of graphs. Various simplicial complexes can be assigned to a graph. For a given simplicial complex the persistence complex can be constructed, giving a highly detailed graph invariant. Connections between the graph and persistence complex are investigated.

Name thesis:degree_name

Doctor of Philosophy (Ph.D.)

Level thesis:degree_level

Doctoral

Discipline thesis:degree_discipline

Mathematics

Grantor dc:publisher

Colorado State University. Libraries

Year dc:date.issued

2008

Authors dc:creator

• Frederick, Christopher Austin, author
• Peterson, Chris, advisor

• graph theory
• homology tables
• Ramsey regions
• mathematics

Statement dc:rights

• Copyright and other restrictions may apply. User is responsible for compliance with all applicable laws. For information about copyright law, please see https://libguides.colostate.edu/copyright.

Language dc:language.iso

eng, English

Identifier URI

https://doi.org/10.25675/3.019026

OAI identifier oai:identifier

oai:mountainscholar.org:10217/237737