Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles (Q5379835): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2901376529 / rank
 
Normal rank

Revision as of 19:23, 19 March 2024

scientific article; zbMATH DE number 7066119
Language Label Description Also known as
English
Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles
scientific article; zbMATH DE number 7066119

    Statements

    Almost partitioning 2‐colored complete 3‐uniform hypergraphs into two monochromatic tight or loose cycles (English)
    0 references
    0 references
    0 references
    0 references
    14 June 2019
    0 references
    hypergraph
    0 references
    loose cycle
    0 references
    monochromatic partitions
    0 references
    tight cycle
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references