Pages that link to "Item:Q4650180"
From MaRDI portal
The following pages link to The potential of greed for independence (Q4650180):
Displayed 13 items.
- Independence in uniform linear triangle-free hypergraphs (Q279201) (← links)
- A lower bound on the independence number of a graph in terms of degrees and local clique sizes (Q298956) (← links)
- An improved lower bound on the independence number of a graph (Q477342) (← links)
- Dynamic monopolies for degree proportional thresholds in connected graphs of girth at least five and trees (Q511918) (← links)
- Bounds on the independence number of a graph in terms of order, size and maximum degree (Q516816) (← links)
- On sequential heuristic methods for the maximum independent set problem (Q521760) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- Remarks on dynamic monopolies with given average thresholds (Q2259575) (← links)
- MAX for \(k\)-independence in multigraphs (Q2312650) (← links)
- Transversals and independence in linear hypergraphs with maximum degree two (Q2363113) (← links)
- Partitions of graphs into small and large sets (Q2446835) (← links)
- The Fano Plane and the Strong Independence Ratio in Hypergraphs of Maximum Degree 3 (Q2825489) (← links)
- New bounds on the independence number of connected graphs (Q4554556) (← links)