Infinite and Finite Sets: To Paul Erdös on His 60th Birthday, Volume 3A. Hajnal, Richard Rado, Vera T. Sós |
From inside the book
56 pages matching COLLOQUIA MATHEMATICA SOCIETATIS in this book
Page 1526
Where's the rest of this book?
Results 1-3 of 56
Contents
E Etourneau Existence and connectivity of planar graphs | 1087 |
CONTENTS | 1089 |
A R D Mathias A remark on rare filters | 1095 |
Copyright | |
22 other sections not shown
Other editions - View all
Common terms and phrases
A₁ adjacent assume C₁ C₂ cardinality Clearly COLLOQUIA MATHEMATICA SOCIETATIS command graph complete graph Conjecture connected components contradiction cycle defined denote disjoint E₁ edge of H epimorphism Erdős exists FINITE SETS four-colour four-colour problem G₁ G₂ graph G Graphen H₁ H₂ Hajnal Hence hypergraph i₁ implies induced induced subgraph INFINITE AND FINITE integer JÁNOS BOLYAI joined k-critical K₁ K₂ KESZTHELY KESZTHELY HUNGARY least Lemma Let G Let H m-colorable m₁ m₂ Math MATHEMATICA SOCIETATIS JÁNOS matroid maximal sum-free sets n-degenerate n₁ n₂ number of edges number of vertices obtained P₁ P₂ pairwise planar graph problem Proposition prove regular graph resp result S₁ S₂ set of vertices SOCIETATIS JÁNOS BOLYAI ẞ-graphs stable sets strongly coloured subdirectly irreducible subgraph subset Suppose transversal V₁ valence vertex vertices of G W.T. Tutte w₁ X₁ X₂ Y₁ α α α