scholarly journals On some topological and combinatorial lower bounds on the chromatic number of Kneser type hypergraphs

2021 ◽  
Vol 146 ◽  
pp. 372-381
Author(s):  
Soheil Azarpendar ◽  
Amir Jafari
Keyword(s):  
Chromatic Number ◽  
Lower Bounds

2-Distance chromatic number of some graph products

2020 ◽  
Vol 12 (02) ◽  
pp. 2050021
Author(s):  
Ghazale Ghazi ◽  
Freydoon Rahbarnia ◽  
Mostafa Tavakoli
Keyword(s):  
Chromatic Number ◽  
Lower Bounds ◽  
Upper And Lower Bounds ◽  
Graph Products ◽  
Lexicographic Product ◽  
Graph Product ◽  
Minimum Number

This paper studies the 2-distance chromatic number of some graph product. A coloring of [Formula: see text] is 2-distance if any two vertices at distance at most two from each other get different colors. The minimum number of colors in the 2-distance coloring of [Formula: see text] is the 2-distance chromatic number and denoted by [Formula: see text]. In this paper, we obtain some upper and lower bounds for the 2-distance chromatic number of the rooted product, generalized rooted product, hierarchical product and we determine exact value for the 2-distance chromatic number of the lexicographic product.

scholarly journals A Note on the Warmth of Random Graphs with Given Expected Degrees

2014 ◽  
Vol 2014 ◽  
pp. 1-4 ◽  
Author(s):  
Yilun Shang
Keyword(s):  
Statistical Mechanics ◽  
Chromatic Number ◽  
Random Graph ◽  
Lower Bounds ◽  
Random Graphs ◽  
Upper Bound ◽  
Degree Sequence ◽  
Graph Model ◽  
Upper And Lower Bounds ◽  
Random Graph Model

We consider the random graph modelG(w)for a given expected degree sequencew=(w1,w2,…,wn). Warmth, introduced by Brightwell and Winkler in the context of combinatorial statistical mechanics, is a graph parameter related to lower bounds of chromatic number. We present new upper and lower bounds on warmth ofG(w). In particular, the minimum expected degree turns out to be an upper bound of warmth when it tends to infinity and the maximum expected degreem=O(nα)with0<α<1/2.

scholarly journals Spectral Lower Bounds for the Quantum Chromatic Number of a Graph – Part II

10.37236/9295 ◽  
2020 ◽  
Vol 27 (4) ◽  
Author(s):  
Pawel Wocjan ◽  
Clive Elphick ◽  
Parisa Darbari
Keyword(s):  
Chromatic Number ◽  
Lower Bounds ◽  
Kneser Graph

Hoffman proved that a graph $G$ with eigenvalues $\mu_1 \geqslant \cdots \geqslant \mu_n$ and chromatic number $\chi(G)$ satisfies: \[\chi \geqslant 1 + \kappa\] where $\kappa$ is the smallest integer such that \[\mu_1 + \sum_{i=1}^{\kappa} \mu_{n+1-i} \leqslant 0.\] We strengthen this well known result by proving that $\chi(G)$ can be replaced by the quantum chromatic number, $\chi_q(G)$, where for all graphs $\chi_q(G) \leqslant \chi(G)$ and for some graphs $\chi_q(G)$ is significantly smaller than $\chi(G)$. We also prove a similar result, and investigate implications of these inequalities for the quantum chromatic number of various classes of graphs, which improves many known results. For example, we demonstrate that the Kneser graph $KG_{p,2}$ has $\chi_q = \chi = p - 2$.

New lower bounds on the weighted chromatic number of a graph

2004 ◽  
Vol 24 (2) ◽  
pp. 183
Author(s):  
Massimiliano Caramia ◽  
Jirí Fiala
Keyword(s):  
Chromatic Number ◽  
Lower Bounds

scholarly journals Locating Chromatic Number of Powers of Paths and Cycles

Symmetry ◽  
2019 ◽  
Vol 11 (3) ◽  
pp. 389
Author(s):  
Manal Ghanem ◽  
Hasan Al-Ezeh ◽  
Ala’a Dabbour
Keyword(s):  
Chromatic Number ◽  
Lower Bounds ◽  
Minimum Distance ◽  
Upper And Lower Bounds ◽  
Color Code ◽  
Partition Class ◽  
Distinct Color

Let c be a proper k-coloring of a graph G. Let π = { R 1 , R 2 , … , R k } be the partition of V ( G ) induced by c, where R i is the partition class receiving color i. The color code c π ( v ) of a vertex v of G is the ordered k-tuple ( d ( v , R 1 ) , d ( v , R 2 ) , … , d ( v , R k ) ) , where d ( v , R i ) is the minimum distance from v to each other vertex u ∈ R i for 1 ≤ i ≤ k . If all vertices of G have distinct color codes, then c is called a locating k-coloring of G. The locating-chromatic number of G, denoted by χ L ( G ) , is the smallest k such that G admits a locating coloring with k colors. In this paper, we give a characterization of the locating chromatic number of powers of paths. In addition, we find sharp upper and lower bounds for the locating chromatic number of powers of cycles.

scholarly journals Spectral Lower Bounds for the Orthogonal and Projective Ranks of a Graph

10.37236/8183 ◽  
2019 ◽  
Vol 26 (3) ◽  
Author(s):  
Pawel Wocjan ◽  
Clive Elphick
Keyword(s):  
Lower Bound ◽  
Chromatic Number ◽  
Lower Bounds ◽  
Orthogonality Condition ◽  
Zero Column

The orthogonal rank of a graph $G=(V,E)$ is the smallest dimension $\xi$ such that there exist non-zero column vectors $x_v\in\mathbb{C}^\xi$ for $v\in V$ satisfying the orthogonality condition $x_v^\dagger x_w=0$ for all $vw\in E$.   We prove that many spectral lower bounds for the chromatic number, $\chi$, are also lower bounds for $\xi$. This result complements a previous result by the authors, in which they showed that spectral lower bounds for $\chi$ are also lower bounds for the quantum chromatic number $\chi_q$.  It is known that the quantum chromatic number and the orthogonal rank are incomparable.   We conclude by proving an inertial  lower bound for the projective rank $\xi_f$, and conjecture that a stronger inertial lower bound for $\xi$ is also a lower bound for $\xi_f$.

scholarly journals Coloring Chains for Compression with Uncertain Priors

10.37236/6468 ◽  
2018 ◽  
Vol 25 (4) ◽  
Author(s):  
Noah Golowich
Keyword(s):  
Chromatic Number ◽  
Lower Bounds ◽  
Graph Coloring ◽  
Upper And Lower Bounds ◽  
Nice Property ◽  
Chromatic Numbers ◽  
Compression Scheme ◽  
Graph Coloring Problem ◽  
Close Relationship ◽  
Local Graph

Haramaty and Sudan considered the problem of transmitting a message between two people, Alice and Bob, when Alice's and Bob's priors on the message are allowed to differ by at most a given factor. To find a deterministic compression scheme for this problem, they showed that it is sufficient to obtain an upper bound on the chromatic number of a graph, denoted $U(N,s,k)$ for parameters $N,s,k$, whose vertices are nested sequences of subsets and whose edges are between vertices that have similar sequences of sets. In turn, there is a close relationship between the problem of determining the chromatic number of $U(N,s,k)$ and a local graph coloring problem considered by Erdős et al. We generalize the results of Erdős et al. by finding bounds on the chromatic numbers of graphs $H$ and $G$ when there is a homomorphism $\phi :H\rightarrow G$ that satisfies a nice property. We then use these results to improve upper and lower bounds on $\chi(U(N,s,k))$. 

Sign in / Sign up

Export Citation Format

Share Document