scientific article; zbMATH DE number 3365308
From MaRDI portal
Publication:5638352
zbMATH Open0231.05110MaRDI QIDQ5638352FDOQ5638352
Authors: P. Erdős 
Publication date: 1971
Title of this publication is not available (Why is that?)
Recommendations
Cited In (25)
- Some extremal graphs with respect to inverse degree
- Title not available (Why is that?)
- Efficient bounds for the stable set, vertex cover and set packing problems
- Vertex-degree function index for concave functions of graphs with a given clique number
- A note on the greedy algorithm for finding independent sets of \(C_k\)-free graphs
- Extremality of degree-based graph entropies
- Lower bounds on the stability number of graphs computed in terms of degrees
- Ultimate greedy approximation of independent sets in subcubic graphs
- The zeroth-order general Randic index of graphs with a given clique number
- The independence number of graphs in terms of degrees
- Turán's theorem and maximal degrees
- An analytic approach to stability
- A hypergraph extension of Turán's theorem
- A note on greedy algorithms for the maximum weighted independent set problem
- Refinement on Spectral Turán’s Theorem
- Independent sets in graphs
- Simple and local independent set approximation
- The multiplicative sum Zagreb indices of graphs with given clique number
- On the Turán number for the hexagon
- General multiplicative Zagreb indices of graphs with given clique number
- Large dense neighbourhoods and Turán's theorem
- A note on Turán's theorem
- Turán’s Theorem Through Algorithmic Lens
- A proof of the stability of extremal graphs, Simonovits' stability from Szemerédi's regularity
- The Zagreb indices of graphs with a given clique number
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 Q5638352)
