Related papers: Flip cycles in plabic graphs
A biased graph is a graph with a class of selected circles ("cycles", "circuits"), called "balanced", such that no theta subgraph contains exactly two balanced circles. A biased graph has two natural matroids, the frame matroid and the lift…
A graph is $(c_1, c_2, ..., c_k)$-colorable if the vertex set can be partitioned into $k$ sets $V_1,V_2, ..., V_k$, such that for every $i: 1\leq i\leq k$ the subgraph $G[V_i]$ has maximum degree at most $c_i$. We show that every planar…
Vassiliev (finite type) invariants of knots can be described in terms of weight systems. These are functions on chord diagrams satisfying so-called 4-term relations. In the study of the sl2 weight system, it was shown that its value on a…
Leclerc and Zelevinsky described quasicommuting families of quantum minors in terms of a certain combinatorial condition, called weak separation. They conjectured that all maximal by inclusion weakly separated collections of minors have the…
Ehrenborg noted that all tilings of a bipartite planar graph are encoded by its cubical matching complex and claimed that this complex is collapsible. We point out to an oversight in his proof and explain why these complexes can be the…
We study the existence of hamiltonian cycles in plane cubic graphs G having a facial 2-factor Q. Thus hamiltonicity in G is transformed into the existence of a (quasi) spanning tree of faces in the contraction G/Q. In particular, we study…
This paper investigates the problem of listing faces of combinatorial polytopes, such as hypercubes, permutahedra, associahedra, and their generalizations. Firstly, we consider the face lattice, which is the inclusion order of all faces of…
The flip graph of triangulations has as vertices all triangulations of a convex $n$-gon, and an edge between any two triangulations that differ in exactly one edge. An $r$-rainbow cycle in this graph is a cycle in which every inner edge of…
Let $\pi:{\mathbb R}^n \to {\mathbb R}^d$ be any linear projection, let $A$ be the image of the standard basis. Motivated by Postnikov's study of postitive Grassmannians via plabic graphs and Galashin's connection of plabic graphs to slices…
A planar framework -- a graph together with a map of its vertices to the plane -- is flexible if it allows a continuous deformation preserving the distances between adjacent vertices. Extending a recent previous result, we prove that a…
In \cite{listnoC3adjC4}), Borodin and Ivanova proved that every planar graph without $4$-cycles adjacent to $3$-cycle is list vertex-$2$-aborable. In fact, they proved a more general result. Inspired by these results and DP-coloring which…
In this paper we investigate the crossing-sliding bifurcations of planar Filippov systems with $\mathbb{Z}_2$-symmetry. Such bifurcations are triggered by the perturbations of a critical crossing cycle and constitute an important class of…
In 1952, Dirac proved the following theorem about long cycles in graphs with large minimum vertex degrees: Every $n$-vertex $2$-connected graph $G$ with minimum vertex degree $\delta\geq 2$ contains a cycle with at least $\min\{2\delta,n\}$…
We introduce a class of pairs of graphs consisting of two cliques joined by an arbitrary number of edges. The members of a pair have the property that the clique-bridging edge-set of one graph is the complement of that of the other. We…
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…
Let G be a graph whose edges are labeled by positive integers. Label each vertex with an integer and suppose if two vertices are joined by an edge, the vertex labels are congruent to each other modulo the edge label. The set of vertex…
For a drawing of a labeled graph, the rotation of a vertex or crossing is the cyclic order of its incident edges, represented by the labels of their other endpoints. The extended rotation system (ERS) of the drawing is the collection of the…
The Hamiltonian cycle polynomial can be evaluated to count the number of Hamiltonian cycles in a graph. It can also be viewed as a list of all spanning cycles of length $n$. We adopt the latter perspective and present a pair of original…
The only open case of Vizing's conjecture that every planar graph with $\Delta\geq 6$ is a class 1 graph is $\Delta = 6$. We give a short proof of the following statement: there is no 6-critical plane graph $G$, such that every vertex of…
In this paper we investigate the structure of flip graphs on non-crossing perfect matchings in the plane. Specifically, consider all non-crossing straight-line perfect matchings on a set of $2n$ points that are placed equidistantly on the…