✦ LIBER ✦

Embedding edge-colored complete graphs in binary affine spaces

✍ Scribed by Peter J Cameron

Publisher: Elsevier Science
Year: 1976
Tongue: English
Weight: 876 KB
Volume: 21
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(76)90064-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

2-Colored triangles in edge-colored comp

2-Colored triangles in edge-colored complete graphs

✍ D.T Busolini 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 82 KB

Properly colored hamilton cycles in edge

Properly colored hamilton cycles in edge-colored complete graphs

✍ N. Alon; G. Gutin 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 156 KB 👁 3 views

It is shown that, for ⑀ ) 0 and n ) n ⑀ , any complete graph K on n vertices 0 ' Ž . whose edges are colored so that no vertex is incident with more than 1 y 1r 2 y ⑀ n edges of the same color contains a Hamilton cycle in which adjacent edges have distinct colors. Moreover, for every k between 3 and

Dense edge-disjoint embedding of complet

Dense edge-disjoint embedding of complete binary trees in the hypercube

✍ Somasundaram Ravindran; Alan Gibbons 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 407 KB

Ramsey Problems Involving Degrees in Edg

Ramsey Problems Involving Degrees in Edge-colored Complete Graphs of Vertices Belonging to Monochromatic Subgraphs

✍ P. Erdös; G. Chen; C.C. Rousseau; R.H. Schelp 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 249 KB