Related papers: A new lower bound for the chromatic number of gene…
Let $n\ge 1$, $r\ge 2$, and $s\ge 0$ be integers and ${\cal P}=\{P_1,\dots, P_l\}$ be a partition of $[n]=\{1,\dots, n\}$ with $|P_i|\le r$ for $i=1,\dots, l$. Also, let $\cal F$ be a family of non-empty subsets of $[n]$. The $r$-uniform…
There are several topological results ensuring the existence of a large complete bipartite subgraph in any properly colored graph satisfying some special topological regularity conditions. In view of $\mathbb{Z}_p$-Tucker lemma, Alishahi…
In this paper, in view of $Z_p$-Tucker lemma, we introduce a lower bound for chromatic number of Kneser hypergraphs which improves Dol'nikov-K{\v{r}}{\'{\i}}{\v{z}} bound. Next, we introduce multiple Kneser hypergraphs and we specify the…
Recently, Kupavskii~[{\it On random subgraphs of {K}neser and {S}chrijver graphs. J. Combin. Theory Ser. A, {\rm 2016}.}] investigated the chromatic number of random Kneser graphs $\KG_{n,k}(\rho)$ and proved that, in many cases, the…
In Ziegler (2002), the second author presented a lower bound for the chromatic numbers of hypergraphs $\KG{r}{\pmb s}{\calS}$, "generalized $r$-uniform Kneser hypergraphs with intersection multiplicities $\pmb s$." It generalized previous…
The Kneser graph $KG_{n,k}$ is the graph whose vertices are the $k$-element subsets of $[n],$ with two vertices adjacent if and only if the corresponding sets are disjoint. A famous result due to Lov\'asz states that the chromatic number of…
In this paper, we prove a generalization of a conjecture of Erd\"{o}s, about the chromatic number of certain Kneser-type hypergraphs. For integers $n,k,r,s$ with $n\ge rk$ and $2\le s\le r$, the $r$-uniform general Kneser hypergraph…
Suppose that a hypergraph ${\mathcal H}$ and an arbitrary nonempty (finite or infinite) set of available colors are given. Each color $x$ is associated with a frequency $\tau (x)$, where the set of all such frequencies is bounded. We define…
More than 50 years ago Hedetniemi conjectured that the chromatic number of categorical product of two graphs is equal to the minimum of their chromatic numbers. This conjecture has received a considerable attention in recent years.…
Let $n\ge 1$ and $s\ge 1$ be integers. An almost $s$-stable subset $A$ of $[n]=\{1,\dots,n\}$ is a subset such that for any two distinct elements $i, j\in A$, one has $|i-j|\ge s$. For a family $\cal F$ of non-empty subsets of $[n]$ and an…
Our purpose is to show that complements of line graphs enjoy nice coloring properties. We show that for all graphs in this class the local and usual chromatic numbers are equal. We also prove a sufficient condition for the chromatic number…
In 2011, Meunier conjectured that for positive integers $n,k,r,s$ with $ k\geq 2$, $r\geq 2$, and $n\geq \max (\{r,s\})k$, the chromatic number of $s$ -stable $r$-uniform Kneser hypergraphs is equal to $\left\lceil \frac{n-\max…
This paper is a study of ``topological'' lower bounds for the chromatic number of a graph. Such a lower bound was first introduced by Lov\'asz in 1978, in his famous proof of the \emph{Kneser conjecture} via Algebraic Topology. This…
The main result is a common generalization of results on lower bounds for the chromatic number of r-uniform hypergraphs and some of the major theorems in Tverberg-type theory, which is concerned with the intersection pattern of faces in a…
The Odd Hadwiger's conjecture, formulated by Gerards and Seymour in 1995, is a substantial strengthening of Hadwiger's famous coloring conjecture from 1943. We investigate whether the hierarchy of topological lower bounds on the chromatic…
There are two possible definitions of the "s-disjoint r-uniform Kneser hypergraph'' of a set system T: The hyperedges are either r-sets or r-multisets. We point out that Ziegler's (combinatorial) lower bound on the chromatic number of an…
For studying topological obstructions to graph colorings, Hom-complexes were introduced by Lov\'{a}sz. A graph $T$ is called a test graph if for every graph $H$, the $k$-connectedness of $|Hom(T, H)|$ implies $\chi (H)\geq k + 1 + \chi(T)$.…
Investigating the equality of the chromatic number and the circular chromatic number of graphs has been an active stream of research for last decades. In this regard, Habolhassan and Zhu [Circular chromatic number of Kneser graphs, Journal…
A Kneser graph $KG_{n,k}$ is a graph whose vertices are in one-to-one correspondence with $k$-element subsets of $[n],$ with two vertices connected if and only if the corresponding sets do not intersect. A famous result due to Lov\'asz…
The generalized Kneser hypergraph $KG^{r}(n,k,s)$ is the hypergraph whose vertices are all the $k$-subsets of $\{1,\ldots ,n\}$, and edges are $r$-tuples of distinct vertices such that any pair of them has at most $s$ elements in their…