Related papers: Chromatic Number of Grassmann Graphs and MRD codes

For a graph $G$, we show that if $mad(G)<m$, then $\chi'_\ell(G)\leq \Delta+1$ where $m$ depends upon $\Delta$ and $\chi'_\ell(G)$ is the list-chromatic index of $G$. When $\Delta\leq 20$ the value of $m$ is close to $\frac{1}{2}\Delta$,…

Consider the Grassmann graph of $k$-dimensional subspaces of an $n$-dimensional vector space over the $q$-element field, $1<k<n-1$. Every automorphism of this graph is induced by a semilinear automorphism of the corresponding vector space…

Given independent random points $X_1,...,X_n\in\eR^d$ with common probability distribution $\nu$, and a positive distance $r=r(n)>0$, we construct a random geometric graph $G_n$ with vertex set $\{1,...,n\}$ where distinct $i$ and $j$ are…

We investigate the upper chromatic number of the hypergraph formed by the points and the $k$-dimensional subspaces of $\mathrm{PG}(n,q)$; that is, the most number of colors that can be used to color the points so that every $k$-subspace…

Although the chromatic number of a graph is not known in general, attempts have been made to find good bounds for the number. Here we prove that for a graph G with two forbidden subgraphs and maximum degree less than or equal to 2{\omega} -…

An ordered graph $G$ is a graph whose vertex set is a subset of integers. The edges are interpreted as tuples $(u,v)$ with $u < v$. For a positive integer $s$, a matrix $M \in \mathbb{Z}^{s \times 4}$, and a vector $\mathbf{p} =…

In this paper, we propose a new family of graphs, matrix graphs, whose vertex set $\mathbb{F}^{N\times n}_q$ is the set of all $N\times n$ matrices over a finite field $\mathbb{F}_q$ for any positive integers $N$ and $n$. And any two…

An $n$-subdivision of a graph $G$ is a graph constructed by replacing a path of length $n$ instead of each edge of $G$ and an $m$-power of $G$ is a graph with the same vertices as $G$ and any two vertices of $G$ at distance at most $m$ are…

An extension of the Erd\H{o}s-Renyi random graph model $G_{n,p}$ is the model of perturbed graphs introduced by Bohman, Frieze and Martin (Bohman, Frieze, Martin 2003). This is a special case of the model of randomly augmented graphs…

The Lovasz theta function provides a lower bound for the chromatic number of finite graphs based on the solution of a semidefinite program. In this paper we generalize it so that it gives a lower bound for the measurable chromatic number of…

Let $\mathbb{F}_q$ denote a finite field with $q$ elements. Let $N$ and $D$ denote integers with $N>D \ge 1$. Let $\mathcal{V}$ denote an $N$-dimensional vector space over $\mathbb{F}_q$. The Grassmann graph $J_q(N,D)$ is the graph with…

In this article we consider a problem related to two famous combinatorial topics. One of them concerns the chromatic number of the space. The other deals with graphs having big girth (the length of the shortest cycle) and large chromatic…

The strong chromatic number $\chi_{\text{s}}(G)$ of a graph $G$ on $n$ vertices is the least number $r$ with the following property: after adding $r \lceil n/r \rceil - n$ isolated vertices to $G$ and taking the union with any collection of…

Let $\Gamma_k(V)$ be the Grassmann graph whose vertex set ${\mathcal G}_{k}(V)$ is formed by all $k$-dimensional subspaces of an $n$-dimensional vector space $V$ over the finite field $F_q$ consisting of $q$ elements. We discuss its…

Let $ \Pi_q $ be the projective plane of order $ q $, let $\psi(m):=\psi(L(K_m))$ the pseudoachromatic number of the complete line graph of order $ m $, let $ a\in \{ 3,4,\dots,\tfrac{q}{2}+1 \} $ and $ m_a=(q+1)^2-a $. In this paper, we…

This paper describes an improvement in the upper bound for the magnitude of a coefficient of a term in the chromatic polynomial of a general graph. If $a_r$ is the coefficient of the $q^r$ term in the chromatic polynomial $P(G,q)$, where…

Let $\chi_{\Delta}(\mathbb{R}^{n})$ denote the minimum number of colors needed to color $\mathbb{R}^{n}$ so that there will not be a monochromatic equilateral triangle with side length $1$. Using the slice rank method, we reprove a result…

Let $\mathbb{Z}_{p^s}$ be the residue class ring of integers modulo $p^s$, where $p$ is a prime number and $s$ is a positive integer. Using matrix representation and the inner rank of a matrix, we study the intersection, join, dimension…

The chromatic threshold $\delta_\chi(H)$ of a graph $H$ is the infimum of $d>0$ such that the chromatic number of every $n$-vertex $H$-free graph with minimum degree at least $dn$ is bounded in terms of $H$ and $d$. A breakthrough result of…

The dichromatic number of a graph $G$ is the maximum integer $k$ such that there exists an orientation of the edges of $G$ such that for every partition of the vertices into fewer than $k$ parts, at least one of the parts must contain a…