اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدImproved bound for Hadwigers conjecture
132
0
0.0
(
0
)
تأليف
Yan Wang
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Hadwiger conjectured in 1943 that for every integer $t ge 1$, every graph with no $K_t$ minor is $(t-1)$-colorable. Kostochka, and independently Thomason, proved every graph with no $K_t$ minor is $O(t(log t)^{1/2})$-colorable. Recently, Postle improved it to $O(t (log log t)^6)$-colorable. In this paper, we show that every graph with no $K_t$ minor is $O(t (log log t)^{5})$-colorable.
قيم البحث
اقرأ أيضاً
We prove that for any $varepsilon>0$, for any large enough $t$, there is a graph $G$ that admits no $K_t$-minor but admits a $(frac32-varepsilon)t$-colouring that is frozen with respect to Kempe changes, i.e. any two colour classes induce a connected
component. This disproves three conjectures of Las Vergnas and Meyniel from 1981.
Hadwigers conjecture is one of the most important and long-standing conjectures in graph theory. Reed and Seymour showed in 2004 that Hadwigers conjecture is true for line graphs. We investigate this conjecture on the closely related class of total g
raphs. The total graph of $G$, denoted by $T(G)$, is defined on the vertex set $V(G)sqcup E(G)$ with $c_1,c_2in V(G)sqcup E(G)$ adjacent whenever $c_1$ and $c_2$ are adjacent to or incident on each other in $G$. We first show that there exists a constant $C$ such that, if the connectivity of $G$ is at least $C$, then Hadwigers conjecture is true for $T(G)$. The total chromatic number $chi(G)$ of a graph $G$ is defined to be equal to the chromatic number of its total graph. That is, $chi(G)=chi(T(G))$. Another well-known conjecture in graph theory, the total coloring conjecture or TCC, states that for every graph $G$, $chi(G)leqDelta(G)+2$, where $Delta(G)$ is the maximum degree of $G$. We show that if a weaker version of the total coloring conjecture (weak TCC) namely, $chi(G)leqDelta(G)+3$, is true for a class of graphs $mathcal{F}$ that is closed under the operation of taking subgraphs, then Hadwigers conjecture is true for the class of total graphs of graphs in $mathcal{F}$. This motivated us to look for classes of graphs that satisfy weak TCC. It may be noted that a complete proof of TCC for even 4-colorable graphs (in fact even for planar graphs) has remained elusive even after decades of effort; but weak TCC can be proved easily for 4-colorable graphs. We noticed that in spite of the interest in studying $chi(G)$ in terms of $chi(G)$ right from the initial days, weak TCC is not proven to be true for $k$-colorable graphs even for $k=5$. In the second half of the paper, we make a contribution to the literature on total coloring by proving that $chi(G)leqDelta(G)+3$ for every 5-colorable graph $G$.
In 1967, Grunbaum conjectured that any $d$-dimensional polytope with $d+sleq 2d$ vertices has at least [phi_k(d+s,d) = {d+1 choose k+1 }+{d choose k+1 }-{d+1-s choose k+1 } ] $k$-faces. We prove this conjecture and also characterize the cases in which equality holds.
A central problem in discrete geometry, known as Hadwigers covering problem, asks what the smallest natural number $Nleft(nright)$ is such that every convex body in ${mathbb R}^{n}$ can be covered by a union of the interiors of at most $Nleft(nright)
$ of its translates. Despite continuous efforts, the best general upper bound known for this number remains as it was more than sixty years ago, of the order of ${2n choose n}nln n$. In this note, we improve this bound by a sub-exponential factor. That is, we prove a bound of the order of ${2n choose n}e^{-csqrt{n}}$ for some universal constant $c>0$. Our approach combines ideas from previous work by Artstein-Avidan and the second named author with tools from Asymptotic Geometric Analysis. One of the key steps is proving a new lower bound for the maximum volume of the intersection of a convex body $K$ with a translate of $-K$; in fact, we get the same lower bound for the volume of the intersection of $K$ and $-K$ when they both have barycenter at the origin. To do so, we make use of measure concentration, and in particular of thin-shell estimates for isotropic log-concave measures. Using the same ideas, we establish an exponentially better bound for $Nleft(nright)$ when restricting our attention to convex bodies that are $psi_{2}$. By a slightly different approach, an exponential improvement is established also for classes of convex bodies with positive modulus of convexity.
We consider the problem of characterising the generic rigidity of bar-joint frameworks in $mathbb{R}^d$ in which each vertex is constrained to lie in a given affine subspace. The special case when $d=2$ was previously solved by I. Streinu and L. Ther
an in 2010 and the case when each vertex is constrained to lie in an affine subspace of dimension $t$, and $dgeq t(t-1)$ was solved by Cruickshank, Guler and the first two authors in 2019. We extend the latter result by showing that the given characterisation holds whenever $dgeq 2t$.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
