Modularity of some distance graphs

DOI10.1016/j.ejc.2023.103833MaRDI QIDQ6182000

Mikhail M. Koshelev, Andrei M. Raigorodskii, M. M. Ipatov

Publication date: 23 January 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

Johnson graphsKneser graphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The isoperimetric number of random regular graphs
• Intersection theorems with geometric consequences
• The Borsuk partition problem: the seventieth anniversary
• Modularity of complex networks models
• A generalization of Kneser graphs
• On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
• On lower bounds for the chromatic number of spheres
• Clique chromatic numbers of intersection graphs
• A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
• The number of edges in induced subgraphs of some distance graphs
• Counterexamples to Borsuk's conjecture with large girth
• Around Borsuk's hypothesis
• A counterexample to Borsuk’s conjecture
• Modularity of regular and treelike graphs
• Search with small sets in presence of a liar

This page was built for publication: Modularity of some distance graphs