Related papers: On Crosspatch Knight's Tours
Consider a transient near-critical (1,2) random walk on the positive half line. We give a criteria for the finiteness of the number of the skipped points (the points never visited) by the random walk. This result generalizes (partially) the…
Transit functions serve not only as abstractions of betweenness and convexity but are also closely connected with clustering systems. Here, we investigate the canonical transit functions of binary clustering systems inspired by pyramids,…
We give an estimate of the number of geometrically distinct open tours $\G$ for a knight on a chessboard. We use a randomization of Warnsdorff rule to implement importance sampling in a backtracking scheme, correcting the observed bias of…
In [1] the authors studied the closed tour problem on the $8\times 8$ chessboard of a chess piece, called $k$-prince, leaving open the existence of such a tour when $k=7$. In this note we find a solution to this open case.
Two-dimensional (random) walks in cones are very natural both in combinatorics and probability theory: they are interesting for themselves and also because they are strongly related to other discrete structures. While walks restricted to…
In this survey we overview known results and get several new results on digraph compositions which generalize several classes of digraphs, such as quasi-transitive digraphs. After an introductory section, the paper is divided into six…
In this articles we consider very mathematical (if not very plausible) geometric marching. Our marchers will exhibit beautiful mathematics, some familiar and some less so. In a final summary section we discuss the point of all the fancy…
It is known that for every knotted curve in space, there is a line intersecting it in four places, a quadrisecant. Comparing the order of the four points along the line and knot we can distinguish three types of quadrisecants; the…
This article is a gentle introduction to the mathematical area known as circle packing, the study of the kinds of patterns that can be formed by configurations of non-overlapping circles. The first half of the article is an exposition of…
The square of a graph is obtained by adding additional edges joining all pair of vertices of distance two in the original graph. Particularly, if $C$ is a hamiltonian cycle of a graph $G$, then the square of $C$ is called a hamiltonian…
We prove that a connected graph contains a circuit---a closed walk that repeats no edges---through any $k$ prescribed edges if and only if it contains no odd cut of size at most $k$.
Let $A$ be an $m\times n$ toroidal array containing filled and empty cells. Fix an orientation $R=(r_1,\dots,r_m)$ of each row and an orientation $C=(c_1,\dots,c_n)$ of each column of $A$. Given an initial filled cell $(i_1,j_1)$ consider…
A thrackle is a drawing of a graph in which each pair of edges meets precisely once. Conway's Thrackle Conjecture asserts that a planar thrackle drawing of a graph cannot have more edges than vertices, which is equivalent to saying that no…
A construction similar to Hagge's construction for circles through the orthocentre is shown to apply for any point.
If one is given a rigid triangle in the plane or space, we show that the only motion possible, where each vertex of the triangle moves along a straight line, is given by a hypocycloid line drawer in the plane, and a natural extension in…
An arrangement of pseudocircles is a collection of simple closed curves on the sphere or in the plane such that any two of the curves are either disjoint or intersect in exactly two crossing points. We call an arrangement intersecting if…
An Euler tour in a hypergraph is a closed walk that traverses each edge of the hypergraph exactly once, while an Euler family is a family of closed walks that jointly traverse each edge exactly once and cannot be concatenated. In this…
It is shown that every 2-planar graph is quasiplanar, that is, if a simple graph admits a drawing in the plane such that every edge is crossed at most twice, then it also admits a drawing in which no three edges pairwise cross. We further…
We show that the coined quantum walk on a line can be understood as an interference phenomenon, can be classically implemented, and indeed already has been. The walk is essentially two independent walks associated with the different coin…
A drawing of a graph is {\em pseudolinear} if there is a pseudoline arrangement such that each pseudoline contains exactly one edge of the drawing. The {\em pseudolinear crossing number} of a graph $G$ is the minimum number of pairwise…