Almost all graphs with average degree 4 are 3-colorable (Q5917586): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Setting 2 variables at a time yields a new lower bound for random 3-SAT (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4705349 / 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: New methods to color the vertices of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost all graphs with 1.44n edges are 3-colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3286850 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the non-colorability threshold of a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable husbands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions of ordinary differential equations as limits of pure jump markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3917278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size and connectivity of the \(k\)-core of a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyses of load stealing models based on families of differential equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Studying Balanced Allocations with Differential Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5624492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A critical point for random graphs with a given degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Random Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sudden emergence of a giant \(k\)-core in a random graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential equations for random processes and random graphs / rank
 
Normal rank

Revision as of 15:22, 7 June 2024

scientific article; zbMATH DE number 2116464
Language Label Description Also known as
English
Almost all graphs with average degree 4 are 3-colorable
scientific article; zbMATH DE number 2116464

    Statements

    Almost all graphs with average degree 4 are 3-colorable (English)
    0 references
    0 references
    0 references
    18 November 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    Random graphs
    0 references
    Regular random graphs
    0 references
    Graph coloring
    0 references
    Threshold phenomena
    0 references