𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On a Problem of Cameron’s on Inexhaustible Graphs

✍ Scribed by Anthony Bonato; Dejan Delić


Publisher
Springer-Verlag
Year
2004
Tongue
English
Weight
247 KB
Volume
24
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


On a problem raised by P.J. Cameron
✍ Richard P. Lewis; Simon P. Norton 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 139 KB

At the problem session of the 14th British Combinatorial Conference, Cameron asked for a bijection between the set of permutations of { 1,2 ..... nl. with all cycles of even length and the set of permutations of { 1, 2 ..... n} with all cycles odd (where n is even). Here we give bijections between m

On a graph colouring problem
✍ Maurice Cochand; Gyula Károlyi 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 196 KB