Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs (Q516075): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / author
 
Property / author: Yi Zhao / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C07 / 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: 05C65 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C35 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6696123 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph packing
Property / zbMATH Keywords: graph packing / rank
 
Normal rank
Property / zbMATH Keywords
 
hypergraph
Property / zbMATH Keywords: hypergraph / rank
 
Normal rank
Property / zbMATH Keywords
 
absorbing method
Property / zbMATH Keywords: absorbing method / rank
 
Normal rank
Property / zbMATH Keywords
 
regularity lemma
Property / zbMATH Keywords: regularity lemma / rank
 
Normal rank

Revision as of 04:10, 1 July 2023

scientific article
Language Label Description Also known as
English
Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs
scientific article

    Statements

    Minimum vertex degree thresholds for tiling complete 3-partite 3-graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    20 March 2017
    0 references
    graph packing
    0 references
    hypergraph
    0 references
    absorbing method
    0 references
    regularity lemma
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references