What people are saying - Write a review
We haven't found any reviews in the usual places.
Basic Concepts of Linear Order
IN LEX ORDER
17 other sections not shown
Other editions - View all
algebra associated backedges basic bicomponent biconnected graph bijection binary bipartite graph blocks bridge Burnside's lemma called Chapter CNL(M Coden colex order column combinatorial components compute connected Consider construct COROLLARY corresponding CYCLE(e data structures def,ne defined DEFINITION diagram discussion disjoint elements embedding entries equivalence relation example EXERCISE f,nite given graph G graph theory idea identity incidence algebra independent sets induced matroid injective integers inverse labeled LEMMA Let G lex order lexicographic lineal spanning tree linear order linearly ordered set Math Mobius Mobius function notation obtained orbit order isomorphism ordered partition orderly algorithm path PATH(e PATR(G,T permutations planar polynomial poset preorder problem procedure proof rank reader recursion representable matroid representatives RG functions row canonical form SEGLST(e segment separation pair shown in FIGURE sorting sorting network spanning tree subgraph subset subtree symbols TAIL(F THEOREM unit row canonical vector vertex vertices wreath product zero