English
Related papers

Related papers: Combinatorial Stacks and the Four-Colour Theorem

200 papers

There are two conjectures concerning planar graph colourings that are strengthenings of the four colour theorem. One concerns signed graph colouring and is proposed by M\'{a}\v{c}ajov\'{a}, Raspaud and \v{S}koviera. It asserts that every…

Combinatorics · Mathematics 2017-11-09 Xuding Zhu

The topological Tverberg theorem has been generalized in several directions by setting extra restrictions on the Tverberg partitions. Restricted Tverberg partitions, defined by the idea that certain points cannot be in the same part, are…

Combinatorics · Mathematics 2013-11-06 Alexander Engström , Patrik Norén

Our point of departure is the following simple common generalisation of the Sylvester-Gallai theorem and the Motzkin-Rabin theorem: Let S be a finite set of points in the plane, with each point coloured red or blue or with both colours.…

Combinatorics · Mathematics 2009-03-12 L. M. Pretorius , K. J. Swanepoel

We outline the proof that non-triangulable manifolds exist in any dimension greater than four. The arguments involve homology cobordism invariants coming from the Pin(2) symmetry of the Seiberg-Witten equations. We also explore a related…

Geometric Topology · Mathematics 2024-02-21 Ciprian Manolescu

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.…

History and Overview · Mathematics 2024-05-10 Sergey Kurapov , Maxim Davidovsky

We prove a surface embedding theorem for 4-manifolds with good fundamental group in the presence of dual spheres, with no restriction on the normal bundles. The new obstruction is a Kervaire-Milnor invariant for surfaces and we give a…

Geometric Topology · Mathematics 2024-09-04 Daniel Kasprowski , Mark Powell , Arunima Ray , Peter Teichner

This article analyzes the interplay between symplectic geometry in dimension four and the invariants for smooth four-manifolds constructed using holomorphic triangles introduced in math.SG/0110169. Specifically, we establish a non-vanishing…

Symplectic Geometry · Mathematics 2007-05-23 P. S. Ozsvath , Z. Szabo

For a given smooth $2$-knot in $S^4$, we relate the existence of a smooth Seifert hypersurface of a certain class to the existence of irreducible $ SU(2)$-representations of its knot group. For example, we see that any smooth $2$-knot…

Geometric Topology · Mathematics 2022-01-28 Masaki Taniguchi

We use categorical skew Howe duality to find recursion rules that compute categorified sl(N) invariants of rational tangles colored by exterior powers of the standard representation. Further, we offer a geometric interpretation of these…

Geometric Topology · Mathematics 2019-03-20 Paul Wedrich

We propose an open question that seeks to generalise the Four Colour Theorem from two to three dimensions. As an appetiser, we show that 12 instead of four colours are both sufficient and necessary to colour every 2-complex that embeds in a…

Combinatorics · Mathematics 2024-11-13 Jan Kurkofka , Emily Nevinson

In 1973, Fisk proved that any $4$-coloring of a $3$-colorable triangulation of the $2$-sphere can be obtained from any $3$-coloring by a sequence of Kempe-changes. On the other hand, in the case where we are only allowed to recolor a single…

Four-Color Theorem has secret in its logical proof and actual operating. In this paper we will give a proof of Four-Color Theorem based on Kuratowski's Theorem using some induction argument and give a description of the most complicated…

General Mathematics · Mathematics 2014-08-11 Qizhi Wang

The usual coherence theorem of MacLane for categories with multiplication assumes that a certain pentagonal diagram commutes in order to conclude that associativity isomorphisms are well defined in a certain practical sense. The practical…

Category Theory · Mathematics 2013-09-04 Matthew G. Brin

This article is devoted to the properties of the planar triangulations. The conjugated planar triangulation will be introduced and on the base of the properties, which were achieved by the other authors there will be proved some theorems,…

Discrete Mathematics · Computer Science 2012-12-31 Natalia Malinina

We show how to define invariants of graphs related to quantum $\mathfrak{sl}(2)$ when the graph has more then one connected component and components are colored by blocks of representations with zero quantum dimensions.

Geometric Topology · Mathematics 2015-05-13 Nathan Geer , Nicolai Reshetikhin

The chromatic number for properly colouring the facets of a combinatorial simple $n$-polytope $P^n$ that is the orbit space of a quasitoric manifold satisfies the inequality $n\leq P^n\leq 2^n-1$. The inequality is sharp for $n=2$ but not…

Combinatorics · Mathematics 2023-02-10 Djordje Baralic

We consider the faces in pseudoline arrangements in which the pseudolines are colored with two colors. Bj\"orner, Las Vergnas, Sturmfels, White, and Ziegler conjecture the existence of a two-colored triangle in such arrangements. We…

Combinatorics · Mathematics 2026-01-29 Yan Alves Radtke , Balázs Keszegh , Robert Lauff

This paper is a collection of thoughts and observations, being partly a review and partly a report of current research, on recent work in various aspects of Gr\"unbaum colorings, their existence and usage. In particular, one of the most…

Combinatorics · Mathematics 2017-01-10 S. Lawrencenko , M. N. Vyalyi , L. V. Zgonnik

Let $S=R\cup B$ be a point set in the plane in general position such that each of its elements is colored either red or blue, where $R$ and $B$ denote the points colored red and the points colored blue, respectively. A quadrilateral with…

Computational Geometry · Computer Science 2017-08-07 S. Bereg , J. M. Díaz-Báñez , R. Fabila-Monroy , P. Pérez-Lantero , A. Ramírez-Vigueras , T. Sakai , J. Urrutia , I. Ventura

This paper presents a short and simple proof of the Four-Color Theorem that can be utterly checkable by human mathematicians, without computer assistance. The new key idea that has allowed it and the global structure of the proof are…

Discrete Mathematics · Computer Science 2019-11-05 André Luiz Barbosa