Abstract
A method is presented for determining lower bounds for the AB percolation critical probability of bipartite graphs. For some graphs, the method shows that AB percolation is impossible in an interval containing p=1/2. The results improve those of Appel and Wierman (1987) by removing symmetry and periodicity restrictions, and lend support to a conjecture of Halley (1983).
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.
