Další formáty:
BibTeX
LaTeX
RIS
@article{1554857, author = {Cooper, Jacob and Kaiser, Tomáš and Kráľ, Daniel and Noel, Jonathan}, article_number = {6}, doi = {http://dx.doi.org/10.1090/tran/7066}, keywords = {weak regularity; finitely forcible graph limits}, language = {eng}, issn = {0002-9947}, journal = {Transactions of the American Mathematical Society}, title = {Weak regularity and finitely forcible graph limits}, url = {http://dx.doi.org/10.1090/tran/7066}, volume = {370}, year = {2018} }
TY - JOUR ID - 1554857 AU - Cooper, Jacob - Kaiser, Tomáš - Kráľ, Daniel - Noel, Jonathan PY - 2018 TI - Weak regularity and finitely forcible graph limits JF - Transactions of the American Mathematical Society VL - 370 IS - 6 SP - 3833-3864 EP - 3833-3864 PB - American Mathematical Society SN - 00029947 KW - weak regularity KW - finitely forcible graph limits UR - http://dx.doi.org/10.1090/tran/7066 L2 - http://dx.doi.org/10.1090/tran/7066 N2 - Graphons are analytic objects representing limits of convergent sequences of graphs. Lovász and Szegedy conjectured that every finitely forcible graphon, i.e., any graphon determined by finitely many graph densities, has a simple structure. In particular, one of their conjectures would imply that every finitely forcible graphon has a weak epsilon-regular partition with the number of parts bounded by a polynomial in epsilon^-1. We construct a finitely forcible graphon W such that the number of parts in any weak epsilon-regular partition of W is at least exponential in epsilon ^-2/2^(5*logstar epsilon^-2). This bound almost matches the known upper bound for graphs and, in a certain sense, is the best possible for graphons. ER -
COOPER, Jacob, Tomáš KAISER, Daniel KRÁĽ a Jonathan NOEL. Weak regularity and finitely forcible graph limits. \textit{Transactions of the American Mathematical Society}. American Mathematical Society, 2018, roč.~370, č.~6, s.~3833-3864. ISSN~0002-9947. Dostupné z: https://dx.doi.org/10.1090/tran/7066.
|