Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles (Q1689909): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 05:38, 1 February 2024

scientific article
Language Label Description Also known as
English
Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles
scientific article

    Statements

    Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles (English)
    0 references
    0 references
    0 references
    0 references
    18 January 2018
    0 references
    monochromatic cycle partitioning
    0 references
    tight cycles
    0 references

    Identifiers