Digraph extremal problems, hypergraph ex
✍
W.G Brown; M Simonovits
📂
Article
📅
1984
🏛
Elsevier Science
🌐
English
⚖ 747 KB
We consider extremal problems 'of Tur~ type' for r-uniform ordered hypergraphs, where multiple oriented edges are permitted up to multiplicity q. With any such '(r, q)-graph' G" we associate an r-linear form whose maximum over the standard (n -1)-simplex in R" is called the (graph-) density g(G ") o