Related papers: Multilabeled versions of Sperner's and Fan's lemma…

We give a simpler proof of Seymour's Theorem on edge-coloring series-parallel multigraphs and derive a linear-time algorithm to check whether a given series-parallel multigraph can be colored with a given number of colors.

Szemer\'edi's regularity lemma and its variants are some of the most powerful tools in combinatorics. In this paper, we establish several results around the regularity lemma. First, we prove that whether or not we include the condition that…

A celebrated result of Thomassen states that not only can every planar graph be colored properly with five colors, but no matter how arbitrary palettes of five colors are assigned to vertices, one can choose a color from the corresponding…

In this paper, we prove some new thickness theorems with partial derivatives. We give some applications. First, we give a simple criterion that can judge whether two scaled Cantor sets have non-empty intersection. Second, we prove under…

Being able to model correlations between labels is considered crucial in multi-label classification. Rule-based models enable to expose such dependencies, e.g., implications, subsumptions, or exclusions, in an interpretable and…

For any cubic graph in a closed orientable surface and a perfect matching, the Penrose-Kauffman polynomial is a sum of chromatic polynomials of a collection of associated graphs. A knot-theoretic perspective affords elementary proofs of old…

Packing graphs is a combinatorial problem where several given graphs are being mapped into a common host graph such that every edge is used at most once. In the planar tree packing problem we are given two trees T1 and T2 on n vertices and…

The classical approach to envy-free division and equilibrium problems relies on Knaster-Kuratowski-Mazurkiewicz theorem, Sperner's lemma or some extension involving mapping degree. We propose a different and relatively novel approach where…

Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying p_S(x+y)=\sum_{T\uplus U=S}p_T(x)p_U(y). Using umbral calculus, we give a formula for the expansion of such a set map in terms of any…

Large formal mathematical libraries consist of millions of atomic inference steps that give rise to a corresponding number of proved statements (lemmas). Analogously to the informal mathematical practice, only a tiny fraction of such…

Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.

We prove an extension of the Regularity Lemma with vertex and edge weights which can be applied for a large class of graphs. The applications involve random graphs and a weighted version of the Erd\H{o}s-Stone theorem. We also provide means…

We present a new approach to construction of protocols which are proof against communication errors. The construction is based on a generalization of the well known Ulam's game. We show equivalence between winning strategies in this game…

We consider a generalization of Sperner's lemma for a triangulation $T$ of $(m+1)$-discs $D$ whose vertices are colored in $n+2$ colors. A proper coloring of $T$ on the boundary of $D$ determines a simplicial mapping $f:S^m \to S^n$ and the…

We prove a theorem computing the number of solutions to a system of equations which is generic subject to the sparsity conditions embodied in a graph. We apply this theorem to games obeying graphical models and to extensive-form games. We…

We prove the boundedness theorem for Fano threefolds with log-terminal singularities of any fixed index. This is an improvement of our earlier result, where we required additionally that the variety is Q-factorial, with Picard number 1. The…

A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…

In this paper we use the strength of the constraint method in combination with a generalized Borsuk-Ulam type theorem and a cohomological intersection lemma to show how one can obtain many new topological transversal theorems of Tverberg…

The Lemma on the Logarithmic Derivative of a meromorphic function has many applications in the study of meromorphic functions and ordinary differential equations. In this paper, a difference analogue of the Logarithmic Derivative Lemma is…

We restate Thomassen's theorem of 3-extendability, an extension of the famous planar 5-choosability theorem, in terms of graph polynomials. This yields an Alon--Tarsi equivalent of 3-extendability.