Choosability in random hypergraphs (Q1850565): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1006/jctb.2001.2053 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q3142409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: List coloring of random and pseudo-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic approach to the Lovász local lemma. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Choice Number of Dense Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Choice Number of Random Hypergraphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JCTB.2001.2053 / rank
 
Normal rank

Latest revision as of 10:29, 16 December 2024

scientific article
Language Label Description Also known as
English
Choosability in random hypergraphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references