相关论文: Topological obstructions to graph colorings

The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…

A hole is an induced cycle of length at least 4. Let $\l\ge 2$ be a positive integer, let ${\cal G}_l$ denote the family of graphs which have girth $2\l+1$ and have no holes of odd length at least $2\l+3$, and let $G\in {\cal G}_{\l}$. For…

Two graphs are homomorphism indistinguishable over a graph class $\mathcal{F}$, denoted by $G \equiv_{\mathcal{F}} H$, if $\operatorname{hom}(F,G) = \operatorname{hom}(F,H)$ for all $F \in \mathcal{F}$ where $\operatorname{hom}(F,G)$…

The Hom complex $\mathrm{Hom}(G, H)$ of graphs is a simplicial complex associated to a pair of graphs $G$ and $H$, and its homotopy type is of interest in the graph coloring problem and the homomorphism reconfiguration problem. In this…

In 1970 Lov\'asz conjectured that every connected vertex-transitive graph admits a Hamilton cycle, apart from five exceptional graphs. This conjecture has recently been settled for graphs defined by intersecting set systems, which feature…

We derive sharp upper and lower bounds on the number of intersection points and closed regions that can occur in sets of line segments with certain structure, in terms of the number of segments. We consider sets of segments whose underlying…

In 1971, Tomescu conjectured [Le nombre des graphes connexes $k$-chromatiques minimaux aux sommets \'etiquet\'es, C. R. Acad. Sci. Paris 273 (1971), 1124--1126] that every connected graph $G$ on $n$ vertices with $\chi(G) = k \geq 4$ has at…

The Colouring problem asks whether the vertices of a graph can be coloured with at most $k$ colours for a given integer $k$ in such a way that no two adjacent vertices receive the same colour. A graph is $(H_1,H_2)$-free if it has no…

Scott proved in 1997 that for any tree $T$, every graph with bounded clique number which does not contain any subdivision of $T$ as an induced subgraph has bounded chromatic number. Scott also conjectured that the same should hold if $T$ is…

An \emph{interval $t$-coloring} of a multigraph $G$ is a proper edge coloring with colors $1,\dots,t$ such that the colors on the edges incident to every vertex of $G$ are colored by consecutive colors. A \emph{cyclic interval $t$-coloring}…

Let $G$ be an edge-colored graph, a walk in $G$ is said to be a properly colored walk iff each pair of consecutive edges have different colors, including the first and the last edges in case that the walk be closed. Let $H$ be a graph…

As a natural extension of the Four Color Theorem, Haj\'{o}s conjectured that graphs containing no $K_5$-subdivision are 4-colorable. Any possible counterexample to this conjecture with minimum number of vertices is called a {\it Haj\'{o}s…

A hole is an induced cycle of length at least 4, and an odd hole is a hole of odd length. It is NP-hard to color the vertices of an odd hole-free graph. A graph $G$ is perfectly divisible if every induced subgraph $H$ of $G$ with at least…

In this article, we consider the bipartite graphs $K_2 \times K_n$. We prove that the connectedness of the complex $\displaystyle \text{Hom}(K_2\times K_{n}, K_m) $ is $m-n-1$ if $m \geq n$ and $m-3$ in the other cases. Therefore, we show…

In this article, we give conditions on a graph under which the Lov\'{a}sz' original bound of the graph can be improved by increasing the topological connectivity of its neighbourhood complex. We also work out conditions under which…

Erd\H{o}s and Simonovits asked the following question: For an integer $r\geq 2$ and a family of non-bipartite graphs $\mathcal{H}$, determine the infimum of $\alpha$ such that any $\mathcal{H}$-free $n$-vertex graph with minimum degree at…

This is the second in a sequence of three papers in which we prove the following generalization of Thomassen's 5-choosability theorem: Let $G$ be a graph embedded on a surface of genus $g$. Then $G$ can be $L$-colored, where $L$ is a…

In 1981, Erd\H{o}s and Hajnal asked whether the sum of the reciprocals of the odd cycle lengths in a graph with infinite chromatic number is necessarily infinite. Let $\mathcal{C}(G)$ be the set of cycle lengths in a graph $G$ and let…

We consider extensions of Brooks' classic theorem on vertex coloring where some colors cannot be used on certain vertices. In particular we prove that if $G$ is a connected graph with maximum degree $\Delta(G) \geq 4$ that is not a complete…

In 1971, Tomescu conjectured that every connected graph $G$ on $n$ vertices with chromatic number $k\geq4$ has at most $k!(k-1)^{n-k}$ proper $k$-colorings. Recently, Knox and Mohar proved Tomescu's conjecture for $k=4$ and $k=5$. In this…