Large monochromatic components in colorings of complete hypergraphs (Q6126163): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.jcta.2024.105867 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Partitioning random graphs into monochromatic components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large monochromatic components and long monochromatic cycles in random hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering random graphs with monochromatic trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic components with many edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramsey numbers of trails and circuits / rank
 
Normal rank
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 3‐edge‐colored Steiner triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering \(t\)-element sets by partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forcing large tight components in 3-graphs / 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: Minimum degree conditions for tight Hamilton cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4276003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Connected Components with Many Edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behavior of the chromatic index for hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large components in r-edge-colorings of Kn have diameter at most five / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.JCTA.2024.105867 / rank
 
Normal rank

Latest revision as of 18:41, 30 December 2024

scientific article; zbMATH DE number 7829187
Language Label Description Also known as
English
Large monochromatic components in colorings of complete hypergraphs
scientific article; zbMATH DE number 7829187

    Statements

    Large monochromatic components in colorings of complete hypergraphs (English)
    0 references
    0 references
    0 references
    9 April 2024
    0 references
    complete hypergraph
    0 references
    coloring
    0 references
    tight component
    0 references
    combinatorial designs
    0 references
    blow-up construction
    0 references

    Identifiers

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