Solutions to Edmonds' and Katona's problems on families of separating subsets

✍ Scribed by Cai Mao-cheng

• Book ID: 103058356
• Publisher: Elsevier Science
• Year: 1983
• Tongue: English
• Weight: 571 KB
• Volume: 47
• Category: Article
• ISSN: 0012-365X
• DOI: 10.1016/0012-365x(83)90068-7

✦ Synopsis

Let G be a finite loopless graph with vertex-set V(G) and edge-set E(G).

JZdmonds' problem is to determine the smallest integer, denoted by g(G), for which there exists a family A,, . . . , AI(G) of subsets of V(G) such that for any adjacent xi, Xi E V(G) there are disjoint