Pages that link to "Item:Q3005112"

The following pages link to Independence, odd girth, and average degree (Q3005112):

Displaying 14 items.

• Independent sets and matchings in subcubic graphs (Q427833) (← 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 on the independence number of certain graphs of odd girth at least seven (Q617649) (← links)
• A better lower bound on average degree of online \(k\)-list-critical graphs (Q1753017) (← links)
• Adjacency eigenvalues of graphs without short odd cycles (Q2237217) (← links)
• Minimum \(k\)-path vertex cover (Q2275922) (← 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)
• New bounds on the independence number of connected graphs (Q4554556) (← links)
• New analytical lower bounds on the clique number of a graph (Q5268926) (← links)
• The maximum spectral radius of \(\{C_3, C_5\}\)-free graphs of given size (Q6046169) (← links)
• Uniquely restricted matchings in subcubic graphs without short cycles (Q6055410) (← links)
• Some bounds on the size of maximum G-free sets in graphs (Q6174763) (← links)