Related papers: Colorful two-piercing theorem for boxes

We prove the following colorful Helly-type result: Fix $k \in [d-1]$. Assume $\mathcal{A}_1, \dots, \mathcal{A}_{d+(d-k)+1}$ are finite sets (colors) of nonzero vectors in $\R^d$. If for every rainbow sub-selection $R$ from these sets of…

$(1^a, 2^b)$-coloring is the problem of partitioning the vertex set of a graph into $a$ independent sets and $b$ 2-independent sets. This problem was recently introduced by Choi and Liu. We study the computational complexity and extremal…

In the present paper, we generalize the celebrated classical lemma of Birch and Heegner on quadratic twists of elliptic curves over $\mathbb{Q}$. We prove the existence of explicit infinite families of quadratic twists with analytic ranks…

Many knots and links in S^3 can be drawn as gluing of three manifolds with one or more four-punctured S^2 boundaries. We call these knot diagrams as double fat graphs whose invariants involve only the knowledge of the fusion and the…

A Gleason-type theorem is proved for two restricted classes of informationally complete POVMs in the qubit case. A particular (incomplete) Kochen-Specker colouring, suggested by Appleby in dimension three, is generalized to arbitrary…

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.

We give an upper bound on the list chromatic number of a 2-colorable hypergraph which generalizes the bound of Schauz on $k$-partite $k$-uniform hypergraphs. It makes sense for sparse hypergraphs: in particular we show that a $k$-uniform…

A graph embedded in a surface with all faces of size 4 is known as a quadrangulation. We extend the definition of quadrangulation to higher dimensions, and prove that any graph G which embeds as a quadrangulation in the real projective…

We both survey and extend a new technique from Lu Liu to prove separation theorems between products of Ramsey-type theorems over computable reducibility. We use this technique to show that Ramsey's theorem for $n$-tuples and three colors is…

We prove several bounds on the number of incidences between two sets of multivariate polynomials of bounded degree over finite fields. From these results, we deduce bounds on incidences between points and multivariate polynomials, extending…

For graphs $G$ and $H$, an $H$-coloring of $G$ is an adjacency preserving map from the vertices of $G$ to the vertices of $H$. $H$-colorings generalize such notions as independent sets and proper colorings in graphs. There has been much…

We give Henneberg-type constructions for three families of sparse colored graphs arising in the rigidity theory of periodic and other forced symmetric frameworks. The proof method, which works with Laman-sparse finite covers of colored…

Combining Ky Fan's theorem with ideas of Greene and Matousek we prove a generalization of Dol'nikov's theorem. Using another variant of the Borsuk-Ulam theorem due to Bacon and Tucker, we also prove the presence of all possible completely…

The classical theorem of Vizing states that every graph of maximum degree $d$ admits an edge-coloring with at most $d+1$ colors. Furthermore, as it was earlier shown by K\H{o}nig, $d$ colors suffice if the graph is bipartite. We investigate…

Two (proper) colorings of a graph are adjacent if they differ on exactly one vertex. Jerrum proved that any $(d + 2)$-coloring of any d-degenerate graph can be transformed into any other via a sequence of adjacent colorings. A result of…

In this paper we prove a new result about partitioning coloured complete graphs and use it to determine certain Ramsey numbers exactly. The partitioning theorem we prove is that for k at least 1, in every edge colouring of a complete graph…

The acyclic edge colouring problem is extensively studied in graph theory. The corner-stone of this field is a conjecture of Alon et. al.\cite{alonacyclic} that $a'(G)\le \Delta(G)+2$. In that and subsequent work, $a'(G)$ is typically…

We study the conflict-free chromatic number of hypergraphs derived from the family of facets of $d$-dimensional cyclic polytopes with $n$ vertices. While in odd dimensions $d$ the problem is easy, for even dimensions the problem becomes…

We give a new proof of the following interesting fact recently proved by Bower and Michael: if a d-dimensional rectangular box can be tiled using translates of two types of rectangular bricks, then it can also be tiled in the following way.…

This paper deals with two problems about splitting fairly a path with colored vertices, where "fairly" means that each part contains almost the same amount of vertices in each color. Our first result states that it is possible to remove one…