Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles (Q5854893): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Importer (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1903.04471 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:09, 20 April 2024

scientific article; zbMATH DE number 7321570
Language Label Description Also known as
English
Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles
scientific article; zbMATH DE number 7321570

    Statements

    Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    12 March 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    vertex partitioning
    0 references
    hypergraphs
    0 references
    tight cycles
    0 references
    0 references