On the b -Independence Number of Sparse Random Graphs
DOI10.1017/S0963548304006108zbMATH Open1049.05058OpenAlexW1964105374WikidataQ57401516 ScholiaQ57401516MaRDI QIDQ4819243FDOQ4819243
Authors: Geoffrey Atkinson, Alan 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
Recommendations
- On the independence number of sparse graphs
- Independence numbers of random sparse hypergraphs
- On the independence number of random graphs
- Independent sets in random sparse graphs
- On Counting Independent Sets in Sparse Graphs
- On the independence number of random interval graphs
- New lower bounds for the independence number of sparse graphs and hypergraphs
- scientific article; zbMATH DE number 5532162
Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (8)
- Revisit the Lovász local lemma
- On the Lovász Theta Function for Independent Sets in Sparse Graphs
- On trees with given diameter and extremal number of distance-\(k\) independent sets
- On distance edge-colourings and matchings
- Optimization of eigenvalue bounds for the independence and chromatic number of graph powers
- Spectral bounds for the \(k\)-independence number of a graph
- Distance edge-colourings and matchings
- On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship
This page was built for publication: On the $b$ -Independence Number of Sparse Random Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4819243)
