Isomorphism of two infinite-chromatic triangle-free graphs (Q1124601)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Isomorphism of two infinite-chromatic triangle-free graphs
scientific article

    Statements

    Isomorphism of two infinite-chromatic triangle-free graphs (English)
    0 references
    0 references
    1988
    0 references
    This short note describes an interesting relationship between two infinite graphs; one constricted by Erdős and Hajnal, the other by Gyárfás.
    0 references
    chromatic number
    0 references
    infinite graphs
    0 references

    Identifiers