Independent sets in random sparse graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(22)- Randomly finding independent sets in locally sparse graphs
- Independent sets in random graphs from the weighted second moment method
- On the independent set problem in random graphs
- On the Lovász Theta Function for Independent Sets in Sparse Graphs
- On a problem of Spencer
- Two faces of greedy leaf removal procedure on graphs
- scientific article; zbMATH DE number 3854438 (Why is no real title available?)
- Largest sparse subgraphs of random graphs
- On the order of the largest induced tree in a random graph
- scientific article; zbMATH DE number 956843 (Why is no real title available?)
- On the independence number of random graphs
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Independence numbers of random sparse hypergraphs
- On the probability of independent sets in random graphs
- Finding a Maximum Independent Set in a Sparse Random Graph
- On the $b$ -Independence Number of Sparse Random Graphs
- Efficient computation of sparse structures
- Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Largest sparse subgraphs of random graphs
- General independence sets in random strongly sparse hypergraphs
- Statistical mechanics perspective on the phase transition in vertex covering of finite-connectivity random graphs
This page was built for publication: Independent sets in random sparse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3701457)
