scientific article; zbMATH DE number 866059

zbMATH Open0972.05024MaRDI QIDQ4873224FDOQ4873224

Authors: Peter Horák, Edward Bertram 

Publication date: 13 November 2001

Title of this publication is not available (Why is that?)

Recommendations

• A lower bound on the independence number of a graph in terms of degrees and local clique sizes
• scientific article; zbMATH DE number 1112370
• Bounds on the independence number of a graph in terms of order, size and maximum degree
• Lower bounds for lower Ramsey numbers

zbMATH Keywords

lower boundsclique numberindependence numberRamsey numberconjectures

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (8)

• A lower bound on the independence number of a graph in terms of degrees and local clique sizes
• More spectral bounds on the clique and independence numbers
• Lower bounds for constant degree independent sets
• A lower bound on the independence number of a graph
• On the sum of independence number and average degree of a graph
• Coloring Graphs with Dense Neighborhoods
• The critical independence number and an independence decomposition
• Improved lower bounds on k‐independence

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4873224)