Modularity of some distance graphs

Bobu, 2019, A generalization of Kneser’s graphs, Math. Notes, 107, 392, 10.1134/S0001434620030037 Bogolyubsky, 2019, A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics l1 and l2, Math. Notes, 105, 180, 10.1134/S000143461901022X Bollob’as, 1988, The isoperimetric number of random regular graphs, European J. Combin., 9, 241, 10.1016/S0195-6698(88)80014-3 Clauset, 2004, Finding community structure in very large networks, Phys. Rev. E, 70, 10.1103/PhysRevE.70.066111 Frankl, 1981, Intersection theorems with geometric consequences, Combinatorica, 1, 357, 10.1007/BF02579457 Kahn, 1993, A counterexample to Borsuk’s conjecture, Bull. (N.S.) AMS, 29, 60, 10.1090/S0273-0979-1993-00398-7 Katona, 1968, A theorem of finite sets Kostina, 2019, On lower bounds for the chromatic number of spheres, Math. Notes, 105, 16, 10.1134/S0001434619010036 Kostochka, 1993, On a lower bound for the isoperimetric number of cubic graphs, 251 Kruskal, 1963, The number of simplices in a complex Lancichinetti, 2011, Limits of modularity maximization in community detection, Phys. Rev. E, 84, 10.1103/PhysRevE.84.066122 Lichev, 2020 Lovász, 1993 MacWilliams, 1977 McDiarmid, 2018, Modularity of regular and treelike graphs, J. Complex Netw., 6 Newman, 2004, Fast algorithm for detecting community structure in networks, Phys. Rev. E, 69 Newman, 2004, Finding and evaluating community structure in networks, Phys. Rev. E, 69, 026 Ostroumova Prokhorenkova, 2016, Modularity of complex networks models, vol. 10088 Prosanov, 2019, Counterexamples to Borsuk’s conjecture with large girth, Math. Notes, 105, 874, 10.1134/S0001434619050249 Pushnyakov, 2019, The number of edges in induced subgraphs of some distance graphs, Math. Notes, 105, 582, 10.1134/S0001434619030313 Raigorodskii, 2004, The Borsuk partition problem: the seventieth anniversary, Math. Intelligencer, 26, 4, 10.1007/BF02986745 Raigorodskii, 2007, Three lectures on the Borsuk partition problem, Lond. Math. Soc. Lect. Note Ser., 347, 202 Raigorodskii, 2008, Around Borsuk’s conjecture, J. Math. Sci., 154, 604, 10.1007/s10958-008-9196-y Sagdeev, 2019, On a Frankl-Wilson theorem and its geometric corollaries, Acta Math. Univ. Comenian., 88, 1029 Shishunov, 2019, On the independence numbers of distance graphs with vertices in {−1,0,1}n, Dokl. Math., 100, N2 Shishunov, 2019, On the independence numbers of some distance graphs with vertices in {−1,0,1}n, Dokl. Math., 99, 165, 10.1134/S1064562419020194 Zakharov, 2019, Clique-chromatic numbers of graphs of intersections, Math. Notes, 105, N1, 10.1134/S0001434619010152