Elusive extremal graphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F20%3A00118499" target="_blank" >RIV/00216224:14330/20:00118499 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.1112/plms.12382" target="_blank" >https://doi.org/10.1112/plms.12382</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1112/plms.12382" target="_blank" >10.1112/plms.12382</a>

Result language

angličtina

Original language name

Elusive extremal graphs

Original language description

We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz 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.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

R - Projekt Ramcoveho programu EK

Publication year

2020

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Proceedings of the London mathematical society

ISSN

0024-6115

e-ISSN

—

Volume of the periodical

121

Issue of the periodical within the volume

6

Country of publishing house

GB - UNITED KINGDOM

Number of pages

52

Pages from-to

1685-1736

UT code for WoS article

000594908500007

EID of the result in the Scopus database

2-s2.0-85097065424