Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
 
 
DownloadE-Mail
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Homomorphism Homogeneous Graphs

Rusinov, M. (2008). Homomorphism Homogeneous Graphs. Master Thesis, Universität des Saarlandes, Saarbrücken.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-0027-BB7C-C Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-0027-BB7D-A
Genre: Hochschulschrift

Dateien

einblenden: Dateien
ausblenden: Dateien
:
Momchil_Master_2008.pdf (beliebiger Volltext), 406KB
 
Datei-Permalink:
-
Name:
Momchil_Master_2008.pdf
Beschreibung:
-
OA-Status:
Sichtbarkeit:
Eingeschränkt (Max Planck Institute for Informatics, MSIN; )
MIME-Typ / Prüfsumme:
application/pdf
Technische Metadaten:
Copyright Datum:
-
Copyright Info:
-
Lizenz:
-

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Rusinov, Momchil1, Autor           
Mehlhorn, Kurt2, Ratgeber           
Bläser, Markus3, Gutachter
Affiliations:
1International Max Planck Research School, MPI for Informatics, Max Planck Society, ou_1116551              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              
3External Organizations, ou_persistent22              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: Homogeneous structures are a well studied research area and have variety uses like constructions in model theory and permutation group theory. Recently Cameron and Nesetril have introduced homomorphism homogeneity by incorporating homomorphisms in the definition of homogeneity. This has attracted a fair bit of attention from the research community and a growing amount of research has been done in this area for different relational structures. The first goal of this thesis is to investigate the different classes of homomorphism homogeneous simple undirected graphs with respect to different kinds of homomorphisms and study the relations between these classes. Although homogeneous graphs are heavily analyzed, little has been done for homomorphism homogeneous graphs. Cameron and Nesetril posed two open questions when they first defined these graphs. We answer both questions and also attempt to classify the homomorphism homogeneous graphs. This, we believe, opens up future possibilities for more analysis of these structures. In the thesis we also treat the category of graphs with loop allowed and further extend the idea of homogeneity by expanding the list of homomorphisms that are taken into consideration in the definitions.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2008-082008
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: Saarbrücken : Universität des Saarlandes
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: BibTex Citekey: Rusinov2008
 Art des Abschluß: Master

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle

einblenden: