On the conjecture for the girth of the bipartite graph \(D(k,q)\) (Q297945)
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 conjecture for the girth of the bipartite graph D(k,q) |
scientific article; zbMATH DE number 6595300
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the conjecture for the girth of the bipartite graph \(D(k,q)\) |
scientific article; zbMATH DE number 6595300 |
Statements
On the conjecture for the girth of the bipartite graph \(D(k,q)\) (English)
0 references
20 June 2016
0 references
bipartite graph
0 references
non-recurrent walk
0 references
non-recurrent circuit
0 references
girth cycle
0 references
edge-transitive graph
0 references
binomial coefficient
0 references
0 references
0 references
0.9613057971000672
0 references
0.931016445159912
0 references
0.8109431862831116
0 references
0.8057363033294678
0 references
0.7983675003051758
0 references
