Date: 2013-05-11 13:53:39Graph theory Mathematics Graph coloring Combinatorial optimization Matching NP-complete problems Bipartite graph Union-closed sets conjecture Maximal independent set Triangle-free graph | | The union-closed sets conjecture almost holds for almost all random bipartite graphs Henning Bruhn and Oliver Schaudt Abstract Frankl’s union-closed sets conjecture states that in every finite unionclosed family of setAdd to Reading ListSource URL: www.zaik.uni-koeln.deDownload Document from Source Website File Size: 409,21 KBShare Document on Facebook
|