- 438 pages
- English
- PDF
- Available on iOS & Android
About This Book
Colloquia Mathematica Societatis Jânos 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 Sperner-type conditions, and minimal decomposition of all graphs with equinumerous vertices and edges into mutually isomorphic subgraphs. Topics include general digraph extremal problem, matrix graphs and quadratic forms, augmentation of matrices, set of attained densities, proof of the continuity theorem, and inverse extremal multigraph problems. The text examines circular flows in graphs, two-colorings of simple arrangements, monochromatic paths in infinite colored graphs, and graphs associated with an integral domain and their applications. The selection is a dependable reference for researchers interested in finite and infinite sets.
Frequently asked questions
Information
Table of contents
- Front Cover
- Finite and Infinite Sets
- Copyright Page
- Table of Contents
- PREFACE
- SCIENTIFIC PROGRAM
- LIST OF PARTICIPANTS
- CHAPTER 1. ON THE ESSENTIAL CHAINS AND SQUARES
- CHAPTER 2. CELLULAR AUTOMATA IN TREES
- CHAPTER 3. ON THE DISTRIBUTION OF THE NUMBER OF INTERIOR POINTS IN SUBSETS OF THE n-DIMENSIONAL UNIT CUBE
- CHAPTER 4. ALMOST DISJOINT FAMILIES OF COUNTABLE SETS
- CHAPTER 6. AN APPLICATION OF LOVASZ LOCAL LEMMA: THERE EXISTS AN INFINITE 01-SEQUENCE CONTAINING NO NEAR IDENTICAL INTERVALS
- CHAPTER 7. INDUCED SUBGRAPHS
- CHAPTER 8. INVERSE EXTREMAL DIGRAPH PROBLEMS
- CHAPTER 9. ON TWO SPERNER-TYPE CONDITIONS
- CHAPTER 10. MINIMAL DECOMPOSITION OF ALL GRAPHS WITH EQUINUMEROUS VERTICES AND EDGES INTO MUTUALLY ISOMORPHIC SUBGRAPHS
- CHAPTER 11. ON IRREGULARITIES OF DISTRIBUTION
- CHAPTER 12. SOME THEOREMS OF THE NORDHAUS-GADDUM CLASS
- CHAPTER 13. A RESTRICTED VERSION OF HALES-JEWETT'S THEOREM
- CHAPTER 14. SIZE RAMSEY NUMBERS INVOLVING MATCHINGS
- CHAPTER 15. SELECTIVITY OF HYPERGRAPHS
- CHAPTER 16. GENERALIZED POLYMATROIDS
- CHAPTER 17. MATROIDS FROM CROSSING FAMILIES
- CHAPTER 18. FAMILIES OF FINITE SETS WITH MISSING INTERSECTIONS
- CHAPTER 19. EXTENDING FUNCTIONS FROM SUBSETS
- CHAPTER 20. AN ERDÖS-KO-RADO TYPE THEOREM
- CHAPTER 21. STRONG SYSTEMS OF REPRESENTATIVES
- CHAPTER 22. GRAPHS ASSOCIATED WITH AN INTEGRAL DOMAIN AND THEIR APPLICATIONS
- CHAPTER 23. MONOCHROMATIC PATHS IN INFINITE COLOURED GRAPHS
- CHAPTER 24. TWO-COLORINGS OF SIMPLE ARRANGEMENTS
- CHAPTER 25. ON DUMPLING-EATING GIANTS
- CHAPTER 26. ON CIRCULAR FLOWS IN GRAPHS
- CHAPTER 27. LONGEST CIRCUITS IN 3-CONNECTED GRAPHS