On Independent Sets in Graphs with Given Minimum Degree (Q5397737): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| 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 | |||
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
On Independent Sets in Graphs with Given Minimum Degree (English)
0 references
24 February 2014
0 references
largest random independent sets
0 references
