A counterexample to a conjecture of Erdős (Q1613447)
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: A counterexample to a conjecture of Erdős |
scientific article; zbMATH DE number 1792383
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A counterexample to a conjecture of Erdős |
scientific article; zbMATH DE number 1792383 |
Statements
A counterexample to a conjecture of Erdős (English)
0 references
29 August 2002
0 references
In this short paper the author provides a counterexample to a conjecture of Erdős about non-3-colorable planar graphs with exactly 4 triangles. Specifically, Erdős had conjectured that any such graph must contain one of three specific graphs. The author disproves this conjecture by exhibiting a fourth such graph that does not contain the earlier three.
0 references
non-3-colorable planar graphs
0 references
triangles
0 references
