Zobrazeno 1 - 10
of 219
pro vyhledávání: '"Szemerédi regularity lemma"'
Autor:
Elek, Gábor, Lippner, Gábor
We show that a sufficiently large graph of bounded degree can be decomposed into quasi-homogeneous pieces. The result can be viewed as a "finitarization" of the classical Farrell-Varadarajan Ergodic Decomposition Theorem.
Comment: Corrected an e
Comment: Corrected an e
Externí odkaz:
http://arxiv.org/abs/0809.2879
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Graph anonymization aims at reducing the ability of an attacker to identify the nodes of a graph by obfuscating its structural information. In $k$ -anonymity, this means making each node indistinguishable from at least other $k-1$ nodes. Simply strip
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5cd3f5c5654792d6aeeabc187da22abf
http://hdl.handle.net/10278/3733047
http://hdl.handle.net/10278/3733047
Publikováno v:
Frontiers in Big Data
Complex networks gathered from our online interactions provide a rich source of information that can be used to try to model and predict our behavior. While this has very tangible benefits that we have all grown accustomed to, there is a concrete pri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b07d62675ac4aa194a61b9291293ca8
https://doi.org/10.3389/fdata.2019.00007
https://doi.org/10.3389/fdata.2019.00007
Autor:
Jing, Yifan1 (AUTHOR) yifanjing17@gmail.com, Mohar, Bojan2 (AUTHOR) mohar@sfu.ca
Publikováno v:
Journal of the ACM. Dec2024, Vol. 71 Issue 6, p1-33. 33p.
Autor:
Vladimir Nikiforov, Béla Bollobás
Publikováno v:
Bolyai Society Mathematical Studies ISBN: 9783540852186
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::949fb798d9282fd83b36fb9f5e7d6710
https://doi.org/10.1007/978-3-540-85221-6_7
https://doi.org/10.1007/978-3-540-85221-6_7
Autor:
Hladký, Jan
In the thesis we provide a solution of the Loebl-Komlós-Sós Conjecture (1995) for dense graphs. We prove that for any q > 0 there exists a number n0 N such that for any n > n0 and k > qn the following holds. Let G be a graph of order n with at leas
Externí odkaz:
http://www.nusl.cz/ntk/nusl-294535
Autor:
Terence Tao
Publikováno v:
Acta Mathematica Hungarica. 161:443-487
In 1975, Szemeredi famously established that any set of integers of positive upper density contained arbitrarily long arithmetic progressions. The proof was extremely intricate but elementary, with the main tools needed being the van der Waerden theo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6959f00005b81c6679bc37fbdb52a7f9
https://doi.org/10.1007/s10474-020-01081-y
https://doi.org/10.1007/s10474-020-01081-y
Publikováno v:
Nonstandard Methods in Ramsey Theory and Combinatorial Number Theory ISBN: 9783030179557
In this chapter, we give nonstandard proofs of two of the more prominent results in extremal graph theory, namely the Triangle Removal Lemma and the Szemeredi Regularity Lemma.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c5595aeec0d6ebfadea73a74f9a9533f
https://doi.org/10.1007/978-3-030-17956-4_16
https://doi.org/10.1007/978-3-030-17956-4_16