A simple proof for the lower bound of the girth of graphs \(D(n,q)\) (Q6080170)
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 7756968
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple proof for the lower bound of the girth of graphs \(D(n,q)\) |
scientific article; zbMATH DE number 7756968 |
Statements
A simple proof for the lower bound of the girth of graphs \(D(n,q)\) (English)
0 references
30 October 2023
0 references
Turán numbers
0 references
algebraically defined graphs
0 references
high girth
0 references
0 references
0 references
0.8016830682754517
0 references
0.7850145697593689
0 references
0.781196653842926
0 references
0.749108612537384
0 references
