On the maximum number of edges in a <i>c</i><sub>4</sub>‐free subgraph of <i>q</i><sub><i>n</i></sub> (Q4320463)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 716425
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the maximum number of edges in a <i>c</i><sub>4</sub>‐free subgraph of <i>q</i><sub><i>n</i></sub> |
scientific article; zbMATH DE number 716425 |
Statements
On the maximum number of edges in a <i>c</i><sub>4</sub>‐free subgraph of <i>q</i><sub><i>n</i></sub> (English)
0 references
1 February 1995
0 references
number of edges
0 references
Erdős conjecture
0 references
subgraph
0 references
cube-graph
0 references
0.857953667640686
0 references
0.8544689416885376
0 references
0.8234521150588989
0 references
0.8179200291633606
0 references
