Disproof of a Conjecture of Erdős and Simonovits on the Turán Number of Graphs with Minimum Degree 3 (Q6101105)
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: Disproof of a Conjecture of Erdős and Simonovits on the Turán Number of Graphs with Minimum Degree 3 |
scientific article; zbMATH DE number 7690534
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Disproof of a Conjecture of Erdős and Simonovits on the Turán Number of Graphs with Minimum Degree 3 |
scientific article; zbMATH DE number 7690534 |
Statements
Disproof of a Conjecture of Erdős and Simonovits on the Turán Number of Graphs with Minimum Degree 3 (English)
0 references
31 May 2023
0 references
bipartite graph
0 references
0 references
0 references
0.8679346
0 references
0 references
0.86192447
0 references
0.86103326
0 references
