New lower bound on the modularity of Johnson graphs

DOI10.2140/moscow.2021.10.77zbMath1459.05264OpenAlexW3123719452MaRDI QIDQ2229339

Mikhail M. Koshelev

Publication date: 23 February 2021

Published in: Moscow Journal of Combinatorics and Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/moscow.2021.10.77

zbMATH Keywords

modularityJohnson graphsclusterization

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\) ⋮ Spectrum of Johnson graphs

Cites Work

• Unnamed Item
• General results on preferential attachment and clustering coefficient
• Random Kneser graphs and hypergraphs
• The isoperimetric number of random regular graphs
• Intersection theorems with geometric consequences
• Modularity in several random graph models
• The Borsuk partition problem: the seventieth anniversary
• Modularity of complex networks models
• Clustering coefficient of a spatial preferential attachment model
• On a Frankl-Wilson theorem
• New bounds on clique-chromatic numbers of Johnson graphs
• On the independence number and the chromatic number of generalized preferential attachment models
• Exact modularity of line graphs of complete graphs
• Modularity of some distance graphs
• New bounds for the clique-chromatic numbers of Johnson graphs
• On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\)
• On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
• On the chromatic number of random subgraphs of a certain distance graph
• Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
• Around Borsuk's hypothesis
• A counterexample to Borsuk’s conjecture

This page was built for publication: New lower bound on the modularity of Johnson graphs