Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Szemerédi regularity lemma"'
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
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
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
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.
Autor:
Sammy Luo
In graph theory, the Szemer\'edi regularity lemma gives a decomposition of the indicator function for any graph $G$ into a structured component, a uniform part, and a small error. This result, in conjunction with a counting lemma that guarantees many
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4c215e6944618770db040ba5eec2a66d
http://arxiv.org/abs/1610.09587
http://arxiv.org/abs/1610.09587
Publikováno v:
Mathematical Proceedings of the Cambridge Philosophical Society, vol 161, iss 2
Mathematical Proceedings of the Cambridge Philosophical Society
Hosseini, K; Lovett, S; Moshkovitz, G; & Shapira, A. (2016). An improved lower bound for arithmetic regularity. MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 161(2), 193-197. doi: 10.1017/S030500411600013X. UC San Diego: Retrieved from: http://www.escholarship.org/uc/item/4p7012j5
Mathematical Proceedings of the Cambridge Philosophical Society
Hosseini, K; Lovett, S; Moshkovitz, G; & Shapira, A. (2016). An improved lower bound for arithmetic regularity. MATHEMATICAL PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 161(2), 193-197. doi: 10.1017/S030500411600013X. UC San Diego: Retrieved from: http://www.escholarship.org/uc/item/4p7012j5
The arithmetic regularity lemma due to Green [GAFA 2005] is an analogue of the famous Szemerédi regularity lemma in graph theory. It shows that for any abelian group G and any bounded function f : G → [0, 1], there exists a subgroup H ⩽ G of bou
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::88f7981aeb0a3744de8776b021ce7e53
https://escholarship.org/uc/item/4p7012j5
https://escholarship.org/uc/item/4p7012j5
Autor:
Bosnić, Filip
Ovaj rad daje dokaze funkcionalno analitičkih i vjerojatnosnih varijanti Szemerédijeve leme o regularnosti i međusobno ih uspoređuje. Dokaz funkcionalne varijante bazira se na Hahn-Banachovom teoremu o separaciji, dok je dokaz vjerojatnosne varij
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::31e2bc2d8429176cc80f060028693478
https://www.bib.irb.hr/836409
https://www.bib.irb.hr/836409
Autor:
József Balogh, Ryan Martin
In the Avoider-Enforcer game on the complete graph $K_n$, the players (Avoider and Enforcer) each take an edge in turn. Given a graph property $\mathcal{P}$, Enforcer wins the game if Avoider's graph has the property $\mathcal{P}$. An important param
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5d973e3640f58e91b564cea9194ce862
Autor:
Adam Zsolt Wagner, József Balogh
Publikováno v:
Recent Trends in Combinatorics ISBN: 9783319242965
Recently, Balogh–Morris–Samotij and Saxton–Thomason proved that hypergraphs satisfying some natural conditions have only few independent sets. Their main results already have several applications. However, the methods of proving these theorems
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b80783adfa627d28b376e00953c40753
https://doi.org/10.1007/978-3-319-24298-9_8
https://doi.org/10.1007/978-3-319-24298-9_8