The chromatic number of random graphs: an approach using a recurrence relation
Finding the chromatic number of large graphs is known to be NP-hard. Although various algorithms have been developed to efficiently compute chromatic numbers, they still take an enormous amount of time for large graphs. In this paper, we propose the recurrence relation to obtain the expected value o...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Abe, Yayoi Setoh, Ayuna Yoneda, Gen |
| description | Finding the chromatic number of large graphs is known to be NP-hard. Although
various algorithms have been developed to efficiently compute chromatic
numbers, they still take an enormous amount of time for large graphs. In this
paper, we propose the recurrence relation to obtain the expected value of the
chromatic number of random graphs in a short time. |
| doi_str_mv | 10.48550/arxiv.2412.01374 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2412_01374</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2412_01374</sourcerecordid><originalsourceid>FETCH-arxiv_primary_2412_013743</originalsourceid><addsrcrecordid>eNqFjjsOwjAQRN1QIOAAVOwFCPk4AtEiEBVV-mhxNrGl-KM1QXB7QkRPNVPM0zwh1lmayENZpjvkl3kmuczyJM2KvZyLW6UJlGZv8WEUuMHeicG3wOgab6FjDDoeAR1gCOxRaRiicR0gMKmBmZyisfYj791SzFrsI61-uRCby7k6XbfTcx3YWOR3_TWoJ4Pi_-IDass70w</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>The chromatic number of random graphs: an approach using a recurrence relation</title><source>arXiv.org</source><creator>Abe, Yayoi ; Setoh, Ayuna ; Yoneda, Gen</creator><creatorcontrib>Abe, Yayoi ; Setoh, Ayuna ; Yoneda, Gen</creatorcontrib><description>Finding the chromatic number of large graphs is known to be NP-hard. Although
various algorithms have been developed to efficiently compute chromatic
numbers, they still take an enormous amount of time for large graphs. In this
paper, we propose the recurrence relation to obtain the expected value of the
chromatic number of random graphs in a short time.</description><identifier>DOI: 10.48550/arxiv.2412.01374</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2024-12</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2412.01374$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2412.01374$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Abe, Yayoi</creatorcontrib><creatorcontrib>Setoh, Ayuna</creatorcontrib><creatorcontrib>Yoneda, Gen</creatorcontrib><title>The chromatic number of random graphs: an approach using a recurrence relation</title><description>Finding the chromatic number of large graphs is known to be NP-hard. Although
various algorithms have been developed to efficiently compute chromatic
numbers, they still take an enormous amount of time for large graphs. In this
paper, we propose the recurrence relation to obtain the expected value of the
chromatic number of random graphs in a short time.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNqFjjsOwjAQRN1QIOAAVOwFCPk4AtEiEBVV-mhxNrGl-KM1QXB7QkRPNVPM0zwh1lmayENZpjvkl3kmuczyJM2KvZyLW6UJlGZv8WEUuMHeicG3wOgab6FjDDoeAR1gCOxRaRiicR0gMKmBmZyisfYj791SzFrsI61-uRCby7k6XbfTcx3YWOR3_TWoJ4Pi_-IDass70w</recordid><startdate>20241202</startdate><enddate>20241202</enddate><creator>Abe, Yayoi</creator><creator>Setoh, Ayuna</creator><creator>Yoneda, Gen</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20241202</creationdate><title>The chromatic number of random graphs: an approach using a recurrence relation</title><author>Abe, Yayoi ; Setoh, Ayuna ; Yoneda, Gen</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-arxiv_primary_2412_013743</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Abe, Yayoi</creatorcontrib><creatorcontrib>Setoh, Ayuna</creatorcontrib><creatorcontrib>Yoneda, Gen</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Abe, Yayoi</au><au>Setoh, Ayuna</au><au>Yoneda, Gen</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The chromatic number of random graphs: an approach using a recurrence relation</atitle><date>2024-12-02</date><risdate>2024</risdate><abstract>Finding the chromatic number of large graphs is known to be NP-hard. Although
various algorithms have been developed to efficiently compute chromatic
numbers, they still take an enormous amount of time for large graphs. In this
paper, we propose the recurrence relation to obtain the expected value of the
chromatic number of random graphs in a short time.</abstract><doi>10.48550/arxiv.2412.01374</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2412.01374 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2412_01374 |
| source | arXiv.org |
| subjects | Mathematics - Combinatorics |
| title | The chromatic number of random graphs: an approach using a recurrence relation |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-21T01%3A10%3A44IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20chromatic%20number%20of%20random%20graphs:%20an%20approach%20using%20a%20recurrence%20relation&rft.au=Abe,%20Yayoi&rft.date=2024-12-02&rft_id=info:doi/10.48550/arxiv.2412.01374&rft_dat=%3Carxiv_GOX%3E2412_01374%3C/arxiv_GOX%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 |