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):
Displaying 36 items.
- Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061) (← links)
- On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence (Q394539) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- New bounds for contagious sets (Q418891) (← links)
- An improved lower bound on the independence number of a graph (Q477342) (← links)
- Independent sets in graphs (Q501998) (← links)
- On sequential heuristic methods for the maximum independent set problem (Q521760) (← 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)
- On the maximum independent set problem in graphs of bounded maximum degree (Q778157) (← 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)
- The \(k\)-regular induced subgraph problem (Q1786867) (← 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)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- MAX for \(k\)-independence in multigraphs (Q2312650) (← links)
- Extending the MAX algorithm for maximum independent set (Q2344024) (← links)
- New sufficient conditions for \(\alpha\)-redundant vertices (Q2346329) (← links)
- Partitions of graphs into small and large sets (Q2446835) (← links)
- Recoverable Values for Independent Sets (Q3012827) (← links)
- GreedyMAX-type Algorithms for the Maximum Independent Set Problem (Q3075512) (← links)
- New bounds on the independence number of connected graphs (Q4554556) (← links)
- RECOGNIZING BY ORDER AND DEGREE PATTERN OF SOME PROJECTIVE SPECIAL LINEAR GROUPS (Q4649512) (← links)
- The potential of greed for independence (Q4650180) (← links)
- Simple and local independent set approximation (Q5919021) (← links)
- Embedding bipartite distance graphs under Hamming metric in finite fields (Q6162866) (← links)
