On Independent Sets in Graphs with Given Minimum Degree (Q5397737): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q234397 / rank
Normal rank
 
Property / author
 
Property / author: Colin J. H. McDiarmid / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1210.1497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two problems on independent sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings and independent sets of a fixed size in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Independent Sets in a Regular Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964191445 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:39, 30 July 2024

scientific article; zbMATH DE number 6261158
Language Label Description Also known as
English
On Independent Sets in Graphs with Given Minimum Degree
scientific article; zbMATH DE number 6261158

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references