The Complete n -Point Graph
A COMPLETE n -point graph consists of n points in a plane (or on the surface of a sphere), each joined to all the others by lines, not necessarily straight. The problem of determining the minimum number of intersections, m , for various values of n is being investigated.
Gespeichert in:
| Veröffentlicht in: | Nature (London) 1961-05, Vol.190 (4778), p.840-840 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 840 |
|---|---|
| container_issue | 4778 |
| container_start_page | 840 |
| container_title | Nature (London) |
| container_volume | 190 |
| creator | GOODMAN, H. P |
| description | A COMPLETE
n
-point graph consists of
n
points in a plane (or on the surface of a sphere), each joined to all the others by lines, not necessarily straight. The problem of determining the minimum number of intersections,
m
, for various values of
n
is being investigated. |
| doi_str_mv | 10.1038/190840a0 |
| format | Article |
| fullrecord | <record><control><sourceid>nature_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1038_190840a0</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>190840a0</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2330-f6bf35280746d53b5d36c727628df77fa85a8d2bac075a996379dd2614cdc8be3</originalsourceid><addsrcrecordid>eNptz79Lw0AcBfBDFIxVcBckow6n3_t9GSXUKhR0qHO43A_b0l7CXTr43xuJxcXpLR8e7yF0TeCBANOPpALNwcAJKghXEnOp1SkqAKjGoJk8Rxc5bwFAEMULdLNa-7Lu9v3OD76MJX7vNnEoF8n060t0Fswu-6vfnKGP5_mqfsHLt8Vr_bTEljIGOMg2MEE1KC6dYK1wTFpFlaTaBaWC0cJoR1tjQQlTVZKpyjkqCbfO6tazGbqbem3qck4-NH3a7E36agg0P6ea46mR3k80jyR--tRsu0OK47r_7O1koxkOyf-VHsE3o6NTHw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>The Complete n -Point Graph</title><source>Nature Journals Online</source><source>SpringerLink Journals - AutoHoldings</source><creator>GOODMAN, H. P</creator><creatorcontrib>GOODMAN, H. P</creatorcontrib><description>A COMPLETE
n
-point graph consists of
n
points in a plane (or on the surface of a sphere), each joined to all the others by lines, not necessarily straight. The problem of determining the minimum number of intersections,
m
, for various values of
n
is being investigated.</description><identifier>ISSN: 0028-0836</identifier><identifier>EISSN: 1476-4687</identifier><identifier>DOI: 10.1038/190840a0</identifier><language>eng</language><publisher>London: Nature Publishing Group UK</publisher><subject>Humanities and Social Sciences ; letter ; multidisciplinary ; Science ; Science (multidisciplinary)</subject><ispartof>Nature (London), 1961-05, Vol.190 (4778), p.840-840</ispartof><rights>Springer Nature Limited 1961</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2330-f6bf35280746d53b5d36c727628df77fa85a8d2bac075a996379dd2614cdc8be3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1038/190840a0$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1038/190840a0$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,780,784,2725,27923,27924,41487,42556,51318</link.rule.ids></links><search><creatorcontrib>GOODMAN, H. P</creatorcontrib><title>The Complete n -Point Graph</title><title>Nature (London)</title><addtitle>Nature</addtitle><description>A COMPLETE
n
-point graph consists of
n
points in a plane (or on the surface of a sphere), each joined to all the others by lines, not necessarily straight. The problem of determining the minimum number of intersections,
m
, for various values of
n
is being investigated.</description><subject>Humanities and Social Sciences</subject><subject>letter</subject><subject>multidisciplinary</subject><subject>Science</subject><subject>Science (multidisciplinary)</subject><issn>0028-0836</issn><issn>1476-4687</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1961</creationdate><recordtype>article</recordtype><recordid>eNptz79Lw0AcBfBDFIxVcBckow6n3_t9GSXUKhR0qHO43A_b0l7CXTr43xuJxcXpLR8e7yF0TeCBANOPpALNwcAJKghXEnOp1SkqAKjGoJk8Rxc5bwFAEMULdLNa-7Lu9v3OD76MJX7vNnEoF8n060t0Fswu-6vfnKGP5_mqfsHLt8Vr_bTEljIGOMg2MEE1KC6dYK1wTFpFlaTaBaWC0cJoR1tjQQlTVZKpyjkqCbfO6tazGbqbem3qck4-NH3a7E36agg0P6ea46mR3k80jyR--tRsu0OK47r_7O1koxkOyf-VHsE3o6NTHw</recordid><startdate>19610527</startdate><enddate>19610527</enddate><creator>GOODMAN, H. P</creator><general>Nature Publishing Group UK</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>19610527</creationdate><title>The Complete n -Point Graph</title><author>GOODMAN, H. P</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2330-f6bf35280746d53b5d36c727628df77fa85a8d2bac075a996379dd2614cdc8be3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1961</creationdate><topic>Humanities and Social Sciences</topic><topic>letter</topic><topic>multidisciplinary</topic><topic>Science</topic><topic>Science (multidisciplinary)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>GOODMAN, H. P</creatorcontrib><collection>CrossRef</collection><jtitle>Nature (London)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>GOODMAN, H. P</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The Complete n -Point Graph</atitle><jtitle>Nature (London)</jtitle><stitle>Nature</stitle><date>1961-05-27</date><risdate>1961</risdate><volume>190</volume><issue>4778</issue><spage>840</spage><epage>840</epage><pages>840-840</pages><issn>0028-0836</issn><eissn>1476-4687</eissn><abstract>A COMPLETE
n
-point graph consists of
n
points in a plane (or on the surface of a sphere), each joined to all the others by lines, not necessarily straight. The problem of determining the minimum number of intersections,
m
, for various values of
n
is being investigated.</abstract><cop>London</cop><pub>Nature Publishing Group UK</pub><doi>10.1038/190840a0</doi><tpages>1</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0028-0836 |
| ispartof | Nature (London), 1961-05, Vol.190 (4778), p.840-840 |
| issn | 0028-0836 1476-4687 |
| language | eng |
| recordid | cdi_crossref_primary_10_1038_190840a0 |
| source | Nature Journals Online; SpringerLink Journals - AutoHoldings |
| subjects | Humanities and Social Sciences letter multidisciplinary Science Science (multidisciplinary) |
| title | The Complete n -Point Graph |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-12T02%3A47%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-nature_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20Complete%20n%20-Point%20Graph&rft.jtitle=Nature%20(London)&rft.au=GOODMAN,%20H.%20P&rft.date=1961-05-27&rft.volume=190&rft.issue=4778&rft.spage=840&rft.epage=840&rft.pages=840-840&rft.issn=0028-0836&rft.eissn=1476-4687&rft_id=info:doi/10.1038/190840a0&rft_dat=%3Cnature_cross%3E190840a0%3C/nature_cross%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 |