37 pages matching COLLOQUIA MATHEMATICA SOCIETATIS in this book
Results 1-3 of 37
What people are saying - Write a review
We haven't found any reviews in the usual places.
Berge On the good colorings of a hypergraph 159
A Brace D E Daykin A finite set covering theorem IV 199
21 other sections not shown
a-crit adjacent assume cardinality Clearly COLLOQUIA MATHEMATICA SOCIETATIS command graph complete graph containing a spanning contradiction defined definition denote disjoint edges of G elements epimorphism exists FINITE SETS four-colour problem function girth g graph G graph of degree Graphen Hajnal Hamiltonian cycles Hence holds hypergraph hypothesis implies independent induction INFINITE AND FINITE inside quadrilateral integers JANOS BOLYAI joined Kempe chains KESZTHELY HUNGARY least Lemma Let G Math MATHEMATICA SOCIETATIS JANOS maximal congruences minimal number of edges number of vertices obtained p-coloring pair pairwise partially ordered partially ordered set partitional matroids path of length planar graph proof of Theorem Proposition prove regular graph resp result satisfying set of vertices spanning RHk-subgraph stable sets subdirect product subdirectly irreducible subgraph subset Suppose theory tion transversal triangle valency vertex vertices of G X-covering