Elusive extremal graphs

Elusive extremal graphs

We study the uniqueness of optimal solutions to extremal graph theory problems. Lovász conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the resulting set is satisfied by an asymptotically unique graph. T...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of the London Mathematical Society 2020-12, Vol.121 (6), p.1685-1736
Hauptverfasser: Grzesik, Andrzej, Král, Daniel, Lovász, László Miklós
Format: Artikel
Sprache:eng
Schlagworte:
05C35 (primary)
05C82 (secondary)
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 1736
container_issue 6
container_start_page 1685
container_title Proceedings of the London Mathematical Society
container_volume 121
creator Grzesik, Andrzej
Král, Daniel
Lovász, László Miklós
description We study the uniqueness of optimal solutions to extremal graph theory problems. Lovász conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the resulting set is satisfied by an asymptotically unique graph. This statement is often referred to as saying that ‘every extremal graph theory problem has a finitely forcible optimum’. We present a counterexample to the conjecture. Our techniques also extend to a more general setting involving other types of constraints.
doi_str_mv 10.1112/plms.12382
format Article
fullrecord <record><control><sourceid>wiley_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1112_plms_12382</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>PLMS12382</sourcerecordid><originalsourceid>FETCH-LOGICAL-c3092-f58fbdedb8a36064af9667f8f64631b2ec1297d48176d90817852f57902a3b8b3</originalsourceid><addsrcrecordid>eNp9jztLBDEURoMoOK42NrZbC1nvzWuSUpb1ASMKKtiFZCbRkQwOia_99-461lanOd8Hh5BjhAUisrMxDWWBjGu2QyoUCigT4mmXVABMUIUo98lBKa8AoDiXFTlZpY_Sf4Z5-H7PYXBp_pzd-FIOyV50qYSjP87I48XqYXlFm9vL6-V5Q1sOhtEodfRd6Lx2XIESLhql6qijEoqjZ6FFZupOaKxVZ2ADLVmUtQHmuNeez8jp9Nvmt1JyiHbM_eDy2iLYbZLdJtnfpI2Mk_zVp7D-x7R3zc39tPkBNEpM3A</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Elusive extremal graphs</title><source>Access via Wiley Online Library</source><creator>Grzesik, Andrzej ; Král, Daniel ; Lovász, László Miklós</creator><creatorcontrib>Grzesik, Andrzej ; Král, Daniel ; Lovász, László Miklós</creatorcontrib><description>We study the uniqueness of optimal solutions to extremal graph theory problems. Lovász conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the resulting set is satisfied by an asymptotically unique graph. This statement is often referred to as saying that ‘every extremal graph theory problem has a finitely forcible optimum’. We present a counterexample to the conjecture. Our techniques also extend to a more general setting involving other types of constraints.</description><identifier>ISSN: 0024-6115</identifier><identifier>EISSN: 1460-244X</identifier><identifier>DOI: 10.1112/plms.12382</identifier><language>eng</language><subject>05C35 (primary) ; 05C82 (secondary)</subject><ispartof>Proceedings of the London Mathematical Society, 2020-12, Vol.121 (6), p.1685-1736</ispartof><rights>2020 The Authors. The publishing rights in this article are licensed to the London Mathematical Society under an exclusive licence.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c3092-f58fbdedb8a36064af9667f8f64631b2ec1297d48176d90817852f57902a3b8b3</citedby><cites>FETCH-LOGICAL-c3092-f58fbdedb8a36064af9667f8f64631b2ec1297d48176d90817852f57902a3b8b3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1112%2Fplms.12382$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1112%2Fplms.12382$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,780,784,1417,27924,27925,45574,45575</link.rule.ids></links><search><creatorcontrib>Grzesik, Andrzej</creatorcontrib><creatorcontrib>Král, Daniel</creatorcontrib><creatorcontrib>Lovász, László Miklós</creatorcontrib><title>Elusive extremal graphs</title><title>Proceedings of the London Mathematical Society</title><description>We study the uniqueness of optimal solutions to extremal graph theory problems. Lovász conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the resulting set is satisfied by an asymptotically unique graph. This statement is often referred to as saying that ‘every extremal graph theory problem has a finitely forcible optimum’. We present a counterexample to the conjecture. Our techniques also extend to a more general setting involving other types of constraints.</description><subject>05C35 (primary)</subject><subject>05C82 (secondary)</subject><issn>0024-6115</issn><issn>1460-244X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNp9jztLBDEURoMoOK42NrZbC1nvzWuSUpb1ASMKKtiFZCbRkQwOia_99-461lanOd8Hh5BjhAUisrMxDWWBjGu2QyoUCigT4mmXVABMUIUo98lBKa8AoDiXFTlZpY_Sf4Z5-H7PYXBp_pzd-FIOyV50qYSjP87I48XqYXlFm9vL6-V5Q1sOhtEodfRd6Lx2XIESLhql6qijEoqjZ6FFZupOaKxVZ2ADLVmUtQHmuNeez8jp9Nvmt1JyiHbM_eDy2iLYbZLdJtnfpI2Mk_zVp7D-x7R3zc39tPkBNEpM3A</recordid><startdate>202012</startdate><enddate>202012</enddate><creator>Grzesik, Andrzej</creator><creator>Král, Daniel</creator><creator>Lovász, László Miklós</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>202012</creationdate><title>Elusive extremal graphs</title><author>Grzesik, Andrzej ; Král, Daniel ; Lovász, László Miklós</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c3092-f58fbdedb8a36064af9667f8f64631b2ec1297d48176d90817852f57902a3b8b3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><topic>05C35 (primary)</topic><topic>05C82 (secondary)</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Grzesik, Andrzej</creatorcontrib><creatorcontrib>Král, Daniel</creatorcontrib><creatorcontrib>Lovász, László Miklós</creatorcontrib><collection>CrossRef</collection><jtitle>Proceedings of the London Mathematical Society</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Grzesik, Andrzej</au><au>Král, Daniel</au><au>Lovász, László Miklós</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Elusive extremal graphs</atitle><jtitle>Proceedings of the London Mathematical Society</jtitle><date>2020-12</date><risdate>2020</risdate><volume>121</volume><issue>6</issue><spage>1685</spage><epage>1736</epage><pages>1685-1736</pages><issn>0024-6115</issn><eissn>1460-244X</eissn><abstract>We study the uniqueness of optimal solutions to extremal graph theory problems. Lovász conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the resulting set is satisfied by an asymptotically unique graph. This statement is often referred to as saying that ‘every extremal graph theory problem has a finitely forcible optimum’. We present a counterexample to the conjecture. Our techniques also extend to a more general setting involving other types of constraints.</abstract><doi>10.1112/plms.12382</doi><tpages>52</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0024-6115
ispartof Proceedings of the London Mathematical Society, 2020-12, Vol.121 (6), p.1685-1736
issn 0024-6115
1460-244X
language eng
recordid cdi_crossref_primary_10_1112_plms_12382
source Access via Wiley Online Library
subjects 05C35 (primary)
05C82 (secondary)
title Elusive extremal graphs
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-19T17%3A51%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-wiley_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Elusive%20extremal%20graphs&rft.jtitle=Proceedings%20of%20the%20London%20Mathematical%20Society&rft.au=Grzesik,%20Andrzej&rft.date=2020-12&rft.volume=121&rft.issue=6&rft.spage=1685&rft.epage=1736&rft.pages=1685-1736&rft.issn=0024-6115&rft.eissn=1460-244X&rft_id=info:doi/10.1112/plms.12382&rft_dat=%3Cwiley_cross%3EPLMS12382%3C/wiley_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