What people are saying - Write a review
We haven't found any reviews in the usual places.
1935b P Hall On representatives of subsets J London Math Soc 10 2630 58
1941 R L Brooks On colouring the nodes of a network Proc Cambridge Phil
1950a R P Dilworth A decomposition theorem for partially ordered sets Ann
10 other sections not shown
Other editions - View all
1-cells algebra apply cardinal chain circuit classes coefficients colour column combinatorial components configuration connected consider contains contradiction Corollary corresponding cubical network defined definition dimers disjoint distributive lattice dual edges of G end-points equal equivalent Euler characteristic exists finite number finite set follows Galois connection given graph G Hence homomorphism hypothesis incidence algebra independent induction infinite integer isomorphic joining least Lemma linear graph locally finite Math matrix matroid maximal flow maximum matching Mobius function nodes non-separable nullity number of edges obtain p-net pairs partially ordered set perfect rectangles permutation planar planar graph points polygon polynomial problem proof of Theorem Proposition prove Ramsey's theorem rank result satisfies sequence squared rectangle subobject subset sum vector Suppose Theorem 31 theory tree unicursal values vertex vertices of G W. T. Tutte wire zero