The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges (Q2255804)
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: The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges |
scientific article; zbMATH DE number 6405351
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges |
scientific article; zbMATH DE number 6405351 |
Statements
The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges (English)
0 references
18 February 2015
0 references
bipartite graphs
0 references
Turán's theorem
0 references
omission of edges
0 references
critical graph
0 references
girth
0 references
transitive automorphism group
0 references
