Modularity of some distance graphs

DOI10.1016/J.EJC.2023.103833MaRDI QIDQ6182000zbMATH OpenFDO

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)

Full work available at URL https://doi.org/10.1016/J.EJC.2023.103833

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)

Recommendations

• New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\)
• Asymptotic modularity of some graph classes
• Modularity of Erdős-Rényi random graphs
• Modularity of minor‐free graphs
• Independence numbers and chromatic numbers of some distance graphs

Cites work

• A counterexample to Borsuk’s conjecture
• A generalization of Kneser graphs
• A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
• Around Borsuk's hypothesis
• Clique chromatic numbers of intersection graphs
• Counterexamples to Borsuk's conjecture with large girth
• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 487720 (Why is no real title available?)
• scientific article; zbMATH DE number 714489 (Why is no real title available?)
• scientific article; zbMATH DE number 3189757 (Why is no real title available?)
• Intersection theorems with geometric consequences
• Modularity of complex networks models
• Modularity of regular and treelike graphs
• On lower bounds for the chromatic number of spheres
• On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
• Search with small sets in presence of a liar
• The Borsuk partition problem: the seventieth anniversary
• The isoperimetric number of random regular graphs
• The number of edges in induced subgraphs of some distance graphs

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)