The Choice Number of Dense Random Graphs

DOI10.1017/S0963548399004101MaRDI QIDQ4948043zbMATH OpenOpenAlexWikidataFDO

Authors Michael Krivelevich

Publication date 26 April 2000

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0963548399004101

zbMATH Keywords

choice numberchromatic numbercolouringedge probabilityrandom graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• Choice Numbers of Graphs: a Probabilistic Approach
• The chromatic number of dense random graphs
• On the Choice Number of Random Hypergraphs
• The choice number of random bipartite graphs
• Choosability in random hypergraphs
• A note on the chromatic number of a dense random graph
• The concentration of the chromatic number of random graphs
• Tight asymptotics of clique‐chromatic numbers of dense random graphs

Cited in

(12)

• The choice number of random bipartite graphs
• Sparse graphs usually have exponentially many optimal colorings
• Choosability in random hypergraphs
• List coloring of random and pseudo-random graphs
• Choice number of Kneser graphs
• Random regular graphs of high degree
• On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs
• Choice Numbers of Graphs: a Probabilistic Approach
• Concentration of non‐Lipschitz functions and applications
• Dynamic choosability of triangle-free graphs and sparse random graphs
• On-line list colouring of random graphs
• On the Choice Number of Random Hypergraphs

This page was built for publication: The Choice Number of Dense Random Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4948043)