Abstract
For a graph G, the density of G, denoted D(G), is the maximum ratio of the number of edges to the number of vertices ranging over all subgraphs of G. For a class \(\mathcal {F}\) of graphs, the value \(D(\mathcal {F})\) is the supremum of densities of graphs in \(\mathcal {F}\). A k-edge-colored graph is a finite, simple graph with edges labeled by numbers \(1,\ldots ,k\). A function from the vertex set of one k-edge-colored graph to another is a homomorphism if the endpoints of any edge are mapped to two different vertices connected by an edge of the same color. Given a class \(\mathcal {F}\) of graphs, a k-edge-colored graph \(\mathbb {H}\) (not necessarily with the underlying graph in \(\mathcal {F}\)) is k-universal for \(\mathcal {F}\) when any k-edge-colored graph with the underlying graph in \(\mathcal {F}\) admits a homomorphism to \(\mathbb {H}\). Such graphs are known to exist exactly for classes \(\mathcal {F}\) of graphs with acyclic chromatic number bounded by a constant. The minimum number of vertices in a k-uniform graph for a class \(\mathcal {F}\) is known to be \(\varOmega (k^{D(\mathcal {F})})\) and \(O(k^{{\left\lceil D(\mathcal {F}) \right\rceil }})\). In this paper we close the gap by improving the upper bound to \(O(k^{D(\mathcal {F})})\) for any rational \(D(\mathcal {F})\).
Research was partially supported by MNiSW grant DI2013 000443.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
In literature, universal graphs are also called homomorphism bounds.
References
Albertson, M.O., Chappell, G.G., Kierstead, H.A., Kündgen, A., Ramamurthi, R.: Coloring with no 2-colored P4’s. Electron. J. Comb. 11(1), R26 (2004)
Alon, N., Marshall, T.H.: Homomorphisms of edge-colored graphs and Coxeter groups. J. Algebraic Comb. 8(1), 5–13 (1998)
Borodin, O.V.: On acyclic colorings of planar graphs. Discrete Math. 25(3), 211–236 (1979)
Das, S., Nandi, S., Sen, S.: On chromatic number of colored mixed graphs. In: Gaur, D., Narayanaswamy, N.S. (eds.) CALDAM 2017. LNCS, vol. 10156, pp. 130–140. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-53007-9_12
Guspiel, G., Gutowski, G.: Universal targets for homomorphisms of edge-colored graphs. J. Comb. Theory Ser. B 127, 53–64 (2017). https://doi.org/10.1016/j.jctb.2017.05.009
Hakimi, S.L.: On the degrees of the vertices of a directed graph. J. Franklin Inst. 279(4), 290–308 (1965)
Nešetřil, J., de Mendez, P.O.: Colorings and homomorphisms of minor closed classes. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds.) Discrete and Computational Geometry. AC, vol. 25, pp. 651–664. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-642-55566-4_29
Nešetřil, J., Raspaud, A.: Colored homomorphisms of colored mixed graphs. J. Comb. Theory Ser. B 80(1), 147–155 (2000)
Raspaud, A., Sopena, E.: Good and semi-strong colorings of oriented planar graphs. Inf. Process. Lett. 51(4), 171–174 (1994). https://doi.org/10.1016/0020-0190(94)00088-3
Acknowledgments
I would like to thank Grzegorz Gutowski and Prof. Paweł Idziak for their invaluable help with the preparation of this paper.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Guśpiel, G. (2019). Smaller Universal Targets for Homomorphisms of Edge-Colored Graphs. In: Du, DZ., Duan, Z., Tian, C. (eds) Computing and Combinatorics. COCOON 2019. Lecture Notes in Computer Science(), vol 11653. Springer, Cham. https://doi.org/10.1007/978-3-030-26176-4_19
Download citation
DOI: https://doi.org/10.1007/978-3-030-26176-4_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-26175-7
Online ISBN: 978-3-030-26176-4
eBook Packages: Computer ScienceComputer Science (R0)