کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4656763 | 1632982 | 2015 | 16 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Tree-width and planar minors
ترجمه فارسی عنوان
آپارتمان درختی و عرضی
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
درخت عرض، جوانان گراف
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
چکیده انگلیسی
Robertson and the second author [7] proved in 1986 that for all h there exists f(h)f(h) such that for every h-vertex simple planar graph H, every graph with no H -minor has tree-width at most f(h)f(h); but how small can we make f(h)f(h)? The original bound was an iterated exponential tower, but in 1994 with Thomas [9] it was improved to 2O(h5)2O(h5); and in 1999 Diestel, Gorbunov, Jensen, and Thomassen [3] proved a similar bound, with a much simpler proof. Here we show that f(h)=2O(hlog(h))f(h)=2O(hlog(h)) works. Since this paper was submitted for publication, Chekuri and Chuzhoy [2] have announced a proof that in fact f(h)f(h) can be taken to be O(h100)O(h100).
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Combinatorial Theory, Series B - Volume 111, March 2015, Pages 38–53
Journal: Journal of Combinatorial Theory, Series B - Volume 111, March 2015, Pages 38–53
نویسندگان
Alexander Leaf, Paul Seymour,