On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem (Q2452861): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q123159679, #quickstatements; #temporary_batch_1723453003539 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q123159679 / rank | |||
Normal rank | |||
Latest revision as of 11:07, 12 August 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem |
scientific article |
Statements
On independence numbers of distance graphs with vertices in \(\{-1,0,1\}^n\): estimates, conjectures, and applications to the Nelson-Erdős-hadwiger problem and the borsuk problem (English)
0 references
5 June 2014
0 references
