New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs
From MaRDI portal
Publication:6604699
DOI10.1007/978-3-030-83823-2_35MaRDI QIDQ6604699
Mikhail M. Koshelev, Nikita Derevyanko, Andrei M. Raigorodskii
Publication date: 13 September 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- General results on preferential attachment and clustering coefficient
- Intersection theorems with geometric consequences
- The Borsuk partition problem: the seventieth anniversary
- Assortativity in generalized preferential attachment models
- Clustering coefficient of a spatial preferential attachment model
- New bounds on clique-chromatic numbers of Johnson graphs
- Exact modularity of line graphs of complete graphs
- New lower bound on the modularity of Johnson 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 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
- Probability Inequalities for Sums of Bounded Random Variables
- Clustering Properties of Spatial Preferential Attachment Model
- Local Clustering Coefficient in Generalized Preferential Attachment Models
- Modularity of some distance graphs
- On a Frankl-Wilson theorem and its geometric corollaries
This page was built for publication: New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604699)
