Pages that link to "Item:Q548268"

The following pages link to A lower bound on independence in terms of degrees (Q548268):

Displaying 10 items.

• Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061) (← 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)
• Lower bounds for constant degree independent sets (Q1322210) (← links)
• Logical independence of the axioms characterizing the degree measure in van den Brink et al. (2008) (Q2329158) (← links)
• Transversals and independence in linear hypergraphs with maximum degree two (Q2363113) (← links)
• The Fano plane and the strong independence ratio in hypergraphs of maximum degree 3 (Q2825489) (← links)
• Improved lower bounds on <i>k</i>‐independence (Q3970967) (← links)
• New bounds on the independence number of connected graphs (Q4554556) (← links)