Abstract
An order is dense if A < B implies A < C < B for some C. The homomorphism order of (nontrivial) graphs is known to be dense. Homomorphisms of trigraphs extend homomorphisms of graphs, and model many partitions of interest in the study of perfect graphs. We address the question of density of the homomorphism order for trigraphs. It turns out that there are gaps in the order, and we exactly characterize where they occur.
Similar content being viewed by others
References
Chvátal, V.: Star-cutsets and perfect graphs. J. Combin. Theorey B 39, 189–199 (1985)
Chudnovsky, M., Cornuéjols, G., Liu, X., Seymour, P., Vušković, K.: Recognizing berge graphs. Combinatorica 25, 143–186 (2005)
Chudnovsky, M., Robertson, N., Seymour, P., Thomas, R.: The strong perfect graph theorem, to appear in Annals of Math
de Figueiredo, C.M.H., Klein, S., Kohayakawa, Y., Reed, B.: Finding skew partitions efficiently. J. Algorithms 37, 505–521 (2000)
Feder, T., Hell, P., Klein, S., Motwani, R.: List partitions. SIAM J. Discrete Math. 16, 449–478 (2003)
Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Academic press, New York (1980)
Hell, P., Nešetřil, J.: Graphs and homomorphisms. Oxford University Press, New York (2004)
Mueller, V., Nešetřil, J., Pelant, J.: Either tournaments or algebras? Discrete Math. 11, 37–66 (1975)
Nešetřil, J., Tardif, C.: Duality theorems for finite structures (characterising gaps and good characterizations). J. Combin. Theory B 80, 80–97 (2000)
Pultr, A., Trnková, V.: Combinatorial, algebraic and topological representations of groups, semigroups and categories. North-Holland, Amsterdam (1980)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hell, P., Nešetřil, J. On the Density of Trigraph Homomorphisms. Graphs and Combinatorics 23 (Suppl 1), 275–281 (2007). https://doi.org/10.1007/s00373-007-0712-5
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s00373-007-0712-5