Number of the records: 1  

Homomorphism-homogeneity classes of countable L-colored graphs

  1. 1.
    SYSNO ASEP0508590
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleHomomorphism-homogeneity classes of countable L-colored graphs
    Author(s) Aranda, A. (DE)
    Hartman, David (UIVT-O) RID, SAI, ORCID
    Source TitleActa Mathematica Universitatis Comenianae. - : Univerzita Komenského v Bratislave - ISSN 0231-6986
    Roč. 88, č. 3 (2019), s. 377-382
    Number of pages6 s.
    Publication formPrint - P
    ActionEUROCOMB 2019. European Conference on Combinatorics, Graph Theory and Applications /9./
    Event date26.08.2019 - 30.08.2019
    VEvent locationBratislava
    CountrySK - Slovakia
    Event typeEUR
    Languageeng - English
    CountrySK - Slovakia
    Keywordshomomorphism-homogeneous ; monomorphism-homogeneous ; Rado graph ; classification ; Fraisse limit
    Subject RIVBA - General Mathematics
    OECD categoryPure mathematics
    Method of publishingOpen access
    Institutional supportUIVT-O - RVO:67985807
    UT WOS000484349000004
    EID SCOPUS85073394451
    AnnotationThe notion of homomorphism-homogeneity, introduced by Cameron and Nešetřil, originated as a variation on ultrahomogeneity. By fixing the type of finite homomorphism and global extension, several homogeneity classes, calledmorphism extension classes, can be defined. These classes are studied for various languages and axiom sets. Hartman, Hubička and Mašulović showed for finite undirected L-colored graphs without loops, where colors for vertices and edges are chosen from a partially ordered set L, that when L is a linear order, the classes HH and MH of L-colored graphs coincide, contributing thus to a question of Cameron and Nešetřil. They also showed that the same is true for vertex-uniform finite L-colored graphs when L is a diamond. In this work, we extend their results to countably infinite L-colored graphs, proving that the classes MH and HH coincide if and only if L is a linear order.
    WorkplaceInstitute of Computer Science
    ContactTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Year of Publishing2020
    Electronic addresshttp://www.iam.fmph.uniba.sk/amuc/ojs/index.php/amuc/article/view/1224/669
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.