Independence numbers of random subgraphs of distance graphs (Q325669): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C80 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C12 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6640393 / rank
 
Normal rank
Property / zbMATH Keywords
 
distance graph
Property / zbMATH Keywords: distance graph / rank
 
Normal rank
Property / zbMATH Keywords
 
random subgraph
Property / zbMATH Keywords: random subgraph / rank
 
Normal rank
Property / zbMATH Keywords
 
independence number
Property / zbMATH Keywords: independence number / rank
 
Normal rank
Property / zbMATH Keywords
 
Erdős-Ko-Rado problem
Property / zbMATH Keywords: Erdős-Ko-Rado problem / rank
 
Normal rank
Property / zbMATH Keywords
 
Erdős-Rényi model
Property / zbMATH Keywords: Erdős-Rényi model / rank
 
Normal rank

Revision as of 02:54, 28 June 2023

scientific article
Language Label Description Also known as
English
Independence numbers of random subgraphs of distance graphs
scientific article

    Statements

    Independence numbers of random subgraphs of distance graphs (English)
    0 references
    0 references
    18 October 2016
    0 references
    distance graph
    0 references
    random subgraph
    0 references
    independence number
    0 references
    Erdős-Ko-Rado problem
    0 references
    Erdős-Rényi model
    0 references

    Identifiers