On the independence and chromatic numbers of random regular graphs (Q1186131): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Weighted sums of certain dependent random variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of labeled graphs with given degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cliques in random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4207934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On colouring random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Solution of a Timetabling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform generation of random regular graphs of moderate degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5610923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp concentration of the chromatic number on random graphs \(G_{n,p}\) / rank
 
Normal rank

Latest revision as of 16:00, 15 May 2024

scientific article
Language Label Description Also known as
English
On the independence and chromatic numbers of random regular graphs
scientific article

    Statements

    On the independence and chromatic numbers of random regular graphs (English)
    0 references
    0 references
    0 references
    28 June 1992
    0 references
    Asymptotic concentration intervals are given for the independence and chromatic numbers of a random \(r\)-regular graph when \(r\) is sufficiently large.
    0 references
    regular graphs
    0 references
    random graphs
    0 references
    independence number
    0 references
    chromatic numbers
    0 references

    Identifiers