## Finite and infinite sets, Issue 37, Part 2 |

### What people are saying - Write a review

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

### Contents

Karzanov A generalized MFMCproperty and multicommodity | 443 |

A K Kelmans Finding special subdivisions of K4 in a graph | 487 |

P Kirschenhofer H Prodinger On the average height | 509 |

Copyright | |

24 other sections not shown

### Other editions - View all

### Common terms and phrases

3-complete 4-blocks almost-disjoint arbitrary assume bipartite graph Cayley graphs chromatic number circuits clique COLLOQUIA MATHEMATICA SOCIETATIS colour classes complete graph conjecture connected consider construction contradiction Corollary defined denote digraph discatenable EGER HUNGARY element embedding ESD matroid Example exists FINITE AND INFINITE Frobenius problem function G contains galactic graph G Graph Theory graphs of order Hadamard matrix hamiltonian Hamiltonian path Hence implies induced subgraph induction inequality INFINITE SETS integer JANOS BOLYAI JANOS BOLYAI 37 l-factorable Lemma Let G linear extension MATHEMATICA SOCIETATIS JANOS matrix non-embeddable obtained oriented matroid partial order partition path Petersen graph planar planar graphs poset Proof Proposition proved r-uniform regular graphs result satisfies SOCIETATIS JANOS BOLYAI spanned subgraph Sperner family strongly perfect subgraph H subposet subsets Suppose symmetric graphs T-critical hypergraphs Theorem tree hypergraph uniquely fc-colourable unit pairs upper bound vector vertex set vertex symmetric graphs