Related papers: The Brush Number of the Two-Dimensional Torus
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…
In this work, we study a mathematically rigorous metric of a graph visualization quality under conditions that relate to visualizing a bipartite graph. Namely we study rectilinear crossing number in a special arrangement of the complete…
By introducing a new point of view in Algebraic Topology relating elliptic curves in $\mathbb{R}^2$ and suitable bordism groups, the congruent number problem is solved showing that the Tunnell's theorem is also sufficient. This could be…
The dimer model on a graph embedded in the torus can be interpreted as a collection of random self-avoiding loops. In this paper, we consider the uniform toroidal honeycomb dimer model. We prove that when the mesh of the graph tends to zero…
We investigate the structure of the tri-pants graph, a simplicial graph introduced by Maloni and Palesi, whose vertices correspond to particular collections of homotopy classes of simple closed curves of the twice-punctured torus, called…
A D2CS of a graph G is a set $S \subseteq V(G)$ with $diam(G[S]) \leq 2$. We study the problem of counting and enumerating D2CS of a graph. First we give an explicit formula for the number of D2CS in a complete k-ary tree, Fibonacci tree,…
In this note we study numerically the combinatorics of curves and geodesics on the torus with one boundary component. A potential computational difficulty is avoided by counting inside specific orbits of the mapping class group up to a…
We show that the triple-crossing number of any knot is greater or equal to twice its (canonical) genus and we show an even stronger bound in the case of links. As an application we show that this bound is strong enough to obtain the…
Graphs on surfaces is an active topic of pure mathematics belonging to graph theory. It has also been applied to physics and relates discrete and continuous mathematics. In this paper we present a formal mathematical description of the…
We study the recently introduced boolean-width of graphs. Our structural results are as follows. Firstly, we show that almost surely the boolean-width of a random graph on $n$ vertices is $O(\log^2 n)$, and it is easy to find the…
Uncover the vertices of a given graph, deterministic or random, in random order; we consider both a discrete-time and a continuous-time version. We study the evolution of the number of visible edges, and show convergence after normalization…
The first three authors [European J. Combin. 33 (2012), 62--71] established a relationship between the transversal number and the domination number of uniform hypergraphs. In this paper, we establish a relationship between the total…
Brushing is a common interaction technique in 2D scatterplots, allowing users to select clustered points within a continuous, enclosed region for further analysis or filtering. However, applying conventional brushing to 2D representations…
In the following, bypassing dynamical systems tools, we propose a simple means of computing the box dimension of the graph of the classical Weierstrass function defined, for any real number~$x$, by~$ {\cal W}(x)=\displaystyle…
Trotter and Erd\"os found conditions for when a directed $m \times n$ grid graph on a torus is Hamiltonian. We consider the analogous graphs on a two-holed torus, and study their Hamiltonicity. We find an $\mathcal{O}(n^4)$ algorithm to…
For a connected graph, a vertex separator is a set of vertices whose removal creates at least two components. A vertex separator $S$ is minimal if it contains no other separator as a strict subset and a minimum vertex separator is a minimal…
Treewidth is a graph parameter of fundamental importance to algorithmic and structural graph theory. This paper surveys several graph parameters tied to treewidth, including separation number, tangle number, well-linked number and Cartesian…
In this paper we obtain an explicit formula for the number of degree d curves in two dimensional complex projective space, passing through (d(d+3)/2 -k) generic points and having a codimension k singularity, where k is at most 7. In the…
A classical result of Robertson and Seymour (1986) states that the treewidth of a graph is linearly tied to its separation number: the smallest integer $k$ such that, for every weighting of the vertices, the graph admits a balanced…
It is proved that the rectilinear crossing number of every graph with bounded tree-width and bounded degree is linear in the number of vertices. **** This paper has been withdrawn by the author. **** The results have been superseeded by the…