Pages that link to "Item:Q4899053"
From MaRDI portal
The following pages link to New Lower Bounds for the Independence Number of Sparse Graphs and Hypergraphs (Q4899053):
Displaying 8 items.
- Independence in uniform linear triangle-free hypergraphs (Q279201) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- An improved lower bound on the independence number of a graph (Q477342) (← links)
- Bounds on the independence number of a graph in terms of order, size and maximum degree (Q516816) (← links)
- New results on \(k\)-independence of hypergraphs (Q2689120) (← links)
- On Subgraphs of Bounded Degeneracy in Hypergraphs (Q3181066) (← links)
- New bounds on the independence number of connected graphs (Q4554556) (← links)
- Randomized greedy algorithm for independent sets in regular uniform hypergraphs with large girth (Q6074650) (← links)
