English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 Local TagsRelease HistoryDetailsSummary
  Homomorphism Homogeneous Graphs

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

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0027-BB7C-C Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0027-BB7D-A
Genre: Thesis

Files

show Files
hide Files
:
Momchil_Master_2008.pdf (Any fulltext), 406KB
 
File Permalink:
-
Name:
Momchil_Master_2008.pdf
Description:
-
OA-Status:
Visibility:
Restricted (Max Planck Institute for Informatics, MSIN; )
MIME-Type / Checksum:
application/pdf
Technical Metadata:
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Rusinov, Momchil1, Author           
Mehlhorn, Kurt2, Advisor           
Bläser, Markus3, Referee
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              

Content

show
hide
Free keywords: -
 Abstract: 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

show
hide
Language(s): eng - English
 Dates: 2008-082008
 Publication Status: Issued
 Pages: -
 Publishing info: Saarbrücken : Universität des Saarlandes
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Rusinov2008
 Degree: Master

Event

show

Legal Case

show

Project information

show

Source

show