Pages that link to "Item:Q1835927"
From MaRDI portal
The following pages link to Lower bounds on the independence number in terms of the degrees (Q1835927):
Displayed 20 items.
- New bounds for contagious sets (Q418891) (← links)
- Bounding the feedback vertex number of digraphs in terms of vertex degrees (Q534359) (← links)
- Greed is good: Approximating independent sets in sparse and bounded-degree graphs (Q679458) (← links)
- Ramsey numbers and an approximation algorithm for the vertex cover problem (Q762496) (← links)
- An upper bound on the Ramsey numbers R(3,k) (Q787165) (← links)
- A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs (Q987802) (← links)
- Large induced degenerate subgraphs (Q1092059) (← links)
- Lower bounds on the stability number of graphs computed in terms of degrees (Q1175993) (← links)
- Computing independent sets in graphs with large girth (Q1183338) (← links)
- A note on the independence number of triangle-free graphs. II (Q1186139) (← links)
- The maximum clique problem (Q1318271) (← links)
- Lower bounds for constant degree independent sets (Q1322210) (← links)
- Independence and the Havel-Hakimi residue (Q1322229) (← links)
- A note on greedy algorithms for the maximum weighted independent set problem (Q1861582) (← links)
- The largest transversal numbers of uniform hypergraphs (Q1910524) (← links)
- Edge density and independence ratio in triangle-free graphs with maximum degree three (Q1917491) (← links)
- Recoverable Values for Independent Sets (Q3012827) (← links)
- GreedyMAX-type Algorithms for the Maximum Independent Set Problem (Q3075512) (← links)
- RECOGNIZING BY ORDER AND DEGREE PATTERN OF SOME PROJECTIVE SPECIAL LINEAR GROUPS (Q4649512) (← links)
- The potential of greed for independence (Q4650180) (← links)