.

0 (hodnocen0 x )

BK

Amsterdam : North-Holland, 1984

483 s.

ISBN 0-444-86893-3

Colloquia mathematica Societatis János Bolyai ; 37

000030684

VOLUME I :   PREFACE // CONTENTS // SCIENTIFIC PROGRAM // LIST OF PARTICIPANTS // D.M. Acketa, On the essential chains and squares // B. Andrasfai, Cellular automata in trees // L.A. Aslanjan — I.A. Akopova, On the distribution of the number of interior points // B. Balcar — J. Dockalkova - P. Simon, Almost disjoint families of countable sets // V. Batagelj, Inductive classes of cubic graphs // J. Beck, An application of Lovasz local lemma: there exist an // infinite 0I-sequence containing no near identical intervals // J. Bosak, Induced subgraphs // W.G. Brown — P. Erdös — M. Simonovits, Inverse extremal digraph problems // G. Burosch — K.D. Drews, On the Sperner-type conditions // F.R.K. Chung — P. Erdös — R.L. Graham, Minimal decomposition of all graphs with equinumerous vertices and edges into mutually isomorphic subgraphs // F.R.K. Chung — R.L. Graham, On irregularities of distribution // R.J. Cook, Some theorems of the Nordhaus—Gaddum class // W. Deuber — H.J. Prómel — B.L. Rothschild — B. Voigt, A restricted version of Hales—Jewett’s theorem // P. Erdös — R. J. Faudree, Size Ramsey numbers involving matchings // P. Erdös — J. Nešetřil — V. Rodl, Selectivity of hypergraphs // A. Frank, Generalized polymatroids // A. Frank — É. Tardos, Matroids from crossing families // P. Frankl — Z. Füredi, Families of finite sets with missing intersections // J. Gerlits — Zs. Nagy, Extending functions from subsets // H.-D.O.F. Gronau, An Erdös—Ko—Rado type theorem // E. Gyori, Strong systems of representatives // K. Gyory, Graphs associated with an integral domain and their applications // A. Hajnal — J. Pach, Monochromatic paths in infinite coloured graphs // H. Harborth, Two-colorings of simple arrangements // A. Ivanyi, On dumpling-eating giants // F. Jaeger, On circular flows in graphs // H.A. Jung, Longest circuits in 3-connected graphs //

VOLUME II :   A.V. Karzanov, A generalized MFMC-property and multicommodity cut problems // A.K. Kelmans, Finding special subdivisions of K4 in a graph // P. Kirschenhofer — H. Prodinger, On the average height of monotonically labelled binary trees // P. Komjath, Dense systems of almost-disjoint sets // A.V. Kostochka, On Hadwiger numbers of a graph and its complement // E. Lamken — B.L. Rothschild, The numbers of odd-cycle-free graphs // M. Las Vergnas, Oriented matroids as signed geometries real in corank // J. Lehel, Multitransversals in -critical hypergraphs // J.Q. Longyear, Nested transversals // D. Marusic, Some problems in vertex symmetric graphs // B. Mohar — T. Pisanski — J. Shawe-Taylor, Edge-coloring of composite regular graphs // V. Neumann-Lara, The generalized dichromatic number of a digraph // S. Poljak — D. Turzik, Amalgamation of matroids along hypergraphs // G. Ravindra, Strongly perfect line graphs and total graphs // A. Recski, Some problems of self-dual matroids // H. Sachs, On spatial representations of finite graphs // M. Saks — V. Sós, On unavoidable subgraphs of tournaments // L. Szamkotowicz, On a classification of graphs with respect to the properties of neighbourhood graphs // L.A. Székely, On two concepts of discrepancy in a class of combinatorial games // V. D. Tonchev, Quasi-residual designs, codes and graphs // D.T. Todorov, Some coverings derived from finite planes // W.T. Trotter Jr. — J.A. Ross, For t > 3, every /-dimensional; partial order can be embedded in a / + 1-irreducible partial order // M. Truszczyński, Some results on uniquely colourable graphs // Zs. Tuza, The method of set-pairs for extremal problems in hypergraphs // A. Varecza, Are m given elements neighbouring? // J. Vinárek, Subdirect irreducibility and dimensions of digraphs //

B. Vizvári, On the connection of the Frobenius problem and the knapsack problem // G. Wegner, Kruskal—Katona’s theorem in generalized complexes // W. Wessel, Criticity with espect to properties and operations in graph theory // K. Yamamoto, On a generalized Williamson equation // T. Zaslavsky, Generalized matchings and generalized Hermite polynomials // S. Znám, On two problems from extremal graph theory // PROBLEMS // SOLUTIONS OF PROBLEMS // E. Boros, On the number of subdivisions of the unit square // M. Szegedy, On the subdivision of the unit square into rectangles with equal area