Initiated by a recent question of Erdhos, we give lower bounds on the size of a largest \(k\)-partite subgraph of a graph. Also, the corresponding problem for uniform hypergraphs is considered.
Citation
Thomas Hofmeister, Hanno Lefmann. On \(k\)-Partite Subgraphs[J], Ars Combinatoria, Volume 050. 303-308. .
