New lower bound on the modularity of Johnson graphs (Q2229339): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.2140/moscow.2021.10.77 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2140/moscow.2021.10.77 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3123719452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring general Kneser graphs and hypergraphs via high-discrepancy hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The isoperimetric number of random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection theorems with geometric consequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact modularity of line graphs of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity of some distance graphs / 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: A counterexample to Borsuk’s conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence number and the chromatic number of generalized preferential attachment models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random Kneser graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity in several random graph models / rank
 
Normal rank
Property / cites work
 
Property / cites work: General results on preferential attachment and clustering coefficient / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modularity of complex networks models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the chromatic number of random subgraphs of a certain distance graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Borsuk partition problem: the seventieth anniversary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Around Borsuk's hypothesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5431025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds for the clique-chromatic numbers of Johnson graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds on clique-chromatic numbers of Johnson graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence numbers of distance graphs with vertices in \(\{-1, 0, 1\}^n\) / 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: On a Frankl-Wilson theorem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.2140/MOSCOW.2021.10.77 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:15, 17 December 2024

scientific article
Language Label Description Also known as
English
New lower bound on the modularity of Johnson graphs
scientific article

    Statements

    New lower bound on the modularity of Johnson graphs (English)
    0 references
    23 February 2021
    0 references
    modularity
    0 references
    Johnson graphs
    0 references
    clusterization
    0 references

    Identifiers