Modularity of some distance graphs
From MaRDI portal
Cites work
- A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics _1 and _2
- Clustering Properties of Spatial Preferential Attachment Model
- Clustering coefficient of a spatial preferential attachment model
- Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs
- Counterexamples to Borsuk's conjecture with large girth
- Families of sets with no matchings of sizes 3 and 4
- Modularity in several random graph models
- On lower bounds for the chromatic number of spheres
- On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\)
- Panchromatic 3-colorings of random hypergraphs
- Partition-free families of sets
- The number of edges in induced subgraphs of some distance graphs
Cited in
(13)- Asymptotics of the independence number of a random subgraph of the graph \(G(n,r,<s)\)
- On stability of the independence number of a certain distance graph
- Spectrum of Johnson graphs
- New modularity bounds for graphs \(G(n,r,s)\) and \(G_p(n,r,s)\)
- Characterization of expansion-related properties of modular graphs
- Modularity of regular and treelike graphs
- New bounds on the modularity of Johnson graphs and random subgraphs of Johnson graphs
- On the independence number and the chromatic number of generalized preferential attachment models
- scientific article; zbMATH DE number 5054152 (Why is no real title available?)
- New Turán type bounds for Johnson graphs
- Bounds on Borsuk numbers in distance graphs of a special type
- New lower bound on the modularity of Johnson graphs
- Modularity in planted partition model
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 Q2243703)
