GLEBOV, Roman, Daniel KRÁĽ and Jan VOLEC. Compactness and finite forcibility of graphons. Journal of the European Mathematical Society. ZURICH: Springer, 2019, vol. 21, No 10, p. 3199-3223. ISSN 1435-9855. Available from: https://dx.doi.org/10.4171/JEMS/901.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Compactness and finite forcibility of graphons
Authors GLEBOV, Roman, Daniel KRÁĽ (203 Czech Republic, guarantor, belonging to the institution) and Jan VOLEC.
Edition Journal of the European Mathematical Society, ZURICH, Springer, 2019, 1435-9855.
Other information
Original language English
Type of outcome Article in a journal
Field of Study 10101 Pure mathematics
Country of publisher Switzerland
Confidentiality degree is not subject to a state or trade secret
WWW URL
Impact factor Impact factor: 2.190
RIV identification code RIV/00216224:14330/19:00113679
Organization unit Faculty of Informatics
Doi http://dx.doi.org/10.4171/JEMS/901
UT WoS 000480413600007
Keywords in English Graph limits; extremal combinatorics
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 8/5/2020 12:43.
Abstract
Graphons are analytic objects associated with convergent sequences of graphs. Problems from extremal combinatorics and theoretical computer science led to a study of graphons determined by finitely many subgraph densities, which are referred to as finitely forcible. Following the intuition that such graphons should have finitary structure, Lovasz and Szegedy conjectured that the topological space of typical vertices of a finitely forcible graphon is always compact. We disprove the conjecture by constructing a finitely forcible graphon such that the associated space is not compact. The construction method gives a general framework for constructing finitely forcible graphons with non-trivial properties.
PrintDisplayed: 19/7/2024 01:33