اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMaximizing the number of q-colorings
107
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Let P_G(q) denote the number of proper q-colorings of a graph G. This function, called the chromatic polynomial of G, was introduced by Birkhoff in 1912, who sought to attack the famous four-color problem by minimizing P_G(4) over all planar graphs G. Since then, motivated by a variety of applications, much research was done on minimizing or maximizing P_G(q) over various families of graphs. In this paper, we study an old problem of Linial and Wilf, to find the graphs with n vertices and m edges which maximize the number of q-colorings. We provide the first approach which enables one to solve this problem for many nontrivial ranges of parameters. Using our machinery, we show that for each q >= 4 and sufficiently large m < kappa_q n^2 where kappa_q is approximately 1/(q log q), the extremal graphs are complete bipartite graphs minus the edges of a star, plus isolated vertices. Moreover, for q = 3, we establish the structure of optimal graphs for all large m <= n^2/4, confirming (in a stronger form) a conjecture of Lazebnik from 1989.
قيم البحث
اقرأ أيضاً
An emph{interval $t$-coloring} of a multigraph $G$ is a proper edge coloring with colors $1,dots,t$ such that the colors on the edges incident to every vertex of $G$ are colored by consecutive colors. A emph{cyclic interval $t$-coloring} of a multigr
aph $G$ is a proper edge coloring with colors $1,dots,t$ such that the colors on the edges incident to every vertex of $G$ are colored by consecutive colors, under the condition that color $1$ is considered as consecutive to color $t$. Denote by $w(G)$ ($w_{c}(G)$) and $W(G)$ ($W_{c}(G)$) the minimum and maximum number of colors in a (cyclic) interval coloring of a multigraph $G$, respectively. We present some new sharp bounds on $w(G)$ and $W(G)$ for multigraphs $G$ satisfying various conditions. In particular, we show that if $G$ is a $2$-connected multigraph with an interval coloring, then $W(G)leq 1+leftlfloor frac{|V(G)|}{2}rightrfloor(Delta(G)-1)$. We also give several results towards the general conjecture that $W_{c}(G)leq |V(G)|$ for any triangle-free graph $G$ with a cyclic interval coloring; we establish that approximat
Let $q_{min}(G)$ stand for the smallest eigenvalue of the signless Laplacian of a graph $G$ of order $n.$ This paper gives some results on the following extremal problem: How large can $q_minleft( Gright) $ be if $G$ is a graph of order $n,$ with n
o complete subgraph of order $r+1?$ It is shown that this problem is related to the well-known topic of making graphs bipartite. Using known classical results, several bounds on $q_{min}$ are obtained, thus extending previous work of Brandt for regular graphs. In addition, using graph blowups, a general asymptotic result about the maximum $q_{min}$ is established. As a supporting tool, the spectra of the Laplacian and the signless Laplacian of blowups of graphs are calculated.
We give two proofs of the $q,t$-symmetry of the generalized $q,t$-Catalan number $C_{vec{k}}(q,t)$ for $vec{k}=(k_1,k_2,k_3)$. One is by MacMahons partition analysis as we proposed; the other is by a direct bijection.
Colored triangulations offer a generalization of combinatorial maps to higher dimensions. Just like maps are gluings of polygons, colored triangulations are built as gluings of special, higher-dimensional building blocks, such as octahedra, which we
call colored building blocks and known in the dual as bubbles. A colored building block is determined by its boundary triangulation, which in the case of polygons is simply characterized by its length. In three dimensions, colored building blocks are labeled by some 2D triangulations and those homeomorphic to the 3-ball are labeled by the subset of planar ones. Similarly to Eulers formula in 2D which provides an upper bound to the number of vertices at fixed number of polygons with given lengths, we look in three dimensions for an upper bound on the number of edges at fixed number of given colored building blocks. In this article we solve this problem when all colored building blocks, except possibly one, are homeomorphic to the 3-ball. To do this, we find a characterization of the way a colored building block homeomorphic to the ball has to be glued to other blocks of arbitrary topology in a colored triangulation which maximizes the number of edges. This local characterization can be extended to the whole triangulation as long as there is at most one colored building block which is not a 3-ball. The triangulations obtained this way are in bijection with trees. The number of edges is given as an independent sum over the building blocks of such a triangulation. In the case of all colored building blocks being homeomorphic to the 3-ball, we show that these triangulations are homeomorphic to the 3-sphere. Those results were only known for the octahedron and for melonic building blocks before. This article is self-contained and can be used as an introduction to colored triangulations and their bubbles from a purely combinatorial point of view.
In this paper, we study the achromatic and the pseudoachromatic numbers of planar and outerplanar graphs as well as planar graphs of girth 4 and graphs embedded on a surface. We give asymptotically tight results and lower bounds for maximal embedded graphs.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
