It is shown that any 4-chromatic graph on n vertices contains an odd cycle of length smaller than β 8n.
On odd circuits in chromatic graphs
β Scribed by W. G. Brown; H. A. Jung
- Publisher
- Akadmiai Kiad
- Year
- 1969
- Tongue
- English
- Weight
- 367 KB
- Volume
- 20
- Category
- Article
- ISSN
- 1588-2632
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract It is shown that every 4βchromatic graph on __n__ vertices contains an odd cycle of length less than $2\sqrt {n}\,+3$. This improves the previous bound given by Nilli [J Graph Theory 3 (1999), 145β147]. Β© 2001 John Wiley & Sons, Inc. J Graph Theory 37: 115β117, 2001
Let C be the clutter of odd circuits of a signed graph Γ°G; SΓ: For nonnegative integral edge-weights w; we are interested in the linear program minΓ°w t x: xΓ°CΓ51; for C 2 C; and x50Γ; which we denote by (P). The problem of solving the related integer program clearly contains the maximum cut problem,
It is known that the Mycielski graph can be generalized to obtain an infinite family of 4-chromatic graphs with no short odd cycles. The first proof of this result, due to Stiebitz, applied the topological method of Lov~sz. The proof presented here is elementary combinatorial.
## Abstract A graph is chromaticβchoosable if its choice number coincides with its chromatic number. It is shown in this article that, for any graph __G__, if we join a sufficiently large complete graph to __G__, then we obtain a chromaticβchoosable graph. As a consequence, if the chromatic number