|
|
|
|
LEADER |
00000cam a2200000Ii 4500 |
001 |
SCIDIR_ocn898771822 |
003 |
OCoLC |
005 |
20231117044506.0 |
006 |
m o d |
007 |
cr cnu---unuuu |
008 |
141227s1984 ne ob 000 0 eng d |
040 |
|
|
|a EBLCP
|b eng
|e pn
|c EBLCP
|d N$T
|d OCLCQ
|d N$T
|d OCLCE
|d OCLCF
|d OPELS
|d DEBSZ
|d YDXCP
|d OCLCQ
|d MERUC
|d OCLCQ
|d UKAHL
|d OCLCQ
|d LUN
|d OCLCQ
|d OCLCO
|d OCL
|d OCLCQ
|d OCLCO
|
019 |
|
|
|a 680418668
|a 922519157
|a 1083343337
|
020 |
|
|
|a 9781483161228
|q (electronic bk.)
|
020 |
|
|
|a 1483161226
|q (electronic bk.)
|
020 |
|
|
|a 9780444868930
|
020 |
|
|
|a 0444868933
|
020 |
|
|
|z 0444867635
|
020 |
|
|
|z 9780444867636
|
020 |
|
|
|z 0444868941
|q (v. 2)
|
020 |
|
|
|z 9780444868947
|q (v. 2)
|
020 |
|
|
|z 9638021659
|q (Hungary)
|
020 |
|
|
|z 9789638021656
|q (Hungary)
|
035 |
|
|
|a (OCoLC)898771822
|z (OCoLC)680418668
|z (OCoLC)922519157
|z (OCoLC)1083343337
|
042 |
|
|
|a dlr
|
050 |
|
4 |
|a QA164
|
072 |
|
7 |
|a MAT
|x 000000
|2 bisacsh
|
082 |
0 |
4 |
|a 511.3/2
|2 23
|
084 |
|
|
|a 05-06
|2 msc
|
245 |
0 |
0 |
|a Finite and infinite sets /
|c edited by A. Hajnal, L. Lov�asz and V.T. S�os.
|
260 |
|
|
|a Amsterdam ;
|a Oxford ;
|a New York :
|b North-Holland,
|c 1984.
|
300 |
|
|
|a 1 online resource
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
490 |
1 |
|
|a Colloquia mathematica Societatis J�anos Bolyai ;
|v 37
|
588 |
0 |
|
|a Print version record.
|
504 |
|
|
|a Includes bibliographical references.
|
505 |
0 |
0 |
|t On the essential chains and squares /
|r D.M. Acketa --
|t Cellular automata in trees /
|r B. Andr�asfai --
|t On the distribution of the number of interior points /
|r L.A. Aslanjan, I.A. Akopova --
|t Almost disjoint families of countable sets /
|r B. Balcar, J. Do�ck�alkov�a, P. Simon --
|t Inductive classes of cubic graphs /
|r V. Batagelj --
|t An application of Lov�asz local lemma: there exist an infinite 01-sequence containing no near identical intervals --
|t Induced subgraphs /
|r J. Bos�ak --
|t Inverse extremal digraph problems /
|r W.G. Brown, P. Erd�os, M. Simonovits --
|t On the Sperner-type conditions /
|r G. Burosch, K.D. Drews --
|t Minimal decomposition of all graphs with equinumerous vertices and edges into mutually isomorphic subgraphs /
|r F.R.K. Chung, P. Erd�os, R.L. Graham --
|t On irregularities of distribution /
|r F.R.K. Chung, R.L. Graham --
|t Gaddum class /
|r R.J. Cook --
|t A restricted version of Hales-Jewett's theorem /
|r W. Deuber, H.J. Pr�omel, B.L. Rothschild, B. Voigt --
|t Size Ramsey numbers involving matchings /
|r P. Erd�os, R.J. Faudree --
|t Selectivity of hypergraphs /
|r P. Erd�os, J. Ne�set�ril, V. R�odl --
|t Generalized polymatroids /
|r A. Frank --
|t Matroids from crossing families /
|r A. Frank, E. Tardos --
|t Families of finite sets with missing intersections /
|r P. Frankl, Z. F�uredi --
|t Extending functions from subsets /
|r J. Gerlits, Zs. Nagy --
|t An Erd�os-Ko-Rado type theorem /
|r H.-D.O.F. Fronau --
|t Strong systems of representatives /
|r E. Gy�ori --
|t Graphs associated with an integral domain and their applications /
|r K. Gy�ory --
|t Monochromatic paths in infinite coloured graphs /
|r A. Hajnal, J. Pach --
|t Two-colorings of simple arrangements /
|r H. Harborth --
|t On dumpling-eating giants /
|r A. Iv�anyi --
|t On circular flows in graphs /
|r F. Jaeger --
|t Longest circuits in 3-connected graphs /
|r H.A. Jung.
|
505 |
0 |
0 |
|t A generalized MFMC-property and multicommodity cut problems /
|r A.V. Karzanov --
|t Finding special subdivisions of K₄ in a graph /
|r A.K. Kelmans --
|t On the average height of monotonically labelled binary trees /
|r P. Kirschenhofer, H. Prodinger --
|t Dense systems of almost-disjoint sets /
|r P. Komj�ath --
|t On Hadwiger numbers of a graph and its complement /
|r A.V. Kostochka --
|t The numbers of odd-cycle-free graphs /
|r E. Lamken, B.L. Rothschild --
|t Oriented matroids as signed geometries real in corank 2 /
|r M. Las Vergnas --
|t Multitransversals in [tau]-critical hypergraphs /
|r J. Lehel --
|t Nested transversals /
|r J.Q. Longyear --
|t Some problems in vertex symmetric graphs /
|r D. Maru�si�c --
|t Edge-coloring of composite regular graphs /
|r B. Mohar, T. Pisanski, J. Shawe-Taylor --
|t The generalized dichromatic number of a digraph /
|r V. Neumann-Lara --
|t Amalgamation of matroids along hypergraphs /
|r S. Poljak, D. Turzik --
|t Strongly perfect line graphs and total graphs /
|r G. Ravindra --
|t Some problems of self-dual matroids /
|r A. Recski --
|t On spatial representations of finite graphs /
|r H. Sachs --
|t On unavoidable subgraphs of tournaments /
|r M. Saks, V. S�os --
|t On a classification of graphs with respect to the properties of neighbourhood graphs /
|r L. Szamko�owicz --
|t On two concepts of discrepancy in a class of combinatorial games /
|r L.A. Sz�ekely --
|t Quasi-residual designs, codes and graphs /
|r V.D. Tonchev --
|t Some coverings derived from finite planes /
|r D.T. Todorov --
|t For t [greater than or equal to] 3, every t-dimensional; partial order can be embedded in a t+1-irreducible partial order /
|r W.T. Trotter Jr., J.A. Ross --
|t Some results on uniquely colourable graphs /
|r M. Truszczy�nski --
|t The method of set-pairs for extremal problems in hypergraphs /
|r Zs. Tuza --
|t Are m given elements neighbouring? /
|r �A. Varecza --
|t Subdirect irreducibility and dimensions of digraphs /
|r J. Vin�arek --
|t On the connection of the Fronbenius problem and the knapsack problem /
|r B. Vizv�ari --
|t Kruskal-Katona's theorem in generalized complexes /
|r G. Wegner --
|t Criticity with respect to properties and operations in graph theory /
|r W. Wessel --
|t On a generalized Williamson equation /
|r K. Yamamoto --
|t Generalized matchings and generalized Hermite polynomials /
|r T. Zaslavsky --
|t On two problems from extremal graph theory /
|r �S. Zn�am --
|t On the number of subdivisions of the unit square /
|r E. Boros --
|t On the subdivision of the unit square into rectangles with equal area /
|r M. Szegedy.
|
520 |
|
|
|a Colloquia Mathematica Societatis J�anos Bolyai, 37: Finite and Infinite Sets, Vol. I focuses on the principles, operations, and approaches involved in finite and infinite sets. The selection first elaborates on essential chains and squares, cellular automata in trees, almost disjoint families of countable sets, and application of Lovasz local lemma. Discussions focus on deleting operations, number of all and self-dual E-chains, transversality of E-chains and E-squares, and binary E-chains and E-squares. The text then elaborates on induced subgraphs, inverse extremal digraph problems, two Sperne.
|
506 |
|
|
|3 Use copy
|f Restrictions unspecified
|2 star
|5 MiAaHDL
|
533 |
|
|
|a Electronic reproduction.
|b [Place of publication not identified] :
|c HathiTrust Digital Library,
|d 2010.
|5 MiAaHDL
|
538 |
|
|
|a Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
|u http://purl.oclc.org/DLF/benchrepro0212
|5 MiAaHDL
|
583 |
1 |
|
|a digitized
|c 2010
|h HathiTrust Digital Library
|l committed to preserve
|2 pda
|5 MiAaHDL
|
650 |
|
0 |
|a Set theory.
|
650 |
|
0 |
|a Set theory
|x Congresses.
|
650 |
|
6 |
|a Th�eorie des ensembles
|0 (CaQQLa)201-0001167
|x Congr�es.
|0 (CaQQLa)201-0378208
|
650 |
|
6 |
|a Th�eorie des ensembles.
|0 (CaQQLa)201-0001167
|
650 |
|
7 |
|a MATHEMATICS
|x General.
|2 bisacsh
|
650 |
|
7 |
|a Set theory
|2 fast
|0 (OCoLC)fst01113587
|
650 |
|
7 |
|a Analise Combinatoria.
|2 larpcal
|
653 |
|
|
|a Mathematics
|a Sets
|
655 |
|
7 |
|a Conference papers and proceedings
|2 fast
|0 (OCoLC)fst01423772
|
700 |
1 |
|
|a Hajnal, A.
|
700 |
1 |
|
|a Lov�asz, L�aszl�o,
|d 1948-
|
700 |
1 |
|
|a S�os, Vera T.
|
776 |
0 |
8 |
|i Print version:
|a Hajnal, A.
|t Finite and Infinite Sets : Colloquia Mathematica Societatis J�anos Bolyai, 37.
|d Burlington : Elsevier Science, �2014
|z 9780444868930
|
830 |
|
0 |
|a Colloquia mathematica Societatis J�anos Bolyai ;
|v 37.
|
856 |
4 |
0 |
|u https://sciencedirect.uam.elogim.com/science/book/9780444868930
|z Texto completo
|