Related papers: Multiple chessboard complexes and the colored Tver…

We study provably effective and efficient data reduction for a class of NP-hard graph modification problems based on vertex degree properties. We show fixed-parameter tractability for NP-hard graph completion (that is, edge addition) cases…

Let $G$ be a connected graph with maximum degree $\Delta$. Brooks' theorem states that $G$ has a $\Delta$-coloring unless $G$ is a complete graph or an odd cycle. A graph $G$ is \emph{degree-choosable} if $G$ can be properly colored from…

Given a sequence $S=(s_1,s_2,\ldots,s_p)$, $p\geq 2$, of non-decreasing integers, an $S$-packing coloring of a graph $G$ is a partition of its vertex set into $p$ disjoint sets $V_1,\ldots, V_p$ such that any two distinct vertices of $V_i$…

A new series of integrable cases of the many-body problem in many-dimensional spaces is found. That series appears as a part of the larger series of integrable problems, which are in 1-1 correspondence with Krichever-Novikov algebras of…

We prove a conjecture by Kreiman and Lakshmibai on a combinatorial description of multiplicities of points on Schubert varieties in Graszmannians in terms of certain sets of reflections in the corresponding Weyl group. The proof is…

Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…

Hadwiger Conjecture has been an open problem for over a half century1,6, which says that there is at most a complete graph Kt but no Kt+1 for every t-colorable graph. A few cases of Hadwiger Conjecture, such as 1, 2, 3, 4, 5, 6-colorable…

For a graph $G$ with at least two vertices, the maximum local edge-connectivity of $G$ is the maximum number of edge-disjoint $(u,v)$-paths over all distinct pairs of vertices $(u,v)$ in $G$. Stiebitz and Toft (2018) proved a Brooks-type…

Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs, significantly increasing the number and variety…

The colored Tverberg theorem asserts that for every d and r there exists t=t(d,r) such that for every set C in R^d of cardinality (d+1)t, partitioned into t-point subsets C_1,C_2,...,C_{d+1} (which we think of as color classes; e.g., the…

A collection of graphs is \textit{nearly disjoint} if every pair of them intersects in at most one vertex. We prove that if $G_1, \dots, G_m$ are nearly disjoint graphs of maximum degree at most $D$, then the following holds. For every…

Combinatorics, in particular graph theory, has a rich history of being a domain of successful applications of tools from other areas of mathematics, including topological methods. Here, we survey the study of the Hom-complexes, and the ways…

The Petersen colouring conjecture states that every bridgeless cubic graph admits an edge-colouring with $5$ colours such that for every edge $e$, the set of colours assigned to the edges adjacent to $e$ has cardinality either $2$ or $4$,…

In this paper we investigate the class of the connected graded algebras which are finitely generated in degree 1, which are finitely presented with relations of degrees greater or equal to 2 and which are of finite global dimension D and…

We construct a twist-closed enhancement of the category ${\mathcal D}^b_{\rm coh}(X)$, the bounded derived category of complexes of ${\mathcal O}_X$-modules with coherent cohomology, by means of the DG-category of…

Hoffman's bound is a well-known eigenvalue bound on the chromatic number of a graph. By interpreting this bound as a parameter, we show multiple applications of colorings attaining the bound (Hoffman colorings) for several notions of graph…

For a fixed number of colors, we show that, in node-weighted split graphs, cographs, and graphs of bounded tree-width, one can determine in polynomial time whether a proper list-coloring of the vertices of a graph such that the total weight…

Suppose a graph has no large balanced bicliques, but has large minimum degree. Then what can we say about its induced subgraphs? This question motivates the study of degree-boundedness, which is like $\chi$-boundedness but for minimum…

Let $G=(V, E)$ be a finite connected graph, where $V$ denotes the set of vertices and $E$ denotes the set of edges. We revisit the following Chern-Simons Higgs model, \begin{equation*} \Delta u=\lambda…

The aim of this paper is twofold. On the one hand, it provides a review of the links between random tensor models, seen as quantum gravity theories, and the PL-manifolds representation by means of edge-colored graphs (crystallization…