Kneser graphsJohnson graphsDistance graphsExistence of designsLet G(n,r,s) be a graph whose vertices are all r-element subsets of an n-element set, in which two vertices are adjacent if they intersect in exactly s elements. In this paper we study chromatic numbers of G(n,r,s) with r...
Given integers k, n, 2 n0(k) the chromatic number of this graph is (k - 1)() + rs, where n = (k - 1)s + r, 0 ≤ r < k - 1.P. FranklCNRS 15 Quai A. France ParisJournal of Graph TheoryPeter Frankl. On the chromatic number of the general Kneser-graph. Journal of ...
The interlacing graph $ext{IG}_{n,k}$ is the graph with vertices corresponding to $k$-subsets of $[n]$ that do not contain two adjacent points on $C$, and edges between $k$-subsets $P$ and $Q$ if they interlace: after removing the points in $P$ from $C$, the points in $Q...
Maximal cocliques and the chromatic number of the Kneser graph on chambers of PG(3,q) (3,q) Let Gamma be the graph whose vertices are the chambers of the finite projective 3-space PG(3,q), with two vertices being adjacent if and only if the corres... P Heering,K Metsch - 《...
Summary: In an on-line coloring, the vertices of a graph are revealed one by one. An algorithm assigns a color to each vertex after it is revealed. When a ... C Kudahl - Springer International Publishing 被引量: 9发表: 2015年 On the chromatic number of almost s-stable Kneser graphs...
- International Press of Boston 被引量: 0发表: 2017年 A combinatorial proof for the circular chromatic number of Kneser graphs Let χ_c(H) denote the circular chromatic number of a graph H. For graphs F and G, the circular chromatic Ramsey number R_(χc) (F,G) is the infimum of ...
The total dominator chromatic number χtd(G) of G is the minimum number of color classes in a TDC of G . In this paper among some other results and by using the existence of Steiner triple systems, we determine the total dominator chromatic number of the Kneser graph KG(n,2) for each...
The total dominator chromatic number chi(td)(G) of G is the minimum number of color classes in a TDC of G. In this paper among some other results and by using the existence of Steiner triple systems, we determine the total dominator chromatic number of the Kneser graph KG(n,2) for ...
In 1955 the number theorist Martin Kneser posed a seemingly innocuous problem that became one of the great challenges in graph theory until a brilliant and totally unexpected solution, using the "Borsuk–Ulam theorem" from topology, was found by László Lovász twenty-three years later....
On Chromatic Number of Kneser Hyper- graphs. ArXiv e-prints, February 2013. 1, 7, 8, 9, 10N. Alon, P. Frankl, L. Lovasz, The chromatic number of Kneser hypergraphs, Trans. Amer. Math. Soc., 298, 359370 (1986).Alishahi, M., Hajiabolhassan, H., 2015. On the chromatic number...