Related papers: Flows on graphs with cycles, locally gentle algebr…
We prove that if a rescaled mean curvature flow is a global graph over the round cylinder with small gradient and converges super-exponentially fast, then it must coincide with the cylinder itself. We also show that the result is sharp with…
It is a longstanding conjecture that every simple drawing of a complete graph on $n \geq 3$ vertices contains a crossing-free Hamiltonian cycle. We strengthen this conjecture to "there exists a crossing-free Hamiltonian path between each…
Motivated by work of Haythorpe, Thomassen and the author showed that there exists a positive constant $c$ such that there is an infinite family of 4-regular 4-connected graphs, each containing exactly $c$ hamiltonian cycles. We complement…
A $3$-dimensional nowhere-zero flow on a graph $G$ is a flow where each edge is assigned a $3$-dimensional vector with unit norm (which corresponds to the points of a $2$-dimensional unit sphere $S^2$). K. Jain posed two conjectures related…
This paper studies characteristic exponents of flows in relation with the dynamics of flows on flag bundles. The starting point is a flow on a principal bundle with semi-simple group $G$. Projection against the Iwasawa decomposition $G =…
It was conjectured by Mkrtchyan, Petrosyan, and Vardanyan that every graph $G$ with $\Delta(G)-\delta(G) \le 1$ has a maximum matching $M$ such that any two $M$-unsaturated vertices do not share a neighbor. In this note, we confirm the…
Every n-edge colored n-regular graph G naturally gives rise to a simple abstract n-polytope, the colorful polytope of G, whose 1-skeleton is isomorphic to G. The paper describes colorful polytope versions of the associahedron and…
We characterise the quotient surface graphs arising from symmetric contact systems of line segments in the plane and also from symmetric pointed pseudotriangulations in the case where the group of symmetries is generated by a translation or…
For any lattice congruence of the weak order on $\mathfrak{S}_n$, N. Reading proved that glueing together the cones of the braid fan that belong to the same congruence class defines a complete fan. We prove that this fan is the normal fan…
We develop a microscopic theory for plasmon excitations of graphene/${\alpha}$-RuCl${_3}$ heterostructures. Within a Kondo-Kitaev model with various interactions, a heavy Fermi liquid hosting flat bands emerges in which the itinerant…
We prove a bijection between the triangulations of the 3-dimensional cyclic polytope C(n+2, 3) and persistent graphs with n vertices. We show that under this bijection the Stasheff-Tamari orders on triangulations naturally translate to…
A fan is a set of edges with a single common endpoint. A graph is fan-crossing if it admits a drawing in the plane so that each edge is crossed by edges of a fan. It is fan-planar if, in addition, the common endpoint is on the same side of…
Generalizing work of Athanasiadis for the Birkhoff polytope and Reiner and Welker for order polytopes, in 2007 Bruns and R\"omer proved that any Gorenstein lattice polytope with a regular unimodular triangulation admits a regular unimodular…
A well-known result of Nosal states that a graph $G$ with $m$ edges and $\lambda(G) > \sqrt{m}$ contains a triangle. Nikiforov [Combin. Probab. Comput. 11 (2002)] extended this result to cliques by showing that if $\lambda (G) >…
This article introduces a new approach to discrete curvature based on the concept of effective resistances. We propose a curvature on the nodes and links of a graph and present the evidence for their interpretation as a curvature. Notably,…
We study the strongly connected components of the flow graph associated to a veering triangulation, and show that the infinitesimal components must be of a certain form, which have to do with subsets of the triangulation which we call…
A graph is a core or unretractive if all its endomorphisms are automorphisms. Well-known examples of cores include the Petersen graph and the graph of the dodecahedron -- both generalized Petersen graphs. We characterize the generalized…
We study Maxim Kontsevich's graph complex $GC_d$ for any integer $d$ as well as its oriented and targeted versions, and show new short proofs of the theorems due to Thomas Willwacher and Marko Zivkovic which establish isomorphisms of their…
The family of generalized Petersen graphs $G(n, k)$, introduced by Coxeter et al. [4] and named by Mark Watkins (1969), is a family of cubic graphs formed by connecting the vertices of a regular polygon to the corresponding vertices of a…
The relation between densities of cycles and the spectrum of a graphon, which implies that the spectra of convergent graphons converge, fundamentally relies on the self-adjointness of the linear operator associated with a graphon. In this…