## Finite and infinite sets, Volume 1 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

A Varecza Are m given elements neighbouring? | 9 |

LIST OF PARTICIPANTS | 15 |

B Andrasfai Cellular automata in trees | 35 |

Copyright | |

25 other sections not shown

### Other editions - View all

### Common terms and phrases

Acad arbitrary arcs assume Budapest cardinal chromatic number clopen coloring Combinatorial complete bipartite graph complete graph completely separable conjecture consider contains contradiction countable cubic graphs cycles cyclic cellular automaton defined definition deleting dense matrix density Dept digraph directed graph disjoint family disjoint refinement dumplings EGER EGER HUNGARY elements endpaths Erdos exists fc-graph FINITE AND INFINITE finite set following theorem function graph G Graph Theory Gyory hence holds Hungary hypergraphs implies induced subgraphs induction inequality INFINITE SETS intersection isomorphic JANOS BOLYAI JANOS BOLYAI 37 Lemma Let G MAD family Math MATHEMATICA SOCIETATIS JANOS Mathematics matrix digraphs matroid maximal multigraph number of edges obtain pair partition polyhedron polymatroids positive integer problem proof of Theorem Proposition prove Ramsey number Realtanoda satisfying selector sequence SOCIETATIS JANOS BOLYAI subdigraphs submodular subsets Suppose ultrafilters upper bound vector vertex