Covering random graphs with monochromatic trees (Q6074874): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: On generalized graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering graphs by monochromatic trees and Helly-type results for hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial theorems in sparse random sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small transversals in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local constraints ensuring small representing sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals in uniform hypergraphs with property (7, 2) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5548200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex covers by monochromatic pieces -- a survey of results and problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering 3-Edge-Colored Random Graphs with Monochromatic Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic trees in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic cycle covers in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversals in uniform hypergraphs with property \((p,2)\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monochromatic cycle partitions in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4180391 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal results for random discrete structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Helly property in finite set systems / rank
 
Normal rank

Revision as of 05:54, 3 August 2024

scientific article; zbMATH DE number 7752409
Language Label Description Also known as
English
Covering random graphs with monochromatic trees
scientific article; zbMATH DE number 7752409

    Statements

    Covering random graphs with monochromatic trees (English)
    0 references
    0 references
    0 references
    19 October 2023
    0 references
    hypergraphs
    0 references
    random graphs
    0 references
    thresholds
    0 references

    Identifiers

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