Add to ORKGIn this short note, we show that for any $\epsilon >0$ and $k<n^{0.5-\epsilon}$ the choice number of the Kneser graph $KG_{n,k}$ is $\Theta (n\log n)$
AbstractIn 1997, Johnson, Holroyd and Stahl conjectured that the circular chromatic number of the Kn...
AbstractOne of the authors has conjectured that every graph G with 2χ(G)+1 or fewer vertices is χ(G)...
For integers k > 1 and n > 2k+1, the Kneser graph K(n,k) is the graph whose vertices are the k-eleme...
summary:The domination number and the domatic number of a certain special type of Kneser graphs are ...
The determining number of a graph $G = (V,E)$ is the minimum cardinality of aset $S\subseteq V$ such...
The Wiener number of a graph G is defined as 1/2∑d(u,v), where u,v ∈ V(G), and d is the distance fun...
A set of vertices S is a determining set of a graph G if every automorphism of G is uniquely determi...
Abstract. Let ch(G) denote the choice number of a graph G, and let Ks∗k be the complete k-partite gr...
Let ch(G) denote the choice number of a graph G (also called “list chromatic num-ber ” or “choosabil...
AbstractThis paper proves that for any positive integer n, if m is large enough, then the reduced Kn...
For integers $0 < i < k < n$, the general Kneser graph $K(n; k; i)$, is a graphwhose vertic...
AbstractIn this note, by proving some combinatorial identities, we obtain a simple form for the eige...
The choice number is a graph parameter that generalizes the chromatic number. In this concept vertic...
Let f be a function assigning list sizes to the vertices of a graph G. The sum choice number of G is...
A graph G is said to be k-distinguishable if every vertex of the graph can be colored from a set of ...
AbstractIn 1997, Johnson, Holroyd and Stahl conjectured that the circular chromatic number of the Kn...
AbstractOne of the authors has conjectured that every graph G with 2χ(G)+1 or fewer vertices is χ(G)...
For integers k > 1 and n > 2k+1, the Kneser graph K(n,k) is the graph whose vertices are the k-eleme...
summary:The domination number and the domatic number of a certain special type of Kneser graphs are ...
The determining number of a graph $G = (V,E)$ is the minimum cardinality of aset $S\subseteq V$ such...
The Wiener number of a graph G is defined as 1/2∑d(u,v), where u,v ∈ V(G), and d is the distance fun...
A set of vertices S is a determining set of a graph G if every automorphism of G is uniquely determi...
Abstract. Let ch(G) denote the choice number of a graph G, and let Ks∗k be the complete k-partite gr...
Let ch(G) denote the choice number of a graph G (also called “list chromatic num-ber ” or “choosabil...
AbstractThis paper proves that for any positive integer n, if m is large enough, then the reduced Kn...
For integers $0 < i < k < n$, the general Kneser graph $K(n; k; i)$, is a graphwhose vertic...
AbstractIn this note, by proving some combinatorial identities, we obtain a simple form for the eige...
The choice number is a graph parameter that generalizes the chromatic number. In this concept vertic...
Let f be a function assigning list sizes to the vertices of a graph G. The sum choice number of G is...
A graph G is said to be k-distinguishable if every vertex of the graph can be colored from a set of ...
AbstractIn 1997, Johnson, Holroyd and Stahl conjectured that the circular chromatic number of the Kn...
AbstractOne of the authors has conjectured that every graph G with 2χ(G)+1 or fewer vertices is χ(G)...
For integers k > 1 and n > 2k+1, the Kneser graph K(n,k) is the graph whose vertices are the k-eleme...