On the $b$ -Independence Number of Sparse Random Graphs

DOI10.1017/S0963548304006108zbMath1049.05058OpenAlexW1964105374WikidataQ57401516 ScholiaQ57401516MaRDI QIDQ4819243

Geoffrey Atkinson, Alan M. Frieze

Publication date: 24 September 2004

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

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

zbMATH Keywords

random graphs\(b\)-independence number

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (5)

On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship ⋮ Spectral bounds for the \(k\)-independence number of a graph ⋮ Distance edge-colourings and matchings ⋮ Optimization of eigenvalue bounds for the independence and chromatic number of graph powers ⋮ On distance edge-colourings and matchings

This page was built for publication: On the $b$ -Independence Number of Sparse Random Graphs