Finitely Forcible Graphons with an Almost Arbitrary Structure

Kód výsledku v IS VaVaI

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

Výsledek na webu

<a href="http://dx.doi.org/10.19086/da.12058" target="_blank" >http://dx.doi.org/10.19086/da.12058</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.19086/da.12058" target="_blank" >10.19086/da.12058</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Finitely Forcible Graphons with an Almost Arbitrary Structure

Popis výsledku v původním jazyce

Graphons are analytic objects representing convergent sequences of large graphs. A graphon is said to be finitely forcible if it is determined by finitely many subgraph densities, i.e., if the asymptotic structure of graphs represented by such a graphon depends only on finitely many density constraints. Such graphons appear in various scenarios, particularly in extremal combinatorics. Lovasz and Szegedy conjectured that all finitely forcible graphons possess a simple structure. This was disproved in a strong sense by Cooper, Kral' and Martins, who showed that any graphon is a subgraphon of a finitely forcible graphon. We strengthen this result by showing for every epsilon &gt; 0 that any graphon spans a 1- epsilon proportion of a finitely forcible graphon.

Název v anglickém jazyce

Finitely Forcible Graphons with an Almost Arbitrary Structure

Popis výsledku anglicky

Graphons are analytic objects representing convergent sequences of large graphs. A graphon is said to be finitely forcible if it is determined by finitely many subgraph densities, i.e., if the asymptotic structure of graphs represented by such a graphon depends only on finitely many density constraints. Such graphons appear in various scenarios, particularly in extremal combinatorics. Lovasz and Szegedy conjectured that all finitely forcible graphons possess a simple structure. This was disproved in a strong sense by Cooper, Kral' and Martins, who showed that any graphon is a subgraphon of a finitely forcible graphon. We strengthen this result by showing for every epsilon &gt; 0 that any graphon spans a 1- epsilon proportion of a finitely forcible graphon.

Druh

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

CEP obor

—

OECD FORD obor

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

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2020

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

Discrete Analysis

ISSN

2397-3129

e-ISSN

—

Svazek periodika

2020

Číslo periodika v rámci svazku

9

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

36

Strana od-do

1-36

Kód UT WoS článku

000562346400001

EID výsledku v databázi Scopus

2-s2.0-85117058606