GRZESIK, Andrzej, Daniel KRÁĽ a Laszlo Miklos LOVASZ. Elusive extremal graphs. Proceedings of the London mathematical society. Cambridge: Cambridge University Press, 2020, roč. 121, č. 6, s. 1685-1736. ISSN 0024-6115. Dostupné z: https://dx.doi.org/10.1112/plms.12382. |
Další formáty:
BibTeX
LaTeX
RIS
@article{1759842, author = {Grzesik, Andrzej and Kráľ, Daniel and Lovasz, Laszlo Miklos}, article_location = {Cambridge}, article_number = {6}, doi = {http://dx.doi.org/10.1112/plms.12382}, keywords = {extremal graph theory}, language = {eng}, issn = {0024-6115}, journal = {Proceedings of the London mathematical society}, title = {Elusive extremal graphs}, url = {https://doi.org/10.1112/plms.12382}, volume = {121}, year = {2020} }
TY - JOUR ID - 1759842 AU - Grzesik, Andrzej - Kráľ, Daniel - Lovasz, Laszlo Miklos PY - 2020 TI - Elusive extremal graphs JF - Proceedings of the London mathematical society VL - 121 IS - 6 SP - 1685-1736 EP - 1685-1736 PB - Cambridge University Press SN - 00246115 KW - extremal graph theory UR - https://doi.org/10.1112/plms.12382 N2 - 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. ER -
GRZESIK, Andrzej, Daniel KRÁĽ a Laszlo Miklos LOVASZ. Elusive extremal graphs. \textit{Proceedings of the London mathematical society}. Cambridge: Cambridge University Press, 2020, roč.~121, č.~6, s.~1685-1736. ISSN~0024-6115. Dostupné z: https://dx.doi.org/10.1112/plms.12382.
|