New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs
From MaRDI portal
Publication:6604699
Cites work
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- A counterexample to Borsuk’s conjecture
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\)
- Around Borsuk's hypothesis
- Clique chromatic numbers of intersection graphs
- Clustering Properties of Spatial Preferential Attachment Model
- Clustering coefficient of a spatial preferential attachment model
- Counterexamples to Borsuk's conjecture with large girth
- Exact modularity of line graphs of complete graphs
- General results on preferential attachment and clustering coefficient
- Intersection theorems with geometric consequences
- Modularity of some distance graphs
- Modularity of some distance graphs
- New bounds for the clique-chromatic numbers of Johnson graphs
- New bounds on clique-chromatic numbers of Johnson graphs
- New lower bound on the modularity of Johnson graphs
- On a Frankl-Wilson theorem and its geometric corollaries
- On lower bounds for the chromatic number of spheres
- 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\)
- Probability Inequalities for Sums of Bounded Random Variables
- The Borsuk partition problem: the seventieth anniversary
- The number of edges in induced subgraphs of some distance graphs
- Three lectures on the Borsuk partition problem
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)
