Pages that link to "Item:Q298956"

The following pages link to A lower bound on the independence number of a graph in terms of degrees and local clique sizes (Q298956):

Displaying 11 items.

• Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061) (← links)
• On a lower bound for the connectivity of the independence complex of a graph (Q409373) (← links)
• An improved lower bound on the independence number of a graph (Q477342) (← links)
• Interpolating between bounds on the independence number (Q708394) (← links)
• Lower bounds on the stability number of graphs computed in terms of degrees (Q1175993) (← links)
• A local independence number condition for \(n\)-extendable graphs (Q1296992) (← links)
• A probabilistic lower bound on the independence number of graphs (Q1336674) (← links)
• A lower bound on the independence number of a graph (Q1584341) (← links)
• Embedding clique-factors in graphs with low \(\ell\)-independence number (Q6038592) (← links)
• Improving the Caro-Wei bound and applications to Turán stability (Q6611049) (← links)
• Fractional coloring with local demands and applications to degree-sequence bounds on the independence number (Q6615757) (← links)