Cycles and matchings in randomly perturbed digraphs and hypergraphs (Q322218): 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: 05C20 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C65 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / 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: 05C45 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6639370 / rank
 
Normal rank
Property / zbMATH Keywords
 
hypergraph
Property / zbMATH Keywords: hypergraph / rank
 
Normal rank
Property / zbMATH Keywords
 
digraph
Property / zbMATH Keywords: digraph / rank
 
Normal rank
Property / zbMATH Keywords
 
tournament
Property / zbMATH Keywords: tournament / rank
 
Normal rank
Property / zbMATH Keywords
 
smoothed analysis
Property / zbMATH Keywords: smoothed analysis / rank
 
Normal rank
Property / zbMATH Keywords
 
perfect matching
Property / zbMATH Keywords: perfect matching / rank
 
Normal rank
Property / zbMATH Keywords
 
Hamilton cycle
Property / zbMATH Keywords: Hamilton cycle / rank
 
Normal rank
Property / zbMATH Keywords
 
pancyclic
Property / zbMATH Keywords: pancyclic / rank
 
Normal rank

Revision as of 03:12, 28 June 2023

scientific article
Language Label Description Also known as
English
Cycles and matchings in randomly perturbed digraphs and hypergraphs
scientific article

    Statements

    Cycles and matchings in randomly perturbed digraphs and hypergraphs (English)
    0 references
    0 references
    0 references
    0 references
    14 October 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    hypergraph
    0 references
    digraph
    0 references
    tournament
    0 references
    smoothed analysis
    0 references
    perfect matching
    0 references
    Hamilton cycle
    0 references
    pancyclic
    0 references