Choosability in random hypergraphs (Q1850565): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Van H. Vu / rank | |||
Property / author | |||
Property / author: Van H. Vu / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1978476471 / 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 | |||
links / mardi / name | links / mardi / name | ||
Revision as of 19:11, 4 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Choosability in random hypergraphs |
scientific article |
Statements
Choosability in random hypergraphs (English)
0 references
10 December 2002
0 references
choice number
0 references
color lists
0 references
choice function
0 references
chromatic number
0 references
0 references