AbstractWe give a short proof for Chenʼs Alternative Kneser Coloring Lemma. This leads to a short proof for the Johnson–Holroyd–Stahl conjecture that Kneser graphs have their circular chromatic numbers equal to their chromatic numbers
AbstractBy Lovász' proof of the Kneser conjecture, the chromatic number of a graph G is bounded from...
We prove that propositional translations of the Kneser–Lovász theorem have polynomial size extended ...
We prove that propositional translations of the Kneser–Lovász theorem have polynomial size extended ...
AbstractWe give a short proof for Chenʼs Alternative Kneser Coloring Lemma. This leads to a short pr...
AbstractIn 1997, Johnson, Holroyd and Stahl conjectured that the circular chromatic number of the Kn...
AbstractThis paper proves that for any positive integer n, if m is large enough, then the reduced Kn...
AbstractWe investigate some coloring properties of Kneser graphs. A semi-matching coloring is a prop...
AbstractIn this paper, we apply some new algebraic no-homomorphism theorems in conjunction with some...
For integers $0 < i < k < n$, the general Kneser graph $K(n; k; i)$, is a graphwhose vertic...
AbstractCombining Ky Fan’s theorem with ideas of Greene and Matoušek we prove a generalization of Do...
A k-coloring of a graph G is a mapping f from the vertex set V (G) of G to the set Z k such that f(x...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
AbstractIn this paper, we investigate the circular chromatic number of the iterated Mycielskian of g...
Combining Ky Fan’s theorem with ideas of Greene and Matoušek we prove a generalization of Dol’nikov...
Let n and k be positive integers with n≥2k. Consider a circle C with n points 1,…,n in clockwise ord...
AbstractBy Lovász' proof of the Kneser conjecture, the chromatic number of a graph G is bounded from...
We prove that propositional translations of the Kneser–Lovász theorem have polynomial size extended ...
We prove that propositional translations of the Kneser–Lovász theorem have polynomial size extended ...
AbstractWe give a short proof for Chenʼs Alternative Kneser Coloring Lemma. This leads to a short pr...
AbstractIn 1997, Johnson, Holroyd and Stahl conjectured that the circular chromatic number of the Kn...
AbstractThis paper proves that for any positive integer n, if m is large enough, then the reduced Kn...
AbstractWe investigate some coloring properties of Kneser graphs. A semi-matching coloring is a prop...
AbstractIn this paper, we apply some new algebraic no-homomorphism theorems in conjunction with some...
For integers $0 < i < k < n$, the general Kneser graph $K(n; k; i)$, is a graphwhose vertic...
AbstractCombining Ky Fan’s theorem with ideas of Greene and Matoušek we prove a generalization of Do...
A k-coloring of a graph G is a mapping f from the vertex set V (G) of G to the set Z k such that f(x...
[[sponsorship]]數學研究所[[note]]已出版;具代表性[[note]]http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVe...
AbstractIn this paper, we investigate the circular chromatic number of the iterated Mycielskian of g...
Combining Ky Fan’s theorem with ideas of Greene and Matoušek we prove a generalization of Dol’nikov...
Let n and k be positive integers with n≥2k. Consider a circle C with n points 1,…,n in clockwise ord...
AbstractBy Lovász' proof of the Kneser conjecture, the chromatic number of a graph G is bounded from...
We prove that propositional translations of the Kneser–Lovász theorem have polynomial size extended ...
We prove that propositional translations of the Kneser–Lovász theorem have polynomial size extended ...
DOI
Add to ORKG