Name
Abstract | ||
|---|---|---|
The method used in an article by T. S. Matzkin and E. G. Straus [Canad. J. Math. 17 (1965), 533–540] is generalized by attaching nonnegative weights to t-tuples of vertices in a hypergraph subject to a suitable normalization condition. The edges of the hypergraph are given weights which are functions of the weights of its t-tuples and the graph is given the sum of the weights of its edges. The extremal values and the extremal points of these functions are determined. The results can be applied to various extremal problems on graphs and hypergraphs which are analogous to P. Turán's Theorem [Colloq. Math. 3 (1954), 19–30: (Hungarian) Mat. Fiz. Lapok 48 (1941), 436–452]. |
Year | DOI | Venue |
|---|---|---|
1982 | 10.1016/0095-8956(82)90002-8 | Journal of Combinatorial Theory, Series B |
Field | DocType | Volume |
Discrete mathematics,Graph,Combinatorics,Normalization (statistics),Vertex (geometry),Hypergraph,Constraint graph,Mathematics | Journal | 32 |
Issue | ISSN | Citations |
3 | 0095-8956 | 9 |
PageRank | References | Authors |
2.05 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Vera T. Sós | 1 | 318 | 62.21 |
| E.G Straus | 2 | 39 | 12.60 |