TAILIEUCHUNG - Báo cáo toán hoc:" Rainbow matchings in r-partite r-graphs"

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: Rainbow matchings in r-partite r-graphs. | Rainbow matchings in r-partite r-graphs Ron AharonW Department of Mathematics Technion Haifa Israel 32000 ra@ Eli Berger Department of Mathematics Faculty of Science and Science Education Haifa University Haifa Israel berger@ Submitted Feb 24 2009 Accepted Sep 13 2009 Published Sep 25 2009 Mathematics Subject Classification 05D15 Abstract Given a collection of matchings M M1 M2 . Mq repetitions allowed a matching M contained in 0 M is said to be s-rainbow for M if it contains representatives from s matchings Mi where each edge is allowed to represent just one Mi . Formally this means that there is a function ộ M q such that e G Mộ è for all e G M and Im ộ s. Let f r s t be the maximal k for which there exists a set of k matchings of size t in some r-partite hypergraph such that there is no s-rainbow matching of size t. We prove that f r s t 2r-1 s 1 make the conjecture that equality holds for all values of r s and t and prove the conjecture when r 2 or s t 2. In the case r 3 a stronger conjecture is that in a 3-partite 3-graph if all vertex degrees in one side say V1 are strictly larger than all vertex degrees in the other two sides then there exists a matching of V1. This conjecture is at the same time also a strengthening of a famous conjecture described below of Ryser Brualdi and Stein. We prove a weaker version in which the degrees in V1 are at least twice as large as the degrees in the other sides. We also formulate a related conjecture on edge colorings of 3-partite 3-graphs and prove a similarly weakened version. 1 Preliminaries An r-graph namely a hypergraph all of whose edges are of the same size r is said to be r-partite if the vertex set V H of H can be partitioned into sets V1 V2 . Vr in such a way that every edge in H meets each Vi at precisely one vertex. Generally we The research was supported by BSF grant no. 2006099. tThe research of the first author was supported by GIF grant no. 2006311 by the Technion s research

TÀI LIỆU LIÊN QUAN
TỪ KHÓA LIÊN QUAN
Đã 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.