We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Mathematics/Investigations into the Universal Algebra of Hypergraph Coverings and Applications
ThesesMathematics

Investigations into the Universal Algebra of Hypergraph Coverings and Applications

Checking your access to this record.

Abstract & Overview

This thesis deals with two topics: acyclic covers and extension problems. The first part of the thesis deals with unbranched covers of graphs. The general theory of unbranched covers is discussed and then generalized to granular covers. Covers of this type maintain fixed structures of the covered graph. It is shown how unbranched covers of hypergraphs can be reduced to granular covers. With the help of further results we can identify the class of hypergraphs that have acyclic unbranched covers. The second part of the paper deals with extension problems. An extension problems it is about finitely extending finite structures so that partial automorphisms of the initial structure can be completed on the extension. We discuss classical results and reformulate them so that they are suitable for an algebraic characterization. These can be used to get new results regarding extension problems.

Cite this record

Julian Bitterlich (2019). Investigations into the Universal Algebra of Hypergraph Coverings and Applications. https://library.shubhaarti.com/content/247a64f7-0d01-4ddf-8d6f-fde161999664

Copy in another style

Bitterlich, J. (2019). Investigations into the Universal Algebra of Hypergraph Coverings and Applications. https://library.shubhaarti.com/content/247a64f7-0d01-4ddf-8d6f-fde161999664
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.