Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
New upper bound for the chromatic number of a random subgraph of a distance graph - MaRDI portal

New upper bound for the chromatic number of a random subgraph of a distance graph (Q2352580)

From MaRDI portal
scientific article
Language Label Description Also known as
English
New upper bound for the chromatic number of a random subgraph of a distance graph
scientific article

    Statements

    title
    New upper bound for the chromatic number of a random subgraph of a distance graph (English)
    0 references
    author
    A. S. Gusev
    0 references
    publication date
    3 July 2015
    0 references
    zbMATH Keywords
    Hadwiger-Nelson problem
    0 references
    distance graph
    0 references
    random subgraph
    0 references
    chromatic number
    0 references
    Turán number
    0 references
    cites work
    Q4339095
    0 references
    Q4410025
    0 references
    Q4002287
    0 references
    Q4146667
    0 references
    Q3267900
    0 references
    Q2743189
    0 references
    Q2723297
    0 references
    Q4519896
    0 references
    Q3781767
    0 references
    Q5781249
    0 references
    Q4063504
    0 references

    Identifiers

    Mathematics Subject Classification ID
    05C15
    0 references
    05C80
    0 references
    05C12
    0 references
    05C60
    0 references
    zbMATH DE Number
    6455266
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2352580&oldid=36189597"
    Powered by MediaWiki