User talk:Japow

Hi,

For those interested, this is Japow on my mathematical thoughts concerning the possible NP Hard problem in graph theory, "Turan's Brick Factory Problem". Enjoy.

(Japow (talk) 04:06, 29 May 2011 (UTC))

Turan's Brick Factory Problem
Turan's Brick Factory Problem is best understood by me graphically. (PAUSE) Here is my Conjecture for the P equation for finding the minimum number of crossings, notated, "cr(G)" of complete bipartide graph G. Using the notation that cru(G) is the maximum crossing number of a complete bipartide graph G. I define the Maximum crossing number as the number of crossings that is required to make a bipartide graph map to a complete bipartide graph where set n verticies is drawn as if on a line parallel to verticies m on a similar parallel direction above it, see diagram 1. example of notation: cru(K3,3) = 9

diagram 1

(Japow (talk) 03:33, 29 May 2011 (UTC))