中文
相关论文

相关论文: Combinatorial Stacks and the Four-Colour Theorem

200 篇论文

Barnette identified two interesting classes of cubic polyhedral graphs for which he conjectured the existence of a Hamiltonian cycle. Goodey proved the conjecture for the intersection of the two classes. We examine these classes from the…

计算几何 · 计算机科学 2018-07-05 Tomas Feder , Pavol Hell , Carlos Subi

Colored tensor models (CTM) is a random geometrical approach to quantum gravity. We scrutinize the structure of the connected correlation functions of general CTM-interactions and organize them by boundaries of Feynman graphs. For rank-$D$…

数学物理 · 物理学 2020-02-05 Carlos I. Pérez-Sánchez

Let G be a plane graph of girth at least five. We show that if there exists a 3-coloring phi of a cycle C of G that does not extend to a 3-coloring of G, then G has a subgraph H on O(|C|) vertices that also has no 3-coloring extending phi.…

组合数学 · 数学 2017-07-07 Zdenek Dvorak , Daniel Kral , Robin Thomas

Hindman's Theorem (HT) states that for every coloring of $\mathbb N$ with finitely many colors, there is an infinite set $H \subseteq \mathbb N$ such that all nonempty sums of distinct elements of $H$ have the same color. The investigation…

The inclusion relation between simple objects in the plane may be used to define geometric set systems, or hypergraphs. Properties of various types of colorings of these hypergraphs have been the subject of recent investigations, with…

计算几何 · 计算机科学 2015-03-17 Jean Cardinal , Matias Korman

The Dense Hindman's Theorem states that, in any finite coloring of the integers, one may find a single color and a "dense" set $B_1$, for each $b_1\in B_1$ a "dense" set $B_2^{b_1}$ (depending on $b_1$), for each $b_2\in B_2^{b_1}$ a…

组合数学 · 数学 2012-12-03 Henry Towsner

In the first partial result toward Steinberg's now-disproved three coloring conjecture, Abbott and Zhou used a counting argument to show that every planar graph without cycles of lengths 4 through 11 is 3-colorable. Implicit in their proof…

组合数学 · 数学 2022-09-13 Zachary Hamaker , Vincent Vatter

We apply ideas from conformal field theory to study symplectic four-manifolds, by using modular functors to "linearise" Lefschetz fibrations. In Chern-Simons theory this leads to the study of parabolic vector bundles of conformal blocks.…

辛几何 · 数学 2007-05-23 Ivan Smith

We consider the strength and effective content of restricted versions of Hindman's Theorem in which the number of colors is specified and the length of the sums has a specified finite bound. Let $\mathsf{HT}^{\leq n}_k$ denote the assertion…

We study 3-coloring properties of triangle-free planar graphs $G$ with two precolored 4-cycles $C_1$ and $C_2$ that are far apart. We prove that either every precoloring of $C_1\cup C_2$ extends to a 3-coloring of $G$, or $G$ contains one…

组合数学 · 数学 2017-07-11 Zdeněk Dvořák , Bernard Lidický

A conjecture due to the fourth author states that every $d$-regular planar multigraph can be $d$-edge-coloured, provided that for every odd set $X$ of vertices, there are at least $d$ edges between $X$ and its complement. For $d = 3$ this…

离散数学 · 计算机科学 2012-10-30 Maria Chudnovsky , Katherine Edwards , Ken-ichi Kawarabayashi , Paul Seymour

Let (M,I,J,K) be a hyperkahler manifold of real dimension 4n, and L a non-trivial holomorphic line bundle on (M,I). Using the quaternionic Dolbeault complex, we prove the following vanishing theorem for holomorphic cohomology of L. If the…

代数几何 · 数学 2008-03-14 Misha Verbitsky

The better title is "Yet another FALSE proof of the 4-colour theorem." Please consider all versions of this paper as historical material on the way to a non-computer proof of the 4-colour theorem. Interpreted as proofs, all versions are…

综合数学 · 数学 2009-05-22 Peter Doerre

Using bordered Floer theory, we give a combinatorial construction and proof of invariance for the hat version of Heegaard Floer homology. As a part of the proof, we also establish combinatorially the invariance of the linear-categorical…

几何拓扑 · 数学 2016-11-29 Bohua Zhan

We introduce ideas that complement the many known connections between polymatroids and graph coloring. Given a hypergraph that satisfies certain conditions, we construct polymatroids, given as rank functions, that can be written as sums of…

组合数学 · 数学 2024-08-07 Joseph E. Bonin , Carolyn Chun

Every stable 4-sphere is identified with the double branched covering space of a trivial surface-knot space. As a result of Wall, it is known that any two orthogonal bases of every stable 4-sphere are transformed into each other by an…

几何拓扑 · 数学 2026-05-01 Akio Kawauchi

We investigate the representation theory of the polynomial core of the quantum Teichmuller space of a punctured surface S. This is a purely algebraic object, closely related to the combinatorics of the simplicial complex of ideal cell…

几何拓扑 · 数学 2014-11-11 Francis Bonahon , Xiaobo Liu

We introduce the notion of cofoliation on a stack. A cofoliation is a change of the differentiable structure which amounts to giving a full representable smooth epimorphism. Cofoliations are uniquely determined by their associated Lie…

代数几何 · 数学 2007-05-23 Kai Behrend

We show that the map from $K({\mathbb S})$ to its chromatic completion is a connective cover and identify the fiber in $K$-theoretic terms. We combine this with recent work of Land-Mathew-Meier-Tamme to prove a form of "Waldhausen's…

K理论与同调 · 数学 2026-01-09 Andrew J. Blumberg , Michael A. Mandell , Allen Yuan

We present an explicit family of hypergraphs with arbitrarily large uniformity and chromatic number that admit realizations in both geometric and number-theoretic settings. As an application, we give a new proof of a theorem of Chen, Pach,…

组合数学 · 数学 2026-02-23 Gábor Damásdi
‹ 上一页 1 8 9 10 下一页 ›