Small odd cycles in 4-chromatic graphs (Q2744571)
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: Small odd cycles in 4-chromatic graphs |
scientific article; zbMATH DE number 1652667
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Small odd cycles in 4-chromatic graphs |
scientific article; zbMATH DE number 1652667 |
Statements
Small odd cycles in 4-chromatic graphs (English)
0 references
16 December 2001
0 references
odd cycle
0 references
chromatic number
0 references
girth
0 references
\textit{A. Nilli} [J. Graph Theory 31, No. 2, 145-147 (1999; Zbl 0924.05044)] showed that every 4-chromatic graph on \(n\) vertices contains an odd cycle of length less than \(\sqrt{8n}\). The author improves this bound to \(2\sqrt{n}+3\).
0 references
0.7909925580024719
0 references
0.7850640416145325
0 references
0.7835323214530945
0 references
0.7831261157989502
0 references
0.7761288285255432
0 references
