LARGE -FREE SUBGRAPHS IN -CHROMATIC GRAPHS (Q6082048)
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 7760884
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | LARGE -FREE SUBGRAPHS IN -CHROMATIC GRAPHS |
scientific article; zbMATH DE number 7760884 |
Statements
LARGE -FREE SUBGRAPHS IN -CHROMATIC GRAPHS (English)
0 references
3 November 2023
0 references
inverse Turán problem
0 references
chromatic number
0 references
connected graph
0 references
0.8172528743743896
0 references
0.766987144947052
0 references
0.7662829756736755
0 references
0.7637782096862793
0 references
0.7582211494445801
0 references
