Pages that link to "Item:Q1946229"
From MaRDI portal
The following pages link to A new lower bound on the independence number of graphs (Q1946229):
Displaying 23 items.
- Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061) (← links)
- A solution to an open problem on lower against number in graphs (Q266038) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- New lower bounds on independence number in triangle-free graphs in terms of order, maximum degree and girth (Q400363) (← 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 graphs (Q528993) (← links)
- Lower bounds on the independence number of certain graphs of odd girth at least seven (Q617649) (← links)
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited (Q899436) (← links)
- A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph (Q1265892) (← links)
- A probabilistic lower bound on the independence number of graphs (Q1336674) (← links)
- Revisit the Lovász local lemma (Q1366732) (← links)
- A lower bound on the independence number of a graph (Q1584341) (← links)
- An upper bound on the independence number of a graph computable in polynomial-time (Q1919180) (← links)
- Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives (Q2421880) (← links)
- New Bounds of Induced Acyclic Graphoidal Decomposition Number of a Graph (Q3296849) (← links)
- (Q3752410) (← links)
- Improved lower bounds on <i>k</i>‐independence (Q3970967) (← links)
- Lower bounds on size and independence inK4-free graphs (Q4362088) (← links)
- New bounds on the independence number of connected graphs (Q4554556) (← links)
- A new notion of vertex independence and rank for finite graphs (Q5246507) (← links)
- New analytical lower bounds on the clique number of a graph (Q5268926) (← links)
- (Q5463555) (← links)