Abstract
A graph property is any isomorphism closed class of simple graphs. For a simple finite graph H , let → H denote the class of all simple countable graphs that admit homomorphisms to H , such classes of graphs are called hom-properties. Given a graph property P , a graph This research was supported in part by Slovak VEGA grant 2/7141/27. The research of the author was supported in part by VEGA Grant 1/0035/09, Slovak APVV grant 0007-07. 402 P. Mihok, J. Miskuf and G. Semanisin G ∈ P is universal in P if each member of P is isomorphic to an induced subgraph of G. In particular, we consider universal graphs in → H and we give a new proof of the existence of a universal graph in → H , for any finite graph H .
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
