Related papers: Multilabeled versions of Sperner's and Fan's lemma…
The proof of Brouwer's fixed-point theorem based on Sperner's lemma is often presented as an elementary combinatorial alternative to advanced proofs based on algebraic topology. The goal of this note is to show that: (i) the combinatorial…
The classic Ky Fan theorem is a combinatorial equivalent of Borsuk-Ulam theorem. It is a generalization and extension of Tucker's lemma and, just like its predecessor, it pinpoints important properties of antipodal colorings of vertices of…
We give a new proof of a partition theorem popularly known as Elder's theorem, but which is also credited to Stanley and Fine. We extend the theorem to the context of colored partitions (or prefabs). More specifically, we give analogous…
Stiebitz determined the chromatic number of generalised Mycielski graphs using the topological method of Lovasz, which invokes the Borsuk-Ulam theorem. Van Ngoc and Tuza used elementary combinatorial arguments to prove Stiebitz's theorem…
We prove an extension of the well-known combinatorial-topological lemma of E. Sperner to the case of infinite-dimensional cubes. It is obtained as a corollary to an infinitary extension of the Lebesgue Covering Dimension Theorem.
Combining ideas of Pham, Sah, Sawhney, and Simkin on spread perfect matchings in super-regular bipartite graphs with an algorithmic blow-up lemma, we prove a spread version of the blow-up lemma. Intuitively, this means that there exists a…
In an earlier paper, the present authors (2013) introduced the altermatic number of graphs and used Tucker's Lemma, an equivalent combinatorial version of the Borsuk-Ulam Theorem, to show that the altermatic number is a lower bound for the…
Motivated by the resemblance of a multivariate series identity and a finite analogue of Euler's pentagonal number theorem, we study multiple extensions of the latter formula. In a different direction we derive a common extension of this…
The product version of the 1-2-3 Conjecture, introduced by Skowronek-Kazi{\'o}w in 2012, states that, a few obvious exceptions apart, all graphs can be 3-edge-labelled so that no two adjacent vertices get incident to the same product of…
Alexander's lemma is a version of Sperner's lemma published by Alexander two years earlier than Sperner's paper. The present paper is devoted to a modern but elementary exposition of lemmas of Alexander and Sperner and their main…
Fan-planar graphs were recently introduced as a generalization of 1-planar graphs. A graph is fan-planar if it can be embedded in the plane, such that each edge that is crossed more than once, is crossed by a bundle of two or more edges…
In the first part, we introduce a notion a degree of edge-colorings of bicubic plane graphs and proves some local formula of the graded number of colorings. In the second part, we give a new proof of a result of Fisk saying that any two…
Consider $n$ players having preferences over the connected pieces of a cake, identified with the interval $[0,1]$. A classical theorem, found independently by Stromquist and by Woodall in 1980, ensures that, under mild conditions, it is…
Solving classification with graph methods has gained huge popularity in recent years. This is due to the fact that the data can be intuitively modeled with graphs to utilize high level features to aid in solving the classification problem.…
We investigate Fair and Tolerant (FAT) graph colorings, a coloring framework in which each vertex is allowed to share its color with a prescribed fraction of its neighbors, while the remaining neighbors are required to be distributed evenly…
We prove a global uniform Artin-Rees lemma type theorem for sections of ample line bundles over smooth projective varieties. This result is used to prove an Artin-Rees lemma for the polynomial ring with uniform degree bounds. The proof is…
Borsuk-Ulam's theorem is a useful tool of algebraic topology. It states that for any continuous mapping $f$ from the $n$-sphere to the $n$-dimensional Euclidean space, there exists a pair of antipodal points such that $f(x)=f(-x)$. As for…
The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning.…
Baker devised a technique to obtain approximation schemes for many optimization problems restricted to planar graphs; her technique was later extended to more general graph classes. In particular, using the Baker's technique and the minor…
The blow-up lemma states that a system of super-regular pairs contains all bounded degree spanning graphs as subgraphs that embed into a corresponding system of complete pairs. This lemma has far-reaching applications in extremal…