A graph called a crissy-crossy graph
* Its vertex set can partitioned into two disjoint nonempty subsets 1 and 2
* Each vertex 1 adjacent o each vertex 2 ( vice versa)
* o vertex 1 connected o any vertices 1; similarly o vertices 2 are connected o other vertices 2.
W write m, o denote the crissy-crossy graph where the partitions o the vertex set, 1 and 2, satisfy that |1| = m and |2| = . Here example o 2,3 and 4,2.
How many vertices does m, have ( terms o m and )? (o this for all m and , not just for one example.)
