相关论文: Coloring hypergraphs that are the union of nearly …
We classify modules and rings with some specific properties of their intersection graphs. In particular, we describe rings with infinite intersection graphs containing maximal left ideals of finite degree. This answers a question raised in…
Ray intersection graphs are intersection graphs of rays, or halflines, in the plane. We show that any planar graph has an even subdivision whose complement is a ray intersection graph. The construction can be done in polynomial time and…
We discuss representations and colorings of orthogonality hypergraphs in terms of their two-valued states interpretable as classical truth assignments. Such hypergraphs, if they allow for a faithful orthogonal representation, have quantum…
Given a class $\mathcal{H}$ of $m$ hypergraphs ${H}_1, {H}_2, \ldots, {H}_m$ with the same vertex set $V$, a cooperative coloring of them is a partition $\{I_1, I_2, \ldots, I_m\}$ of $V$ in such a way that each $I_i$ is an independent set…
Let Q(n,c) denote the minimum clique size an n-vertex graph can have if its chromatic number is c. Using Ramsey graphs we give an exact, albeit implicit, formula for the case c is at least (n+3)/2.
We address the problem of finding upper bounds on the chromatic index $q(V,E)$ of linear (and loopless) hypergraphs. The first bound we find is defined through a color-preserving group on a proper and minimally edge-colored linear…
This paper investigates when countable graphs have a finite or an infinite chromatic number through model theoretic methods. For Fra\"{i}ss\'{e} limits, we show that instability forces the chromatic number to be infinite, yielding a…
A lower bound is obtained for the greatest possible number of colors in an interval colourings of some regular graphs.
The chromatic polynomial $\pi_{G}(k)$ of a graph $G$ can be viewed as counting the number of vertices in a family of coloring graphs $\mathcal C_k(G)$ associated with (proper) $k$-colorings of $G$ as a function of the number of colors $k$.…
A graph coloring has bounded clustering if each monochromatic component has bounded size. Equivalently, it is a partition of the vertices into induced subgraphs with bounded size components. This paper studies clustered colorings of graphs,…
We investigate the number of maximal cliques, i.e., cliques that are not contained in any larger clique, in three network models: Erd\H{o}s-R\'enyi random graphs, inhomogeneous random graphs (also called Chung-Lu graphs), and geometric…
We obtain improved upper bounds and new lower bounds on the chromatic number as a linear function of the clique number, for the intersection graphs (and their complements) of finite families of translates and homothets of a convex body in…
In this note, we introduce a new method for constructing graphs with high chromatic number and small clique. Indeed, via this method, we present a new proof for the well-known Kneser's conjecture.
We consider the faces in pseudoline arrangements in which the pseudolines are colored with two colors. Bj\"orner, Las Vergnas, Sturmfels, White, and Ziegler conjecture the existence of a two-colored triangle in such arrangements. We…
Recently Chase determined the maximum possible number of cliques of size $t$ in a graph on $n$ vertices with given maximum degree. Soon afterward, Chakraborti and Chen answered the version of this question in which we ask that the graph…
For an edge-colored graph, a subgraph is called rainbow if all its edges have distinct colors. We show that if $G$ is an edge-colored graph of order $n$ and size $m$ using $c$ colors on its edges, and $m+c\geq \binom{n+1}{2}+k-1$ for a…
The chromatic threshold of a graph $H$ is the minimum-degree density above which every $H$-free graph has bounded chromatic number. We study a two-color Ramsey analogue: for graphs $H_1$ and $H_2$, we ask for the minimum-degree density…
We prove that there exist perfect graphs of arbitrarily large clique-chromatic number. These graphs can be obtained from cobipartite graphs by repeatedly gluing along cliques. This negatively answers a question raised by Duffus, Sands,…
An equitable coloring of a graph $G$ is a proper vertex coloring of $G$ such that the sizes of any two color classes differ by at most one. In the paper, we pose a conjecture that offers a gap-one bound for the smallest number of colors…
Let $[n]$ denote the set $\{1, 2, \ldots, n\}$ and $\mathcal{F}^{(r)}_{n,k,a}$ be an $r$-uniform hypergraph on the vertex set $[n]$ with edge set consisting of all the $r$-element subsets of $[n]$ that contains at least $a$ vertices in…