Fachinformationsdienst BAUdigital

A platform for research: civil engineering, architecture and urbanism

    Lower bounds for the chromatic numbers of distance graphs with large girth

    New search for: Sagdeev, A. A.

    Access

    Access via TIB
    Check availability in my library
    Order at Subito €

    Access

    Access via TIB
    Check availability in my library
    Order at Subito €

    Page navigation

    Document information
    Similar titles

    Export, share and cite

    Lower bounds for the chromatic numbers of distance graphs with large girth

    New search for: Sagdeev, A. A.

    Access

    Access via TIB
    Check availability in my library
    Order at Subito €

    Lower bounds for the chromatic numbers of distance graphs with large girth

    New search for: Sagdeev, A. A.

    Access

    Access via TIB
    Check availability in my library
    Order at Subito €

    Access

    Access via TIB
    Check availability in my library
    Order at Subito €

    Page navigation

    Document information
    Similar titles

    Export, share and cite

    Document information
    Title:

    Lower bounds for the chromatic numbers of distance graphs with large girth

    Contributors:

    Sagdeev, A. A. (author)

    Published in:

    MATHEMATICAL NOTES -NEW YORK- C/C OF MATEMATICHESKIE ZAMETIK ; 101 ; 515-528

    Publication date:

    2017-01-01

    Size:

    14 pages

    ISSN:

    0001-4346

    Type of media:

    Article (Journal)

    Type of material:

    Print

    Language:

    English

    Classification:

    DDC:  510

    © Metadata Copyright the British Library Board and other contributors. All rights reserved.

    Similar titles

    On the structure of distance graphs with large chromatic numbers

    Raigorodskii, A. M. | British Library Online Contents | 2006

    Chromatic numbers of 3-dimensional distance graphs containing no tetrahedra

    Rubanov, O. I. | British Library Online Contents | 2007

    Distance graphs with large chromatic number and without large cliques

    Raigorodskii, A. M. / Rubanov, O. I. | British Library Online Contents | 2010

    New upper bounds for the independence numbers of graphs with vertices in {−1, 0, 1} n and their applications to problems of the chromatic numbers of distance graphs

    Ponomarenko, E. I. / Raigorodskii, A. M. | British Library Online Contents | 2014

    Quantitative estimates of characteristics for hypergraphs of large girth and large chromatic number

    Khuzieva, A. / Shabanov, D. A. | British Library Online Contents | 2015

    Back to top