scientific article; zbMATH DE number 3365308

zbMath0231.05110MaRDI QIDQ5638352

No author found.

Publication date: 1971

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (21)

Refinement on Spectral Turán’s Theorem ⋮ General multiplicative Zagreb indices of graphs with given clique number ⋮ The Zagreb indices of graphs with a given clique number ⋮ Large dense neighbourhoods and Turán's theorem ⋮ Lower bounds on the stability number of graphs computed in terms of degrees ⋮ A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity ⋮ Independent sets in graphs ⋮ Extremality of degree-based graph entropies ⋮ An analytic approach to stability ⋮ On the Turán number for the hexagon ⋮ A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs ⋮ Turán’s Theorem Through Algorithmic Lens ⋮ A note on Turán's theorem ⋮ Simple and local independent set approximation ⋮ The zeroth-order general Randic index of graphs with a given clique number ⋮ Efficient bounds for the stable set, vertex cover and set packing problems ⋮ Turán's theorem and maximal degrees ⋮ A hypergraph extension of Turán's theorem ⋮ The independence number of graphs in terms of degrees ⋮ A note on greedy algorithms for the maximum weighted independent set problem ⋮ Some extremal graphs with respect to inverse degree

This page was built for publication: