Lower bounds on the independence number in terms of the degrees (Q1835927): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0095-8956(83)90003-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976890066 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Ramsey numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111622 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independence ratio of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5569482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of an inequality of Marcus and Lopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Ramsey-Type Numbers and the Independence Ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the Ramsey numbers R(3,k) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:00, 13 June 2024

scientific article
Language Label Description Also known as
English
Lower bounds on the independence number in terms of the degrees
scientific article

    Statements

    Lower bounds on the independence number in terms of the degrees (English)
    0 references
    0 references
    1983
    0 references
    connected triangle-free graph
    0 references
    finding large independent sets
    0 references

    Identifiers