scholarly journals The list chromatic number of graphs with small clique number

2019 ◽  
Vol 134 ◽  
pp. 264-284 ◽  
Author(s):  
Michael Molloy
2006 ◽  
Vol 306 (23) ◽  
pp. 3078-3082 ◽  
Author(s):  
Saieed Akbari ◽  
Hamid-Reza Fanaı¨

2017 ◽  
Vol 60 (2) ◽  
pp. 319-328
Author(s):  
Soheila Khojasteh ◽  
Mohammad Javad Nikmehr

AbstractLet R be a commutative ring with non-zero identity. In this paper, we introduce theweakly nilpotent graph of a commutative ring. The weakly nilpotent graph of R denoted by Γw(R) is a graph with the vertex set R* and two vertices x and y are adjacent if and only if x y ∊ N(R)*, where R* = R \ {0} and N(R)* is the set of all non-zero nilpotent elements of R. In this article, we determine the diameter of weakly nilpotent graph of an Artinian ring. We prove that if Γw(R) is a forest, then Γw(R) is a union of a star and some isolated vertices. We study the clique number, the chromatic number, and the independence number of Γw(R). Among other results, we show that for an Artinian ring R, Γw(R) is not a disjoint union of cycles or a unicyclic graph. For Artinan rings, we determine diam . Finally, we characterize all commutative rings R for which is a cycle, where is the complement of the weakly nilpotent graph of R.


2012 ◽  
Vol 21 (1-2) ◽  
pp. 315-322 ◽  
Author(s):  
DAVID SAXTON ◽  
ANDREW THOMASON

We show that the list chromatic number of a simpled-regularr-uniform hypergraph is at least (1/2rlog(2r2) +o(1)) logdifdis large.


10.37236/632 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Landon Rabern

We prove that if $G$ is the line graph of a multigraph, then the chromatic number $\chi(G)$ of $G$ is at most $\max\left\{\omega(G), \frac{7\Delta(G) + 10}{8}\right\}$ where $\omega(G)$ and $\Delta(G)$ are the clique number and the maximum degree of $G$, respectively. Thus Brooks' Theorem holds for line graphs of multigraphs in much stronger form. Using similar methods we then prove that if $G$ is the line graph of a multigraph with $\chi(G) \geq \Delta(G) \geq 9$, then $G$ contains a clique on $\Delta(G)$ vertices. Thus the Borodin-Kostochka Conjecture holds for line graphs of multigraphs.


10.37236/1805 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Seog-Jin Kim ◽  
Alexandr Kostochka ◽  
Kittikorn Nakprasit

Let $G$ be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number $k$ is $(3k-3)$-degenerate. This bound is sharp. As a consequence, we derive that $G$ is $(3k-2)$-colorable. We show also that the chromatic number of every intersection graph $H$ of a family of homothetic copies of a fixed convex set in the plane with clique number $k$ is at most $6k-6$.


10.37236/2125 ◽  
2012 ◽  
Vol 19 (1) ◽  
Author(s):  
Gaku Liu

Let $Q(n,c)$ denote the minimum clique number over graphs with $n$ vertices and chromatic number $c$. We investigate the asymptotics of $Q(n,c)$ when $n/c$ is held constant. We show that when $n/c$ is an integer $\alpha$, $Q(n,c)$ has the same growth order as the inverse function of the Ramsey number $R(\alpha+1,t)$ (as a function of $t$). Furthermore, we show that if certain asymptotic properties of the Ramsey numbers hold, then $Q(n,c)$ is in fact asymptotically equivalent to the aforementioned inverse function. We use this fact to deduce that $Q(n,\lceil n/3 \rceil)$ is asymptotically equivalent to the inverse function of $R(4,t)$.


2014 ◽  
Vol 21 (02) ◽  
pp. 249-256 ◽  
Author(s):  
G. Aalipour ◽  
S. Akbari ◽  
M. Behboodi ◽  
R. Nikandish ◽  
M. J. Nikmehr ◽  
...  

Let R be a commutative ring and 𝔸(R) be the set of ideals with non-zero annihilators. The annihilating-ideal graph of R is defined as the graph 𝔸𝔾(R) with the vertex set 𝔸(R)* = 𝔸(R)\{(0)} and two distinct vertices I and J are adjacent if and only if IJ = (0). Here, we present some results on the clique number and the chromatic number of the annihilating-ideal graph of a commutative ring. It is shown that if R is an Artinian ring and ω (𝔸𝔾(R)) = 2, then R is Gorenstein. Also, we investigate commutative rings whose annihilating-ideal graphs are complete or bipartite.


2015 ◽  
Vol 14 (06) ◽  
pp. 1550079 ◽  
Author(s):  
M. J. Nikmehr ◽  
S. Khojasteh

Let R be a commutative ring with identity, I its proper ideal and M be a unitary R-module. In this paper, we introduce and study a kind of graph structure of an R-module M with respect to proper ideal I, denoted by ΓI(RM) or simply ΓI(M). It is the (undirected) graph with the vertex set M\{0} and two distinct vertices x and y are adjacent if and only if [x : M][y : M] ⊆ I. Clearly, the zero-divisor graph of R is a subgraph of Γ0(R); this is an important result on the definition. We prove that if ann R(M) ⊆ I and H is the subgraph of ΓI(M) induced by the set of all non-isolated vertices, then diam (H) ≤ 3 and gr (ΓI(M)) ∈ {3, 4, ∞}. Also, we prove that if Spec (R) and ω(Γ Nil (R)(M)) are finite, then χ(Γ Nil (R)(M)) ≤ ∣ Spec (R)∣ + ω(Γ Nil (R)(M)). Moreover, for a secondary R-module M and prime ideal P, we determine the chromatic number and the clique number of ΓP(M), where ann R(M) ⊆ P. Among other results, it is proved that for a semisimple R-module M with ann R(M) ⊆ I, ΓI(M) is a forest if and only if ΓI(M) is a union of isolated vertices or a star.


2012 ◽  
Vol 12 (02) ◽  
pp. 1250151 ◽  
Author(s):  
M. BAZIAR ◽  
E. MOMTAHAN ◽  
S. SAFAEEYAN

Let M be an R-module. We associate an undirected graph Γ(M) to M in which nonzero elements x and y of M are adjacent provided that xf(y) = 0 or yg(x) = 0 for some nonzero R-homomorphisms f, g ∈ Hom (M, R). We observe that over a commutative ring R, Γ(M) is connected and diam (Γ(M)) ≤ 3. Moreover, if Γ(M) contains a cycle, then gr (Γ(M)) ≤ 4. Furthermore if ∣Γ(M)∣ ≥ 1, then Γ(M) is finite if and only if M is finite. Also if Γ(M) = ∅, then any nonzero f ∈ Hom (M, R) is monic (the converse is true if R is a domain). For a nonfinitely generated projective module P we observe that Γ(P) is a complete graph. We prove that for a domain R the chromatic number and the clique number of Γ(M) are equal. When R is self-injective, we will also observe that the above adjacency defines a covariant functor between a subcategory of R-MOD and the Category of graphs.


Sign in / Sign up

Export Citation Format

Share Document