Related papers: Crossing numbers and rotation numbers of cycles in…
For any chord diagram on a circle there exists a complete graph on sufficiently many vertices such that any generic immersion of it to the plane contains a plane closed curve whose chord diagram contains the given chord diagram as a…
A plane drawing of a graph is {\em cylindrical} if there exist two concentric circles that contain all the vertices of the graph, and no edge intersects (other than at its endpoints) any of these circles. The {\em cylindrical crossing…
The crossing number of a graph is the least number of crossings of edges among all drawings of the graph in the plane. In this article, we prove that the crossing number of the generalized Petersen graph P(10, 3) is equal to 6.
A graph is $1$-planar, if it can be drawn in the plane such that there is at most one crossing on every edge. It is known, that $1$-planar graphs have at most $4n-8$ edges. We prove the following odd-even generalization. If a graph can be…
We show that every sufficiently large plane triangulation has a large collection of nested cycles that either are pairwise disjoint, or pairwise intersect in exactly one vertex, or pairwise intersect in exactly two vertices. We apply this…
We consider the number of crossings in a graph which is embedded randomly on a convex set of points. We give an estimate to the normal distribution in Kolmogorov distance which implies a convergence rate of order $n^{-1/2}$ for various…
One of Erdos's conjectures states that every triangle-free graph on $n$ vertices has an induced subgraph on $n/2$ vertices with at most $n^2/50$ edges. We report several partial results towards this conjecture. In particular, we establish…
We conjecture that every oriented graph $G$ on $n$ vertices with $\delta ^+ (G) , \delta ^- (G) \geq 5n/12$ contains the square of a Hamilton cycle. We also give a conjectural bound on the minimum semidegree which ensures a perfect packing…
There has been significant research dedicated towards computing the crossing numbers of families of graphs resulting from the Cartesian products of small graphs with arbitrarily large paths, cycles and stars. For graphs with four or fewer…
Let $K_4$ be the complete graph on four vertices. Let $f$ be a continuous map of $K_4$ to the plane such that $f$-images of non-adjacent edges are disjoint. For any vertex $v \in K_4$ take the winding number of the $f$-image of the cycle…
Counting the number of Hamiltonian cycles that are contained in a geometric graph is {\bf \#P}-complete even if the graph is known to be planar \cite{lot:refer}. A relaxation for problems in plane geometric graphs is to allow the geometric…
A class of simple graphs such as ${\cal G}$ is said to be {\it odd-girth-closed} if for any positive integer $g$ there exists a graph $G \in {\cal G}$ such that the odd-girth of $G$ is greater than or equal to $g$. An odd-girth-closed class…
We construct immersions of trivalent abstract tropical curves in the Euclidean plane and embeddings of all abstract tropical curves in higher dimensional Euclidean space. Since not all curves have an embedding in the plane, we define the…
We define the crossing number for an embedding of a graph G into R^3, and prove a lower bound on it which almost implies the classical crossing lemma. We also give sharp bounds on the space crossing numbers of pseudo-random graphs.
We derive improved upper bounds on the number of crossing-free straight-edge spanning cycles (also known as Hamiltonian tours and simple polygonizations) that can be embedded over any specific set of $N$ points in the plane. More…
A book embedding of a complete graph is a spatial embedding whose planar projection has the vertices located along a circle, consecutive vertices are connected by arcs of the circle, and the projections of the remaining "interior" edges in…
Every graph $\Gamma$ can be embedded in the plane with a minimal number of edge intersections, called its classical crossing number $\text{cross}\left(\Gamma\right)$. In this paper, we prove that if $\Gamma$ is a metric graph it can be…
The crossing number is the smallest number of pairwise edge-crossings when drawing a graph into the plane. There are only very few graph classes for which the exact crossing number is known or for which there at least exist constant…
A normal 5-edge-coloring of a cubic graph is a coloring such that for every edge the number of distinct colors incident to its end-vertices is 3 or 5 (and not 4). The well known Petersen Coloring Conjecture is equivalent to the statement…
The crossing number of a graph is the minimum number of double points over all generic immersions of the graph into the plane. In this paper we investigate the behavior of crossing number under a graph transformation, called $\mathsf{\Delta…