Pages that link to "Item:Q2099383"
From MaRDI portal
The following pages link to Randomly finding independent sets in locally sparse graphs (Q2099383):
Displaying 6 items.
- Lower bounds for independence numbers of some locally sparse graphs (Q489716) (← links)
- Independent transversals in locally sparse graphs (Q2384801) (← links)
- Maximum weight independent sets and matchings in sparse random graphs. Exact results using the local weak convergence method (Q3376664) (← links)
- Rank and chromatic number of a graph (Q4355066) (← links)
- Independence numbers of locally sparse graphs and a Ramsey type problem (Q4716329) (← links)
- Experimental and Efficient Algorithms (Q5710051) (← links)