Modularity of some distance graphs (Q2243703): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Modularity in several random graph models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering coefficient of a spatial preferential attachment model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering Properties of Spatial Preferential Attachment Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on lower bounds for the chromatic numbers of spaces of small dimension with metrics \(\ell_1\) and \(\ell_2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of edges in induced subgraphs of some distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence numbers of some distance graphs with vertices in \(\{-1, 0, 1\}^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexamples to Borsuk's conjecture with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lower bounds for the chromatic number of spheres / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition‐free families of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Families of sets with no matchings of sizes 3 and 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Panchromatic 3-colorings of random hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs / rank
 
Normal rank

Revision as of 03:01, 27 July 2024

scientific article
Language Label Description Also known as
English
Modularity of some distance graphs
scientific article

    Statements

    Identifiers