# Discrete math :)

#### anon100

##### New member
[h=1]For which positive integers k can a simple graph G = (V, E) be constructed such that: G has k vertexes, that is, |V| = k, G is bipartite, and its complement G is bipartite?[/h]
[FONT=&quot]Basically, which positive integers of k vertices can make the simple graph: bipartite AND its complement is bipartite[/FONT]
[FONT=&quot]
[/FONT]

[FONT=&quot]Please prove your answer is correct and list the positive k integers which this is valid [/FONT]

#### Jomo

##### Elite Member
For which positive integers k can a simple graph G = (V, E) be constructed such that: G has k vertexes, that is, |V| = k, G is bipartite, and its complement G is bipartite?

Basically, which positive integers of k vertices can make the simple graph: bipartite AND its complement is bipartite

Please prove your answer is correct and list the positive k integers which this is valid
Hi, out of curiosity what exactly are you expecting from this forum regarding your post?