Abstract
We consider homomorphism properties of a random graph G ( n , p ) , where p is a function of n . A core H is great if for all e ∈ E ( H ) , there is some homomorphism from H − e to H that is not onto. Great cores arise in the study of uniquely H -colourable graphs, where two inequivalent definitions arise for general cores H . For a large range of p , we prove that with probability tending to 1 as n → ∞ , G ∈ G ( n , p ) is a core that is not great. Further, we give a construction of infinitely many non-great cores where the two definitions of uniquely H -colourable coincide.
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.
