Large monochromatic components in hypergraphs with large minimum codegree (Q6144911): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Large monochromatic components in multicolored bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large monochromatic components in almost complete graphs and bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering \(t\)-element sets by partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic components in edge-coloured graphs with large minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large monochromatic components in colorings of complete 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large monochromatic components in edge colored graphs with a minimum degree condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large monochromatic components in 3-colored non-complete graphs / rank
 
Normal rank

Latest revision as of 10:24, 26 August 2024

scientific article; zbMATH DE number 7796971
Language Label Description Also known as
English
Large monochromatic components in hypergraphs with large minimum codegree
scientific article; zbMATH DE number 7796971

    Statements

    Identifiers

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