tailieunhanh - Báo cáo toán học: "The Directed Anti-Oberwolfach Solution: Pancyclic 2-factorizations of complete directed graphs of odd order"

Tuyển tập các báo cáo nghiên cứu khoa học ngành toán học tạp chí toán học quốc tế đề tài: The Directed Anti-Oberwolfach Solution: Pancyclic 2-factorizations of complete directed graphs of odd order. | The Directed Anti-Oberwolfach Solution Pancyclic 2-factorizations of complete directed graphs of odd order Brett Stevens Department of Mathematics and Statistics Simon Fraser University Burnaby BC V5A 1S6 Canada brett@ Submitted September 28 2000 Accepted March 26 2002. MR Subject Classifications 05B30 05C70 Abstract The directed anti-Oberwolfach problem asks for a 2-factorization each factor has in-degree 1 and out-degree 1 for a total degree of two of K2n 1 not with consistent cycle components in each 2-factor like the Oberwolfach problem but such that every admissible cycle size appears at least once in some 2-factor. The solution takes advantage of both Piotrowski s decomposition techniques used to solve Oberwolfach problems and the techniques used by the author to solve the undirected anti-Oberwolfach problem. 1 Introduction Suppose that there is a combinatorics conference with 2n 1 people attending and it is to be held over 2n days. Each evening there is a dinner which everyone attends. To accommodate the many different sizes of meetings the conference center has many different sizes of tables. In fact they have every table size from small two person tables to large round tables seating 2n 1 people. When this was noticed the organizers having solved the pancyclic seating arrangement the year before 7 asked themselves a harder question can a seating arrangement could be made for each evening such that every person sits next to every other person exactly once on each side left and right over the course of the conference and each size table is used at least once. Such a schedule really a decomposition of the complete directed graph K2n 1 into spanning graphs all with in-degree and out-degree both equal one collections of cycles The author s current address is School of Mathematics and Statistics Carleton University 1125 Colonel By Dr. Ottawa K1S 5B6 Canada THE ELECTRONIC JOURNAL OF COMBINATORICS 9 2002 R16 1 would be an example of a .

TÀI LIỆU LIÊN QUAN
TỪ KHÓA LIÊN QUAN
crossorigin="anonymous">
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.