ErdsFaberLovsz conjecture

Results: 1



#Item
1Exercise 12: Weed Weak models Task 1: Hyper, hyper! Recall that a hypergraph is a graph where edges may comprise more than 2 nodes. The degree of a hyperedge is the number of nodes in it. Consider a hypergraph of maximum

Exercise 12: Weed Weak models Task 1: Hyper, hyper! Recall that a hypergraph is a graph where edges may comprise more than 2 nodes. The degree of a hyperedge is the number of nodes in it. Consider a hypergraph of maximum

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2015-01-20 10:45:26