The set chromatic number of random graphs (Q323038): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Andrzej Dudek / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1517912555 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1502.01295 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The set chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set colorings in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New versions of Suen's correlation inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4519896 / 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 the chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on the set chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A correlation inequality and a poisson limit theorem for nonoverlapping balanced subgraphs of a random graph / rank
 
Normal rank

Latest revision as of 17:14, 12 July 2024

scientific article
Language Label Description Also known as
English
The set chromatic number of random graphs
scientific article

    Statements