A sufficient condition for intrinsic knotting of bipartite graphs

Details A sufficient condition for intrinsic knotting of bipartite graphs A sufficient condition for intrinsic knotting of bipartite graphs

2008-10-31

arxiv.org/abs/0811.0036v1

Mathematics

Geometric Topology

10 pages, 1 figure

Scientific paper

We present evidence in support of a conjecture that a bipartite graph with at least five vertices in each part and |E(G)| \geq 4 |V(G)| - 17 is intrinsically knotted. We prove the conjecture for graphs that have exactly five or exactly six vertices in one part. We also show that there is a constant C_n such that a bipartite graph with exactly n \geq 5 vertices in one part and |E(G)| \geq 4 |V(G)| + C_n is intrinsically knotted. Finally, we classify bipartite graphs with ten or fewer vertices with respect to intrinsic knotting.

Affiliated with

Also associated with

No associations

Rating

A sufficient condition for intrinsic knotting of bipartite graphs 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 A sufficient condition for intrinsic knotting of bipartite graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A sufficient condition for intrinsic knotting of bipartite graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-381667