On the number of edges in induced subgraphs of a special distance graph (Q325666)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the number of edges in induced subgraphs of a special distance graph |
scientific article; zbMATH DE number 6640391
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of edges in induced subgraphs of a special distance graph |
scientific article; zbMATH DE number 6640391 |
Statements
On the number of edges in induced subgraphs of a special distance graph (English)
0 references
18 October 2016
0 references
distance graph
0 references
clique
0 references
cycle
0 references
coloring
0 references
Borsuk problem
0 references
0 references
0.9782631
0 references
0.9742681
0 references
0.97275573
0 references
0.93811214
0 references
0.9263021
0 references
0.90190315
0 references
0.89311665
0 references
0.88672537
0 references
0.8849956
0 references
