Finite planar emulators for K_{4,5} - 4K_2 and K_{1,2,2,2} and Fellows' Conjecture

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Final version. To appear in European Journal of Combinatorics

Scientific paper

10.1016/j.ejc.2009.06.003

In 1988 Fellows conjectured that if a finite, connected graph admits a finite planar emulator, then it admits a finite planar cover. We construct a finite planar emulator for K_{4,5} - 4K_2. Archdeacon showed that K_{4,5} - 4K_2 does not admit a finite planar cover; thus K_{4,5} - 4K_2 provides a counterexample to Fellows' Conjecture. It is known that Negami's Planar Cover Conjecture is true if and only if K_{1,2,2,2} admits no finite planar cover. We construct a finite planar emulator for K_{1,2,2,2}. The existence of a finite planar cover for K_{1,2,2,2} is still open.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Finite planar emulators for K_{4,5} - 4K_2 and K_{1,2,2,2} and Fellows' Conjecture does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finite planar emulators for K_{4,5} - 4K_2 and K_{1,2,2,2} and Fellows' Conjecture, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite planar emulators for K_{4,5} - 4K_2 and K_{1,2,2,2} and Fellows' Conjecture will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-726720

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.