1 paper
Lajos Győrffy, András London, Gábor V. Nagy +1
We study the problem of partitioning the edge set of the complete graph into bipartite subgraphs under certain constraints defined by forbidden subgraphs. These constraints lead to…