✦ LIBER ✦

Complete subgraphs of infinite multipartite graphs and antichains in partially ordered sets

✍ Scribed by A. Hajnal; N. Sauer

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 393 KB
Volume: 59
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(86)90069-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cut-sets in infinite graphs and partial

Cut-sets in infinite graphs and partial orders

✍ A. Hajnal; N. Sauer 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 859 KB

Hajnal, A. and N. Sauer, Cut-sets in infinite graphs and partial orders. Discrete Mathematics 117 (1993) 113-125. The set S c V(U) is a cut-set of the vertex v of a graph 9 if v is not adjacent to any vertex in S and, for every maximal clique C of Q, ({v} u S) n C # 0. S is a cut-set of the element

Maximal sets of hamilton cycles in compl

Maximal sets of hamilton cycles in complete multipartite graphs

✍ Mike Daven; J. A. MacDougall; C. A. Rodger 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 2 views

## Abstract A set __S__ of edge‐disjoint hamilton cycles in a graph __G__ is said to be __maximal__ if the edges in the hamilton cycles in __S__ induce a subgraph __H__ of __G__ such that __G__ − __E__(__H__) contains no hamilton cycles. In this context, the spectrum __S__(__G__) of a graph __G__ i