Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Lianna Hambardzumyan"'
Publikováno v:
Discrete Applied Mathematics. 322:117-122
We refute the Probabilistic Universal Graph Conjecture of Harms, Wild, and Zamaraev, which states that a hereditary graph property admits a constant-size probabilistic universal graph if and only if it is stable and has at most factorial speed. Our c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::82e5a95441d098f5507f1f6d3e7ef3b7
https://doi.org/10.1016/j.dam.2022.07.023
https://doi.org/10.1016/j.dam.2022.07.023
Publikováno v:
Israel Journal of Mathematics. 253:555-616
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ea31bedb2259768fedbfd9355da3d602
https://doi.org/10.1007/s11856-022-2365-8
https://doi.org/10.1007/s11856-022-2365-8
Autor:
Yaqiao Li, Lianna Hambardzumyan
Publikováno v:
Discrete Mathematics. 343:111496
Extending the idea in Impagliazzo et al. (2014) we give a short information theoretic proof for Chang’s lemma that is based on Pinsker’s inequality.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4ade260d8c339c5c99a7c2c68d950826
https://doi.org/10.1016/j.disc.2019.04.015
https://doi.org/10.1016/j.disc.2019.04.015
We introduce a simple method for proving lower bounds for the size of the smallest percolating set in a certain graph bootstrap process. We apply this method to obtain recursive formulas for the sizes of the smallest percolating sets in multidimensio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::78cb6e965009b13fc59fef6a9b9475d8
Autor:
Avraham, Daniel, Yehudayoff, Amir
Publikováno v:
Computational Complexity; Jun2024, Vol. 33 Issue 1, p1-18, 18p
Publikováno v:
Oberwolfach Reports; 2024, Vol. 21 Issue 1, p871-934, 63p
Publikováno v:
Buletinul Academiei de Ştiinţe a Republicii Moldova: Matematica; 2023, Vol. 103 Issue 3, p26-36, 11p
Publikováno v:
Israel Journal of Mathematics; Mar2023, Vol. 253 Issue 2, p555-616, 62p
Autor:
Cristina Bazgan, Henning Fernau
This book constitutes the refereed proceedings of the 33rd International Workshop on Combinatorial Algorithms, IWOCA 2022, which took place as a hybrid event in Trier, Germany, during June 7-9, 2022.The 35 papers presented in these proceedings were c