Leaderbipartite

NameLeaderbipartite
DescriptionLeader-Milicevic-Tan asked how many products of complete bipartite graphs are needed to decompose the edge set of K_3 x K_n. Doing this with 2*(n-1) is trivial, here we use simulated annealing to search for a better construction.
OrganizationUniversity of Illinois Urbana-Champaign
DepartmentMathematics
Sponsor Campus GridOSG Connect
Principal Investigator
Jozsef Balogh
Field Of ScienceMathematical Sciences
DisableFalse