Abstract
It is known that the gap between the clique number and the chromatic number of a graph \(G\) can be arbitrarily large. The fractional chromatic number satisfies \(\omega (G)\le \chi _f(G) \le \chi (G)\). Larsen et al. (J Graph Theory 19:411–416, 1995) use the Mycielski construction to show that the gap in both of those inequalities can also be arbitrarily large. In this work, we prove the analogous result for the fractional versions of both weak and strong chromatic numbers of uniform hypergraphs. We shall remark that for strong fractional colorings the Mycielski construction and the proof of Larsen et al. can be generalized. For weak fractional colorings, however, the same is not true. We then propose an alternative construction to handle weak fractional colorings of uniform hypergraphs. Finally, we describe, by forbidden induced subgraphs, an interesting class of \(r\)-uniform hypergraphs with the property that the chromatic number is bounded by a function of its clique number. Such a family arises from affine planes of dimension \(r-2\) in \(\mathbb {RP}^{d}\).
Similar content being viewed by others
References
Berge, C.: Hypergraphs: Combinatorics of Finite Sets. In: North-Holland Mathematical Library, vol. 45 (1989)
Chudnovsky, M., Seymour, P.: Claw-free Graphs VI. Coloring claw-free graphs. J. Combin. Theory. Ser B 100, 560–572 (2010)
Danzer, L., Grünbaum, B., Klee, V.: Helly’s theorem and its relatives. In: Proc. Symposia in Pure Math. vol. VII (Convexity), pp. 101–180 (1963)
Erdős, P.: Graph theory and probability. Can. J. Math. 11, 34–38 (1959)
Erdős, P., Hajnal, A.: On chromatic number of graphs and set systems. Acta Math. Acad. Sei. Hungar. 17, 61–69 (1966)
Godsil, C., Royle, G.: Algebraic graph theory. In: Graduate Texts in Mathematics, vol. 207. Springer, Berlin (2001)
Gyárfás, A.: Problems from the world surrounding perfect graphs. Zastosow. Mat. 19, 413–431 (1987)
Hadwiger, H., Debrunner, H.: Kombinatorische Geometrie in der Ebene. In: Monographies de l’Enseignement Mathematique, No. 2, Geneva (1960)
Kierstead, H., Penrice, S.: Radius two trees specify v-bounded classes. J. Graph Theory 18, 119–129 (1994)
Larsen, M., Propp, J., Ullman, D.H.: The fractional chromatic number of Mycielski graphs. J. Graph Theory 19, 411–416 (1995)
Lovász, L.: On chromatic number of finite set-systems. Acta Math. Acad. Sci. Hungar. 19, 59–67 (1968)
Mycielski, J.: Sur le coloriage des graphes. Colloq. Math. 3, 161–162 (1955)
Nešetřil, J., Rödl, V.: A short proof of the existence of highly chromatic hypergraphs without short cycles. J. Combin. Theory Ser. B 27, 225–227 (1979)
Randerath, B., Schiermeyer, I.: Vertex Colouring and Forbidden Subgraphs: A Survey. Graphs Combin. 20, 1–40 (2004)
Scheinerman, E.R., Ullman, D.H.: Fractional Graph Theory. Wiley, New York (2008)
Acknowledgments
The authors would like to thank The Center of Innovation in Mathematics CINNMA for its support and to the anonymous referees for its helpful comments and suggestions to improve this paper.
Author information
Authors and Affiliations
Corresponding author
Additional information
J. Luviano was supported by CONACYT 5737. A. Montejano was supported by DGAPA. L. Montejano was supported by CONACYT 5737. D. Oliveros was supported by PAPIIT-México under Project104609-3.
Rights and permissions
About this article
Cite this article
Luviano, J., Montejano, A., Montejano, L. et al. Mycielski type constructions for hypergraphs associated with fractional colorings. Bol. Soc. Mat. Mex. 20, 1–16 (2014). https://doi.org/10.1007/s40590-013-0001-7
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s40590-013-0001-7