descriptionPublicationkeyboard_double_arrow_right Article 01 Aug 2017 English Publisher:Elsevier BVJournal:Electronic Notes in Discrete Mathematics, volume 61, pages 541-547 (issn: 1571-0653,

Authors: Grzesik, Andrzej; Král', Daniel; Lovász, László Miklós;

doi: 10.1016/j.endm.2017.07.005

Extremal graph theory and finite forcibility

- Summary
- Subjects
- Metrics

Abstract

We study the uniqueness of optimal solutions to extremal graph theory problems. Our main result is a counterexample to the following conjecture of Lov´asz, which is often referred to as saying that “every extremal graph theory problem has a finitely forcible optimum”: every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints such that the resulting set is satisfied by an asymptotically unique graph.

Related Organizations

Jagiellonian University
Poland
University of Warwick
United Kingdom
Massachusetts Institute of Technology
United States
Polish Academy of Sciences
Poland
Institute of Mathematics
Poland

Keywords

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	0
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average