The \(t\)-stability number of a random graph

zbMath1222.05236arXiv0809.0141MaRDI QIDQ976708

Nikolaos Fountoulakis, Ross J. Kang, Colin J. H. McDiarmid

Publication date: 16 June 2010

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0809.0141

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Asymptotic enumeration (05A16) Vertex degrees (05C07)

Related Items (8)

On Two Limit Values of the Chromatic Number of a Random Hypergraph ⋮ How does the chromatic number of a random graph vary? ⋮ Maximum weight t-sparse set problem on vector-weighted graphs ⋮ Non-concentration of the chromatic number of a random graph ⋮ Co-2-plex vertex partitions ⋮ Unnamed Item ⋮ Largest sparse subgraphs of random graphs ⋮ Sharp concentration of the equitable chromatic number of dense random graphs

This page was built for publication: The \(t\)-stability number of a random graph