Modularity of some distance graphs

DOI10.1016/J.EJC.2023.103833MaRDI QIDQ6182000FDOQ6182000

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

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

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

Cites Work

• Intersection theorems with geometric consequences
• The Borsuk partition problem: the seventieth anniversary
• Around Borsuk's hypothesis
• A counterexample to Borsuk’s conjecture
• Title not available (Why is that?)
• Title not available (Why is that?)
• Modularity of complex networks models
• Title not available (Why is that?)
• The isoperimetric number of random regular graphs
• The number of edges in induced subgraphs of some distance graphs
• Search with small sets in presence of a liar
• Title not available (Why is that?)
• Modularity of regular and treelike graphs
• Clique chromatic numbers of intersection 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
• A generalization of Kneser graphs
• A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
• Counterexamples to Borsuk's conjecture with large girth

Cited In (1)

• New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6182000)