Monthly Research Problems, 1969-75 (Q4099543)

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 3521879
Language Label Description Also known as
default for all languages
No label defined
    English
    Monthly Research Problems, 1969-75
    scientific article; zbMATH DE number 3521879

      Statements

      Monthly Research Problems, 1969-75 (English)
      0 references
      0 references
      1975
      0 references
      How does one review a review? The article updates information concerning research problems which have appeared in the Am. Math. Mon. since the inception of the section under V. L. Klee in 1969. The new results reported include those -- of \textit{C. Thomassen} [Discrete Math. 9, 91--96 (1974; Zbl 0272.05114)] that there are hypotraceable graphs on \(\nu\) vertices for \(\nu =34, 37, 39, 40\) and \(\nu \ge 42\); -- of \textit{F. P. Preparata} and \textit{J. Nievergelt} [IEEE Trans. Inf. Theory 20, 643--649 (1974; Zbl 0298.94018)] on snake-in-the-box codes; -- of \textit{P. McMullen} [Mathematika 21, 26--31 (1974; Zbl 0288.52004)] and \textit{K. B. Reid} [J. Lond. Math. Soc., II. Ser. 8, 94--98 (1974; Zbl 0291.05105)] that the number of graphs on \(n\) vertices with \(3\) cliques is \[ \lfloor (n + 3)(6n^4 - 18n^3 + 34n^2 - 42n+ 105+ 45(-1)^n)/1440\rfloor; \] -- of \textit{H. L. Abbott}, \textit{P. Erdős}, and \textit{D. Hanson} [Am. Math. Mon. 81, 256--261 (1974; Zbl 0276.05005)] on the number of times an integer occurs as a binomial coefficient; -- of \textit{R. C. Entringer}, \textit{D. E. Jackson}, and \textit{J. A. Schatz} [J. Comb. Theory, Ser. A 16, 159--164 (1974; Zbl 0279.05001)] that there is an infinite binary sequence with no identical adjacent blocks of length 3 or greater and that every binary sequence of length greater than 18 has identical adjacent blocks of length 2 or greater and that every infinite binary sequence has arbitrarily long adjacent blocks which are permutations of each other; -- of various people on the conjecture of \textit{H. Herda} [Am. Math. Mon. 81, 146--149 (1974; Zbl 0279.50007)] concerning characterization of circles; -- of \textit{S. E. Payne} [Discrete Math. 10, 145--148 (1974; Zbl 0289.05018)] on Hadamard's maximum determinant problem; -- of \textit{G. H. J. Meredith} and \textit{E. K. Lloyd} [J. Comb. Theory, Ser. B 15, 161--166 (1973; Zbl 0248.05129)] on the partition of \(O_k\) into \(\lfloor k/2\rfloor\) Hamilton circuits; -- of \textit{P. Erdős} and \textit{M. Simonovits} [Am. Math. Mon. 83, 23--26 (1976; Zbl 0329.10005)] and others on Hirschhorn's ``problime'' number theorem; -- of Eggleton that a tree with \(n\) vertices and maximum valence \(v\) has an equitable coloring in \(r\) colors if \(\lceil \nu/2\rceil +1 \le r \le n\); -- of several who solved the matrix problem of \textit{E. A. Molnar} [Am. Math. Mon. 81, 383--384 (1974; Zbl 0297.55006)]; -- of the anticipation by \textit{J. Leech} [J. Lond. Math. Soc. 31, 160--169 (1956; Zbl 0072.03401)], \textit{B. Wichmann} [ibid. 38, 465--466 (1962; Zbl 0123.04302)], \textit{M. J. E. Golay} [J. Lond. Math. Soc., II. Ser. 4, 729--734 (1972; Zbl 0244.10050)] and \textit{J. C. P. Miller} [Computers in Number Theory, Proc. Atlas Sympos. No. 2, Oxford 1969, 299--322 (1971; Zbl 0217.32802)] of results on the greatest graceful subgraph of the complete graph; -- of \textit{P. R. Scott}'s verification [Math. Mag. 47, 218--221 (1974; Zbl 0295.52005)] of his own conjecture; and of the discovery by Pomerance and Eggleton of where all the triangles go. There are over a hundred references. As an earnest of the future it will be pointed out in Am. Math. Mon. 84 that \textit{R. G. Stanton} and \textit{C. R. Zarnke} [Proc. 4th Southeast. Conf. Comb., Graph Theor., Comput., Boca Raton 1973, 479--495 (1973; Zbl 0316.05103)] anticipated the affirmative answer to the question whether all complete binary trees are graceful. The author and the reviewer welcome correspondence.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references