TAILIEUCHUNG - Báo cáo toán học: "On the crossing number of Km,n"

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: On the crossing number of Km,n | On the crossing number of Km n Nagi H. Nahas nnahas@ Submitted Mar 15 2001 Accepted Aug 10 2003 Published Aug 21 2003 MR Subject Classifications 05C10 05C35 Abstract The best lower bound known on the crossing number of the complete bipartite graph is cr Km n 1 5 m m - 1 _n 2JL n - 1 2_ In this paper we prove that cr Km n 1 5 m m 1 _n 2_ _ n 1 2_ X 10-6m2n2 for sufficiently large m and n. 1 Introduction Determining the crossing number of the complete bipartite graph is one of the oldest crossing number open problems. It was first posed by Turan and known as Turan s brick factory problem. In 1954 Zarankiewicz conjectured that it is equal to Z m n _n 2_ _ n 1 2_ _m 2JL m 1 2_ He even gave a proof and a drawing that matches the lower bound but the proof was shown to be flawed by Richard Guy 1 . Then in 1970 Kleitman proved that Zarankiewicz conjecture holds for Min m n 6 2 . In 1993 Woodall proved it for m 8 n 10 3 . Previously the best known lower bound in the general case was the one proved by Kleitman 2 cr Km n 1 5 m m 1 _n 2_ _ n 1 2j. Richter and Thomassen discussed the relation between the crossing numbers of the complete and the complete bipartite graphs 4 . THE ELECTRONIC JOURNAL OF COMBINATORICS 10 2003 N8 1 2 A new bound We will start by giving definitions that will be used throughout the paper. They are taken from Woodall 3 and Kleitman 2 . Definition 1 Two edges e1 and e2 are said to have a crossing in a drawing D of Km n if e1 can be closed by a curve disjoint from e2 connecting the two endpoints of e1 and such that there are points of e2 both inside and outside the closed curve. Definition 2 The crossing number era of a graph G is the smallest crossing number of any drawing of G in the plane where the crossing number erD of a drawing D is the number of non-adjacent edges that have a crossing in the drawing. Definition 3 A good drawling a graph G is a drawing where the edges are non-selfintersecting where each two edges have at most one point in

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.