Abstract
We investigate set-homogeneity (a weakening of Fraissé’s notion of homogeneity), give an example of a set-homogeneous graph which is not homogeneous, and characterize it by its symmetry properties. A variant of Fraissé’s amalgamation theorem is also given. © 1994 by Academic Press, Inc.
Cite
CITATION STYLE
APA
Droste, M., Giraudet, M., Macpherson, D., & Sauer, N. (1994). Set-homogeneous graphs. Journal of Combinatorial Theory, Series B, 62(1), 63–95. https://doi.org/10.1006/jctb.1994.1055
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free