scientific article; zbMATH DE number 866059

MaRDI QIDQ4873224zbMATH OpenFDO

Authors Peter Horák, Edward Bertram

Publication date 13 November 2001

zbMATH Keywords

clique numberconjecturesindependence numberlower boundsRamsey number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

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

Cited in

(8)

• 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
• A lower bound on the independence number of a graph in terms of degrees and local clique sizes
• On the sum of independence number and average degree of a graph
• Improved lower bounds on k‐independence
• Coloring Graphs with Dense Neighborhoods
• The critical independence number and an independence decomposition

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)