Geodesic
Точная оценка снизу числа отображений линейного графа в~произвольный граф и~неравенство А.~Ф.~Сидоренко
Trudy Moskovskogo matematičeskogo obŝestva, Trudy Moskovskogo Matematicheskogo Obshchestva, Tome 84 (2023) no. 1, pp. 117-177.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{MMO_2023_84_1_a4,
     author = {A. M. Leontovich},
     title = {{\CYRT}{\cyro}{\cyrch}{\cyrn}{\cyra}{\cyrya} {\cyro}{\cyrc}{\cyre}{\cyrn}{\cyrk}{\cyra} {\cyrs}{\cyrn}{\cyri}{\cyrz}{\cyru} {\cyrch}{\cyri}{\cyrs}{\cyrl}{\cyra} {\cyro}{\cyrt}{\cyro}{\cyrb}{\cyrr}{\cyra}{\cyrzh}{\cyre}{\cyrn}{\cyri}{\cyrishrt} {\cyrl}{\cyri}{\cyrn}{\cyre}{\cyrishrt}{\cyrn}{\cyro}{\cyrg}{\cyro} {\cyrg}{\cyrr}{\cyra}{\cyrf}{\cyra} {\cyrv}~{\cyrp}{\cyrr}{\cyro}{\cyri}{\cyrz}{\cyrv}{\cyro}{\cyrl}{\cyrsftsn}{\cyrn}{\cyrery}{\cyrishrt} {\cyrg}{\cyrr}{\cyra}{\cyrf} {\cyri}~{\cyrn}{\cyre}{\cyrr}{\cyra}{\cyrv}{\cyre}{\cyrn}{\cyrs}{\cyrt}{\cyrv}{\cyro} {{\CYRA}.~{\CYRF}.~{\CYRS}{\cyri}{\cyrd}{\cyro}{\cyrr}{\cyre}{\cyrn}{\cyrk}{\cyro}}},
     journal = {Trudy Moskovskogo matemati\v{c}eskogo ob\^{s}estva},
     pages = {117--177},
     publisher = {mathdoc},
     volume = {84},
     number = {1},
     year = {2023},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MMO_2023_84_1_a4/}
}
TY  - JOUR
AU  - A. M. Leontovich
TI  - Точная оценка снизу числа отображений линейного графа в~произвольный граф и~неравенство А.~Ф.~Сидоренко
JO  - Trudy Moskovskogo matematičeskogo obŝestva
PY  - 2023
SP  - 117
EP  - 177
VL  - 84
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/MMO_2023_84_1_a4/
LA  - ru
ID  - MMO_2023_84_1_a4
ER  - 
%0 Journal Article
%A A. M. Leontovich
%T Точная оценка снизу числа отображений линейного графа в~произвольный граф и~неравенство А.~Ф.~Сидоренко
%J Trudy Moskovskogo matematičeskogo obŝestva
%D 2023
%P 117-177
%V 84
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/MMO_2023_84_1_a4/
%G ru
%F MMO_2023_84_1_a4
A. M. Leontovich. Точная оценка снизу числа отображений линейного графа в~произвольный граф и~неравенство А.~Ф.~Сидоренко. Trudy Moskovskogo matematičeskogo obŝestva, Trudy Moskovskogo Matematicheskogo Obshchestva, Tome 84 (2023) no. 1, pp. 117-177. http://geodesic.mathdoc.fr/item/MMO_2023_84_1_a4/

[1] R. E. Bellman, Vvedenie v teoriyu matrits, Nauka, M., 1969

[2] D. N. Bernshtein, A. G. Kushnirenko, A. G. Khovanskii, “Mnogogranniki Nyutona”, UMN, 31:3 (1976), 201–202 | Zbl

[3] P. Lankaster, Teoriya matrits, Nauka, M., 1973

[4] A. M. Leontovich, “Otsenki dlya chisla otobrazhenii grafov i dlya chisla podgrafov”, Probl. peredachi inform, 23:4 (1987), 58–74

[5] A. M. Leontovich, “Chislo otobrazhenii grafov, uporyadochenie grafov i teorema Myurkheda”, Problemy peredachi informatsii, 25:2 (1989), 91–104

[6] I. Makdonald, Simmetricheskie funktsii i mnogochleny Kholla, Mir, M., 1985

[7] A. F. Sidorenko, “Ekstremalnye zadachi teorii grafov i funktsionalno-analiticheskie neravenstva”, Materialy Vsesoyuznogo seminara po diskretnoi matematike i ee prilozheniyam, Izd-vo MGU, M., 1986, 99–105

[8] A. F. Sidorenko, “Neravenstva dlya funktsionalov, porozhdaemykh dvudolnymi grafami”, Diskret. matem., 3:3 (1991), 50–65

[9] F. V. Atkinson, G. A. Watterson, P. A. P. Moran, “A matrix inequality”, Quart. J. Math. Oxford Ser. (2), 11 (1960), 137–140 | DOI | MR

[10] I. Benjamini, Y. Peres, “A correlation inequality for tree-indexed Markov chains”, Seminar on Stochastic Processes, 1991 (Los Angeles, CA, 1991), Progr. Probab., 29, Birkhäuser Boston, Boston, MA, 1992, 7–14 | MR

[11] G. R. Blakley, Prabir Roy, “A Hölder type inequality for symmetric matrices with nonnegative entries”, Proc. Amer. Math. Soc., 16 (1965), 1244–1245 | MR | Zbl

[12] B. Bollobás, Extremal graph theory, London Mathematical Society Monographs, 11, Academic Press, Inc., London–New York, 1978 | MR | Zbl

[13] B. Bollobás, Random graphs, Cambridge Studies in Advanced Mathematics, 73, 2nd ed., Cambridge University Press, Cambridge, 2001 | MR | Zbl

[14] F. R. K. Chung, R. L. Graham, “Quasi-random set systems”, J. Amer. Math. Soc., 4:1 (1991), 151–196 | DOI | MR | Zbl

[15] F. R. K. Chung, R. L. Graham, “Quasi-random graphs with given degree sequences”, Random Structures Algorithms, 32:1 (2008), 1–19 | DOI | MR | Zbl

[16] F. R. K. Chung, R. L. Graham, R. M. Wilson, “Quasi-random graphs”, Combinatorica, 9:4 (1989), 345–362 | DOI | MR | Zbl

[17] D. Conlon, J. Fox, B. Sudakov, “An approximate version of Sidorenko's conjecture”, Geom. Funct. Anal., 20:6 (2010), 1354–1366 | DOI | MR | Zbl

[18] D. Conlon, J. H. Kim, Ch. Lee, J. Lee, “Some advances on Sidorenko's conjecture”, J. Lond. Math. Soc. (2), 98:3 (2018), 593–608 | DOI | MR | Zbl

[19] D. Conlon, J. Lee, “Sidorenko's conjecture for blow-ups”, Discrete Anal., 2021, 2 | MR

[20] J. Fox, B. Sudakov, “Dependent random choice”, Random Structures Algorithms, 38:1–2 (2011), 68–99 | DOI | MR | Zbl

[21] F. Franek, V. Rödl, “Ramsey problem on multiplicities of complete subgraphs in nearly quasirandom graphs”, Graphs Combin., 8:4 (1992), 299–308 | DOI | MR | Zbl

[22] H. Hatami, “Graph norms and Sidorenko's conjecture”, Israel J. Math., 175 (2010), 125–150 | DOI | MR | Zbl

[23] J. H. Kim, Ch. Lee, J. Lee, “Two approaches to Sidorenko's conjecture”, Trans. Amer. Math. Soc., 368:7 (2016), 5057–5074 | DOI | MR | Zbl

[24] A. G. Kouchnirenko, “Polyèdres de Newton et nombres de Milnor”, Invent. Math., 32:1 (1976), 1–31 | DOI | MR

[25] D. Král', T. L. Martins, P. P. Pach, M. Wrochna, “The step Sidorenko property and non-norming edge-transitive graphs”, J. Combin. Theory Ser. A, 162 (2019), 34–54 | DOI | MR | Zbl

[26] M. Krivelevich, B. Sudakov, “Pseudo-random graphs”, More sets, graphs and numbers, Bolyai Soc. Math. Stud., 15, Springer, Berlin, 2006, 199–262 | DOI | MR | Zbl

[27] L. Lovász, “Subgraph densities in signed graphons and the local Simonovits–Sidorenko conjecture”, Electron. J. Combin., 18:1 (2011), 127 | DOI | MR

[28] L. Lovász, Large networks and graph limits, American Mathematical Society Colloquium Publications, 60, AMS, Providence, RI, 2012 | MR | Zbl

[29] L. Lovász, “Very large graphs”, Current developments in mathematics, 2008 (2009), 67–128 | DOI | MR | Zbl

[30] P. Orbanz, D. M. Roy, “Bayesian models of graphs, arrays and other exchangeable random structures”, IEEE Transactions of Pattern Analysis and Machine Intelligence, 37:2 (2015), 437–461 | DOI | MR

[31] R. Pemantle, Yu. Peres, “Domination between trees and application to an explosion problem”, Ann. Probab., 22:1 (1994), 180–194 | DOI | MR | Zbl

[32] A. Sidorenko, “A partially ordered set of functionals corresponding to graphs”, Discrete Math., 131:1–3 (1994), 263–277 ; DIMACS Technical Report, No 90-67, 1990 | DOI | MR | Zbl

[33] A. Sidorenko, “A correlation inequality for bipartite graphs”, Graphs Combin., 9:2 (1993), 201–204 | DOI | MR | Zbl

[34] B. Szegedy, An information theoretic approach to Sidorenko's conjecture, 2014, arXiv: 1406.6738

[35] A. Thomason, “Pseudorandom graphs”, Random graphs '85 (Poznań, 1985), North-Holland Math. Stud., 144, North-Holland Publishing Co., Amsterdam, 1987, 307–331 ; Ann. Discrete Math., 33 | DOI | MR | Zbl