Related papers: Tropical trigonal curves: the general case
A long-standing conjecture of Thomassen says that every longest cycle of a $3$-connected graph has a chord. Thomassen (2018) proved that if $G$ is a $2$-connected cubic graph, then any longest cycle must have a chord. He also showed that in…
In an influential 2008 paper, Baker proposed a number of conjectures relating the divisor theory of algebraic curves with an analogous combinatorial theory on finite graphs. In this note, we examine Baker's Brill--Noether existence…
The set of tritangent planes to smooth tropical space sextic curves has 15 connected components, recording continuous displacements of planes preserving the tritangency condition. These 15 tritangent classes are polyhedral complexes in…
For a finite group $G$, the vertices of the prime graph $\Gamma(G)$ are the primes that divide $|G|$, and two vertices $p$ and $q$ are connected by an edge if and only if there is an element of order $pq$ in $G$. Prime graphs of solvable…
We give an elementary proof of the fact that any elliptic curve $E$ over an algebraically closed non-archimedean field $K$ with residue characteristic $\neq{2,3}$ and with $v(j(E))<0$ admits a tropicalization that contains a cycle of length…
Ore's Theorem states that if $G$ is an $n$-vertex graph and every pair of non-adjacent vertices has degree sum at least $n$, then $G$ is Hamiltonian. A $[3]$-graph is a hypergraph in which every edge contains at most $3$ vertices. In this…
By tropical Abel-Jacobi theorem, the Jacobian of a tropical curve is isomorphic to the Picard group. A tropical curve in $\mathbb{R}^2$ corresponds to an immersion from a tropical curve to $\mathbb{R}^2$. In this paper, we show that any…
In this paper, we study the problem of tropicalizing tame degree three coverings of the projective line. Given any degree three covering $C\longrightarrow{\mathbb{P}^{1}}$, we give an algorithm that produces the Berkovich skeleton of $C$.…
A sandpile is a cellular automaton on a graph that evolves by the following toppling rule: if the number of grains at a vertex is at least its valency, then this vertex sends one grain to each of its neighbors. In the study of pattern…
Patchworking theorems serve as a basic element of the correspondence between tropical and algebraic curves, which is a core of the tropical enumerative geometry. We present a new version of a patchworking theorem which relates plane…
C. Thomassen (Proc. London Math. Soc. (3) 42 (1981), 231-251) gave a characterization of strongly connected non-Hamiltonian digraphs of order $p\geq 3$ with minimum degree $p-1$. In this paper we give an analogous characterization of…
This paper is a short introduction to the theory of tangles, both in graphs and general connectivity systems. An emphasis is put on the correspondence between tangles of order k and k-connected components. In particular, we prove that there…
In 2013, Chan classified all metric hyperelliptic graphs, proving that divisorial gonality and geometric gonality are equivalent in the hyperelliptic case. We show that such a classification extends to combinatorial graphs of divisorial…
In this work, we study conditions for the existence of length-constrained path-cycle decompositions, that is, partitions of the edge set of a graph into paths and cycles of a given minimum length. Our main contribution is the…
Given a vertex-coloured graph, a dominating set is said to be tropical if every colour of the graph appears at least once in the set. Here, we study minimum tropical dominating sets from structural and algorithmic points of view. First, we…
We prove an analogue of Clifford's inequality for tropical curves. Next we focus on the hyperelliptic case and we characterize divisors attaining equality. Finally we speculate whether inequality in tropical Clifford's Theorem does imply…
Let $\Gamma$ be an arrangement of Jordan curves in the plane, i.e., simple closed curves in the plane. For any curve $\gamma \in \Gamma$, we denote the bounded region enclosed by $\gamma$ as $\tilde{\gamma}$. We say that $\Gamma$ is…
A graph $G$ contains another graph $H$ as an immersion if $H$ can be obtained from a subgraph of $G$ by splitting off edges and removing isolated vertices. There is an obvious necessary degree condition for the immersion containment: if $G$…
The tropical $n$-gonal construction was introduced in recent work by the first author and D.~Zakharov and structural results for $n = 2,3$ were established. In this article we explore the construction for $n = 4$ and prove a tropical…
We prove for a tropical rational map that if for any point the convex hull of Jacobian matrices at smooth points in a neighborhood of the point does not contain singular matrices then the map is an isomorphism. We also show that a tropical…