KRÁĽ, Daniel, Taísa MARTINS, Péter Pál PACH and Marcin WROCHNA. The step Sidorenko property and non-norming edge-transitive graphs. Journal of Combinatorial Theory, Series A. San Diego: Academic Press, Elsevier, 2019, vol. 162, No 1, p. 34-54. ISSN 0097-3165. Available from: https://dx.doi.org/10.1016/j.jcta.2018.09.012.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name The step Sidorenko property and non-norming edge-transitive graphs
Authors KRÁĽ, Daniel (203 Czech Republic, belonging to the institution), Taísa MARTINS, Péter Pál PACH and Marcin WROCHNA.
Edition Journal of Combinatorial Theory, Series A, San Diego, Academic Press, Elsevier, 2019, 0097-3165.
Other information
Original language English
Type of outcome Article in a journal
Field of Study 10101 Pure mathematics
Country of publisher United States of America
Confidentiality degree is not subject to a state or trade secret
WWW URL
Impact factor Impact factor: 1.133
RIV identification code RIV/00216224:14330/19:00113648
Organization unit Faculty of Informatics
Doi http://dx.doi.org/10.1016/j.jcta.2018.09.012
UT WoS 000452250200003
Keywords in English Sidorenko's conjecture; Weakly forming graphs; Graph limits
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 19/4/2020 23:09.
Abstract
Sidorenko's Conjecture asserts that every bipartite graph H has the Sidorenko property, i.e., a quasirandom graph minimizes the density of H among all graphs with the same edge density. We study a stronger property, which requires that a quasirandom multipartite graph minimizes the density of H among all graphs with the same edge densities between its parts; this property is called the step Sidorenko property. We show that many bipartite graphs fail to have the step Sidorenko property and use our results to show the existence of a bipartite edge-transitive graph that is not weakly norming; this answers a question of Hatami (2010) [13].
PrintDisplayed: 19/7/2024 01:33