No label defined (Q4056041)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3470458
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3470458

      Statements

      1974
      0 references
      0 references
      [For the entire collection see Zbl 0282.00007.] This survey paper continues the line of questioning of the author's earlier papers, for example in Theory Graphs Appl., Proc. Sympos. Smolenice 1963, 29-36 (1964; Zbl 0161.20501), and, in Chapter II, generalizes some of the questions from graphs to hypergraphs. If \(\underline{G}\) is a finite family of \(r\)-graphs (i.e. \(r\)-uniform hypergraphs), then \(f(n;\underline{G})\) is defined to be the smallest integer \(m\) such that every \(r\)-graph with \(n\) vertices and at least \(m\) \(r\)-edges contains a sub-\(r\)-graph isomorphic to a member of \(\underline{G}\). When \(\underline{G}\) is a family of ordinary graphs, it is known from the theorems of \textit{P. Erdős} and \textit{A. H. Stone} [Bull. Amer. math. Soc. 52, 1087-1091 (1946; Zbl 0063.01277)] und \textit{P. Erdős} and \textit{M. Simonovits} [Stud. Sci. Math. Hung. 1, 51-57 (1966; Zbl 0178.27301)] that \[ f(n;\underline{G}) = \left(1-{1 \over k-1} \right) {n^2 \over 2}+0(n^2) \text{ as } n \to \infty \] where \(k\) is the minimum of the chromatic numbers of the members of \(\underline{G}\). Thus the case when \(\underline{G}\) consists solely of bipartite graphs is of particular interest, and Chapter I is devoted to a discussion of some results in this direction. Chapter II is devoted to analogous problems for hypergraphs, in particular, for sets \(\underline{G}\) consisting of (for fixed integers \(s\) and \(t\)) \(r\)-graphs having exactly \(s\) vertices and exactly \(t\) \(r\)-edges. Several problems which arise in the author's recent papers with \textit{V. T. Sós} and the reviewer [\textit{W. G. Brown, P. Erdős}, and \textit{V. T. Sós}, New Direct. Theory Graphs, Proc. third Ann. Arbor Conf., Univ. Michigan 1971, 53-63 (1973; Zbl 0258.05132); \textit{V. T. Sós, P. Erdős}, and \textit{W. G. Brown}, Periodica Math. Hungar. 3, 221-228 (1973; Zbl 0269.05111)] are discussed. Caveat lector! A number of the formulas contain typographical errors.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references