English
Related papers

Related papers: A proof of the Kauffman-Harary Conjecture

200 papers

Several classical knot invariants, such as the Alexander polynomial, the Levine-Tristram signature and the Blanchfield pairing, admit natural extensions from knots to links, and more generally, from oriented links to so-called colored…

Geometric Topology · Mathematics 2026-03-04 David Cimasoni , Gaetan Simian

The Bounded Negativity Conjecture predicts that for every complex projective surface $X$ there exists a number $b(X)$ such that $C^2\geq -b(X)$ holds for all reduced curves $C\subset X$. For birational surfaces $f:Y\to X$ there have been…

Algebraic Geometry · Mathematics 2023-04-20 Piotr Pokora , Xavier Roulleau , Tomasz Szemberg

The canonical van der Waerden theorem asserts that, for sufficiently large $n$, every colouring of $[n]$ contains either a monochromatic or a rainbow arithmetic progression of length $k$ ($k$-AP, for short). In this paper, we determine the…

Combinatorics · Mathematics 2026-04-28 José D. Alvarado , Yoshiharu Kohayakawa , Patrick Morris , Guilherme O. Mota , Miquel Ortega

We show how to adjust a very nice coupling argument due to McDiarmid in order to prove/reprove in a novel way results concerning Hamilton cycles in various models of random graph and hypergraphs. In particular, we firstly show that for…

Combinatorics · Mathematics 2015-02-09 Asaf Ferber

For a digraph $G$ and $v \in V(G)$, let $\delta^+(v)$ be the number of out-neighbors of $v$ in $G$. The Caccetta-H\"{a}ggkvist conjecture states that for all $k \ge 1$, if $G$ is a digraph with $n = |V(G)|$ such that $\delta^+(v) \ge k$ for…

Combinatorics · Mathematics 2021-10-04 Patrick Hompe , Petra Pelikanova , Aneta Pokorna , Sophie Spirkl

A graph $G$ is said to be Ramsey for a tuple of graphs $(H_1,\dots,H_r)$ if every $r$-coloring of the edges of $G$ contains a monochromatic copy of $H_i$ in color $i$, for some $i$. A fundamental question at the intersection of Ramsey…

Combinatorics · Mathematics 2024-08-21 Micha Christoph , Anders Martinsson , Raphael Steiner , Yuval Wigderson

Let us denote by $\mathcal K_n$ the hyperspace of all convex bodies of $\mathbb R^n$ equipped with the Hausdorff distance topology. An affine invariant point $p$ is a continuous and Aff(n)-equivariant map $p:\mathcal K_n\to \mathbb R^n$,…

Geometric Topology · Mathematics 2016-02-23 Natalia Jonard-Pérez

In previous joint work with Frohman and Lofaro a noncommutative generalization of the A-polynomial of a knot was introduced, consisting of a finitely generated ideal of polynomials (the noncommutative A-ideal) in the quantum plane. The…

Quantum Algebra · Mathematics 2007-05-23 Razvan Gelca

A very simple expression is conjectured for arbitrary colored Jones and HOMFLY polynomials of a rich $(g+1)$-parametric family of Pretzel knots and links. The answer for the Jones and HOMFLY polynomials is fully and explicitly expressed…

High Energy Physics - Theory · Physics 2015-03-03 D. Galakhov , D. Melnikov , A. Mironov , A. Morozov , A. Sleptsov

George Birkhoff proved in 1912 that the number of proper colorings of a finite graph G with n colors is a polynomial in n, called the chromatic polynomial of G. Read conjectured in 1968 that for any graph G, the sequence of absolute values…

Combinatorics · Mathematics 2017-06-05 Matthew Baker

The Akbari-Cameron-Khosrovshahi (ACK) conjecture, which appears to be unresolved, states that for any simple graph $G$ with at least one edge, there exists a nonzero {$\{0,1\}$}-vector in the row space of its adjacency matrix that is not a…

Combinatorics · Mathematics 2026-01-07 S. Akansha , K. C. Sivakumar

In this paper we have shown without assuming the four color theorem of planar graphs that every (bridgeless) cubic planar graph has a three-edge-coloring. This is an old-conjecture due to Tait in the squeal of efforts in settling the…

Combinatorics · Mathematics 2007-05-23 I. Cahit

For a graph $G$, the $k$-colouring graph of $G$ has vertices corresponding to proper $k$-colourings of $G$ and edges between colourings that differ at a single vertex. The graph supports the Glauber dynamics Markov chain for $k$-colourings,…

Combinatorics · Mathematics 2024-03-01 Emma Hogan , Alex Scott , Youri Tamitegama , Jane Tan

The Komlos conjecture in discrepancy theory states that for some constant K and for any m by n matrix A whose columns lie in the unit ball there exists a +/- 1 vector x such that the infinity norm of Ax is bounded above by K. This…

Combinatorics · Mathematics 2013-08-05 Aleksandar Nikolov

We prove that a special alternating knot does not decompose as a non-trivial band sum. This restricts concordances from special alternating knots, and we conjecture that special alternating knots are ribbon concordance minimal. We verify…

Geometric Topology · Mathematics 2024-12-17 Joe Boninger , Joshua Evan Greene

Feder and Subi conjectured that for any $2$-coloring of the edges of the $n$-dimensional cube, we can find an antipodal pair of vertices connected by a path that changes color at most once. We discuss the case of random colorings, and we…

Combinatorics · Mathematics 2015-04-24 Daniel Soltész

We study the following Steinberg-type problem on circular coloring: for an odd integer $k\ge 3$, what is the smallest number $f(k)$ such that every planar graph of girth $k$ without cycles of length from $k+1$ to $f(k)$ admits a…

Combinatorics · Mathematics 2020-07-02 Xiaolan Hu , Jiaao Li

We study the topological dynamics of H\'enon maps. For a parameter set generalizing the Benedicks-Carleson parameters (the Wang-Young parameter set) we obtain the following: The pruning front conjecture (due to Cvitanovi\'c); A kneading…

Dynamical Systems · Mathematics 2024-12-16 Jan P. Boroński , Sonja Štimac

The m,n Turk's Head Knot, THK(m,n), is an "alternating (m,n) torus knot." We prove the Harary-Kauffman conjecture for all THK(m,n) except for the case where m \geq 5 is odd and n \geq 3 is relatively prime to m. We also give evidence in…

Geometric Topology · Mathematics 2008-11-04 Nicholas E. Dowdall , Thomas W. Mattman , Kevin Meek , Pablo R. Solis

We prove the bivariate Cayley-Hamilton theorem, a powerful generalization of the classical Cayley-Hamilton theorem. The bivariate Cayley-Hamilton theorem has three direct corollaries that are usually proved independently: The classical…

Computational Complexity · Computer Science 2025-11-10 Christian Ikenmeyer
‹ Prev 1 4 5 6 7 8 10 Next ›