Graphs whose minimal rank is two: The finite fields case (Q4656586)
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 2144331
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs whose minimal rank is two: The finite fields case |
scientific article; zbMATH DE number 2144331 |
Statements
Graphs whose minimal rank is two: The finite fields case (English)
0 references
11 March 2005
0 references
rank
0 references
symmetric matrix
0 references
forbidden subgraph
0 references
bilinear symmetric form
0 references
0.9036452770233154
0 references
0.8897892832756042
0 references
0.8664050102233887
0 references
0.8464581370353699
0 references
0.8386700749397278
0 references
