Tilings in graphons
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985807%3A_____%2F21%3A00536118" target="_blank" >RIV/67985807:_____/21:00536118 - isvavai.cz</a>
Alternative codes found
RIV/67985840:_____/21:00536118
Result on the web
<a href="https://doi.org/10.1016/j.ejc.2020.103284" target="_blank" >https://doi.org/10.1016/j.ejc.2020.103284</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ejc.2020.103284" target="_blank" >10.1016/j.ejc.2020.103284</a>
Alternative languages
Result language
angličtina
Original language name
Tilings in graphons
Original language description
We introduce a counterpart to the notion of vertex disjoint tilings by copy of a fixed graph F to the setting of graphons. The case F=K_2 gives the notion of matchings in graphons. We give a transference statement that allows us to switch between the finite and limit notion, and derive several favorable properties, including the LP-duality counterpart to the classical relation between the fractional vertex covers and fractional matchings/tilings, and discuss connections with property testing. As an application of our theory, we determine the asymptotically almost sure F-tiling number of inhomogeneous random graphs G(n,W). As another application, in an accompanying paper [Hladky, Hu, Piguet: Komlos's tiling theorem via graphon covers, preprint] we give a proof of a strengthening of a theorem of Komlos [Komlos: Tiling Turán Theorems, Combinatorica, 2000].
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
<a href="/en/project/GJ16-07822Y" target="_blank" >GJ16-07822Y: Extremal graph theory and applications</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
European Journal of Combinatorics
ISSN
0195-6698
e-ISSN
1095-9971
Volume of the periodical
93
Issue of the periodical within the volume
March
Country of publishing house
GB - UNITED KINGDOM
Number of pages
23
Pages from-to
103284
UT code for WoS article
000607517300017
EID of the result in the Scopus database
2-s2.0-85103525717