Compactness and finite forcibility of graphons

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F19%3A00113679" target="_blank" >RIV/00216224:14330/19:00113679 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.4171/JEMS/901" target="_blank" >http://dx.doi.org/10.4171/JEMS/901</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.4171/JEMS/901" target="_blank" >10.4171/JEMS/901</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Compactness and finite forcibility of graphons

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Compactness and finite forcibility of graphons

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10101 - Pure mathematics

Projekt

—

Návaznosti

O - Projekt operacniho programu

Rok uplatnění

2019

Kód důvěrnosti údajů

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

Název periodika

Journal of the European Mathematical Society

ISSN

1435-9855

e-ISSN

—

Svazek periodika

21

Číslo periodika v rámci svazku

10

Stát vydavatele periodika

CH - Švýcarská konfederace

Počet stran výsledku

25

Strana od-do

3199-3223

Kód UT WoS článku

000480413600007

EID výsledku v databázi Scopus

2-s2.0-85072665080