3 problems
Matching
Let satisfy and . If , then with probability tending to as , the edge set can be partitioned into exactly…
Let be trees such that has vertices for every with , and let be the complete graph on vertices. Gyárfás's tree-packing conje…
Let be a finite simple graph. A Berge graph is a graph containing neither an odd hole nor the complement of an odd hole. A graph is basic if it belongs to one of the four class…