Kierstead, Henry A.; Trotter, William T. jun. An extremal problem in recursive combinatorics. (English) Zbl 0489.05001 Combinatorics, graph theory and computing, Proc. 12th Southeast. Conf., Baton Rouge 1981, Congr. Numerantium 33, 143-153 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 6 ReviewsCited in 42 Documents MSC: 05A05 Permutations, words, matrices 06A06 Partial orders, general 05C15 Coloring of graphs and hypergraphs 05C70 Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) 03D20 Recursive functions and relations, subrecursive hierarchies Keywords:subsets; recursive interval order; recursive interval graph; covered by recursive chains; clique number Citations:Zbl 0483.00001 PDFBibTeX XML