On the Ramsey numbers for complete distance graphs with vertices in {l_brace}0,1{r_brace}{sup n}
A new problem of Ramsey type is posed for complete distance graphs in R{sup n} with vertices in the Boolean cube. This problem is closely related to the classical Nelson-Erdos-Hadwiger problem on the chromatic number of a space. Several quite sharp estimates are obtained for certain numerical charac...
Gespeichert in:
| Veröffentlicht in: | Sbornik. Mathematics 2009-12, Vol.200 (12) |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | 12 |
| container_start_page | |
| container_title | Sbornik. Mathematics |
| container_volume | 200 |
| creator | Mikhailov, Kirill A Raigorodskii, Andrei M |
| description | A new problem of Ramsey type is posed for complete distance graphs in R{sup n} with vertices in the Boolean cube. This problem is closely related to the classical Nelson-Erdos-Hadwiger problem on the chromatic number of a space. Several quite sharp estimates are obtained for certain numerical characteristics that appear in the framework of the problem. Bibliography: 15 titles. |
| doi_str_mv | 10.1070/SM2009V200N12ABEH004059;COUNTRYOFINPUT:INTERNATIONALATOMICENERGYAGENCY(IAEA) |
| format | Article |
| fullrecord | <record><control><sourceid>osti</sourceid><recordid>TN_cdi_osti_scitechconnect_21301247</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>21301247</sourcerecordid><originalsourceid>FETCH-osti_scitechconnect_213012473</originalsourceid><addsrcrecordid>eNqNik9PgzAcQBujifPPd2jiRRPRXxkwpqdKuo3EFYOdCSdktRMMFEI7jSH77u6wD-DlvXd4CAkCdwQmcP-6dAGmb3tw4tIntgDwwJ8-RsmKizRLZjF_WYmHmAuWcirihNNnKpJlHDHO0nlG54xH2XVMGb05QiPiBaHjheAe7xsCz_EDEpyiM2O-AMB3SThC74nGtlQ4LRqjfrHeNmvVG7xpeyzbpquVVfijMrbQUuHPvuhKg38qW-Jv1dtKKoMrjYc6X_eFVDu4JUN_6MFsO6x3F-hkU9RGXR58jq5mTEQLpzW2yo2srJKlbLVW0uYuGQNxvcn4f9cfvy1dSg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On the Ramsey numbers for complete distance graphs with vertices in {l_brace}0,1{r_brace}{sup n}</title><source>IOP Publishing Journals</source><source>Alma/SFX Local Collection</source><creator>Mikhailov, Kirill A ; Raigorodskii, Andrei M</creator><creatorcontrib>Mikhailov, Kirill A ; Raigorodskii, Andrei M</creatorcontrib><description>A new problem of Ramsey type is posed for complete distance graphs in R{sup n} with vertices in the Boolean cube. This problem is closely related to the classical Nelson-Erdos-Hadwiger problem on the chromatic number of a space. Several quite sharp estimates are obtained for certain numerical characteristics that appear in the framework of the problem. Bibliography: 15 titles.</description><identifier>ISSN: 1064-5616</identifier><identifier>EISSN: 1468-4802</identifier><identifier>DOI: 10.1070/SM2009V200N12ABEH004059;COUNTRYOFINPUT:INTERNATIONALATOMICENERGYAGENCY(IAEA)</identifier><language>eng</language><publisher>United States</publisher><subject>DISTANCE ; GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE ; GRAPH THEORY ; MATHEMATICAL METHODS AND COMPUTING ; MATHEMATICAL SPACE</subject><ispartof>Sbornik. Mathematics, 2009-12, Vol.200 (12)</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,314,777,781,882,27905,27906</link.rule.ids><backlink>$$Uhttps://www.osti.gov/biblio/21301247$$D View this record in Osti.gov$$Hfree_for_read</backlink></links><search><creatorcontrib>Mikhailov, Kirill A</creatorcontrib><creatorcontrib>Raigorodskii, Andrei M</creatorcontrib><title>On the Ramsey numbers for complete distance graphs with vertices in {l_brace}0,1{r_brace}{sup n}</title><title>Sbornik. Mathematics</title><description>A new problem of Ramsey type is posed for complete distance graphs in R{sup n} with vertices in the Boolean cube. This problem is closely related to the classical Nelson-Erdos-Hadwiger problem on the chromatic number of a space. Several quite sharp estimates are obtained for certain numerical characteristics that appear in the framework of the problem. Bibliography: 15 titles.</description><subject>DISTANCE</subject><subject>GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE</subject><subject>GRAPH THEORY</subject><subject>MATHEMATICAL METHODS AND COMPUTING</subject><subject>MATHEMATICAL SPACE</subject><issn>1064-5616</issn><issn>1468-4802</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><recordid>eNqNik9PgzAcQBujifPPd2jiRRPRXxkwpqdKuo3EFYOdCSdktRMMFEI7jSH77u6wD-DlvXd4CAkCdwQmcP-6dAGmb3tw4tIntgDwwJ8-RsmKizRLZjF_WYmHmAuWcirihNNnKpJlHDHO0nlG54xH2XVMGb05QiPiBaHjheAe7xsCz_EDEpyiM2O-AMB3SThC74nGtlQ4LRqjfrHeNmvVG7xpeyzbpquVVfijMrbQUuHPvuhKg38qW-Jv1dtKKoMrjYc6X_eFVDu4JUN_6MFsO6x3F-hkU9RGXR58jq5mTEQLpzW2yo2srJKlbLVW0uYuGQNxvcn4f9cfvy1dSg</recordid><startdate>20091231</startdate><enddate>20091231</enddate><creator>Mikhailov, Kirill A</creator><creator>Raigorodskii, Andrei M</creator><scope>OTOTI</scope></search><sort><creationdate>20091231</creationdate><title>On the Ramsey numbers for complete distance graphs with vertices in {l_brace}0,1{r_brace}{sup n}</title><author>Mikhailov, Kirill A ; Raigorodskii, Andrei M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-osti_scitechconnect_213012473</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>DISTANCE</topic><topic>GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE</topic><topic>GRAPH THEORY</topic><topic>MATHEMATICAL METHODS AND COMPUTING</topic><topic>MATHEMATICAL SPACE</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Mikhailov, Kirill A</creatorcontrib><creatorcontrib>Raigorodskii, Andrei M</creatorcontrib><collection>OSTI.GOV</collection><jtitle>Sbornik. Mathematics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Mikhailov, Kirill A</au><au>Raigorodskii, Andrei M</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the Ramsey numbers for complete distance graphs with vertices in {l_brace}0,1{r_brace}{sup n}</atitle><jtitle>Sbornik. Mathematics</jtitle><date>2009-12-31</date><risdate>2009</risdate><volume>200</volume><issue>12</issue><issn>1064-5616</issn><eissn>1468-4802</eissn><abstract>A new problem of Ramsey type is posed for complete distance graphs in R{sup n} with vertices in the Boolean cube. This problem is closely related to the classical Nelson-Erdos-Hadwiger problem on the chromatic number of a space. Several quite sharp estimates are obtained for certain numerical characteristics that appear in the framework of the problem. Bibliography: 15 titles.</abstract><cop>United States</cop><doi>10.1070/SM2009V200N12ABEH004059;COUNTRYOFINPUT:INTERNATIONALATOMICENERGYAGENCY(IAEA)</doi></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1064-5616 |
| ispartof | Sbornik. Mathematics, 2009-12, Vol.200 (12) |
| issn | 1064-5616 1468-4802 |
| language | eng |
| recordid | cdi_osti_scitechconnect_21301247 |
| source | IOP Publishing Journals; Alma/SFX Local Collection |
| subjects | DISTANCE GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE GRAPH THEORY MATHEMATICAL METHODS AND COMPUTING MATHEMATICAL SPACE |
| title | On the Ramsey numbers for complete distance graphs with vertices in {l_brace}0,1{r_brace}{sup n} |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-17T12%3A58%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-osti&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20the%20Ramsey%20numbers%20for%20complete%20distance%20graphs%20with%20vertices%20in%20%7Bl_brace%7D0,1%7Br_brace%7D%7Bsup%20n%7D&rft.jtitle=Sbornik.%20Mathematics&rft.au=Mikhailov,%20Kirill%20A&rft.date=2009-12-31&rft.volume=200&rft.issue=12&rft.issn=1064-5616&rft.eissn=1468-4802&rft_id=info:doi/10.1070/SM2009V200N12ABEH004059;COUNTRYOFINPUT:INTERNATIONALATOMICENERGYAGENCY(IAEA)&rft_dat=%3Costi%3E21301247%3C/osti%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |