Related papers: When does the table theorem imply a solution to th…

We show that the following two problems are fixed-parameter tractable with parameter k: testing whether a connected n-vertex graph with m edges has a square root with at most n-1+k edges and testing whether such a graph has a square root…

Index maps taking values in the $K$-theory of a mapping cone are defined and discussed. The resulting index theorem can be viewed in analogy with the Freed-Melrose index theorem. The framework of geometric $K$-homology is used in a…

In graph pegging, we view each vertex of a graph as a hole into which a peg can be placed, with checker-like ``pegging moves'' allowed. Motivated by well-studied questions in graph pebbling, we introduce two pegging quantities. The pegging…

Very recently, Alon and Frankl initiated the study of the maximum number of edges in $n$-vertex $F$-free graphs with matching number at most $s$. For fixed $F$ and $s$, we determine this number apart from a constant additive term. We also…

We study the cohomology theory of sheaf complexes for open embeddings of topological spaces and related subjects. The theory is situated in the intersection of the general Cech theory and the theory of derived categories. That is to say, on…

We study the relation between algebraic structures and Graph Theory. We have defined five different weighted digraphs associated to a finite dimensional algebra over a field in order to tackle important properties of the associated…

Given a graph $G$, the general position problem is to find a largest set $S$ of vertices of $G$ such that no three vertices of $S$ lie on a common geodesic. Such a set is called a ${\rm gp}$-$set$ of $G$ and its cardinality is the ${\rm…

Betweenness as a relation between three individual points has been widely studied in geometry and axiomatized by several authors in different contexts. The article proposes a more general notion of betweenness as a relation between three…

In the classical theory, a famous by-product of the continued fraction expansion of quadratic irrational numbers $\sqrt{D}$ is the solution to Pell's equation for $D$. It is well-known that, once an integer solution to Pell's equation…

Inspired by a chessboard puzzle of Dudeney, the general position problem in graph theory asks for a largest set $S$ of vertices in a graph such that no three elements of $S$ lie on a common shortest path. The number of vertices in such a…

Berge's maximum theorem gives conditions ensuring the continuity of an optimised function as a parameter changes. In this paper we state and prove the maximum theorem in terms of the theory of monoidal topology and the theory of double…

A road map can be interpreted as a graph embedded in the plane, in which each vertex corresponds to a road junction and each edge to a particular road section. We consider the cartographic problem to place non-overlapping road labels along…

We propose a generalization of SHGH Conjectures to a smooth projective surface Y: the so called Segre Problem. The study of linear systems on Y can be translated in terms of the Mori cone of the blow up $X = Bl_r Y$ at $r$ general points.…

It is shown that if a $T_2$ topological space contains an uncountable closed discrete set, then $\omega_1 \times (\omega_1 + 1)$ embeds as a closed subspace of $(CL(X),\tau_F)$, the hyperspace of nonempty closed subsets of $X$ equipped with…

We show that the first order theory of the lattice of open sets in some natural topological spaces is $m$-equivalent to second order arithmetic. We also show that for many natural computable metric spaces and computable domains the first…

We add another brick to the large building comprising proofs of Pick's theorem. Although our proof is not the most elementary, it is short and reveals a connection between Pick's theorem and the pointwise convergence of multiple Fourier…

Each series $\sum_{n=1}^\infty a_n$ of real positive terms gives rise to a topology on $\mathbb{N} = \{1,2,3,...\}$ by declaring a proper subset $A\subseteq \mathbb{N}$ to be closed if $\sum_{n\in A} a_n < \infty$. We explore the…

We discuss the theorem on the existence of six points on a convex closed plane curve in which the curve has a contact of order six with the osculating conic. (This is the ``projective version'' of the well known four vertices theorem for a…

A drawing of a graph in the plane is called a thrackle if every pair of edges meets precisely once, either at a common vertex or at a proper crossing. Let t(n) denote the maximum number of edges that a thrackle of n vertices can have.…

The thesis presents the subject of synthetic topology, especially with relation to metric spaces. A model of synthetic topology is a categorical model in which objects possess an intrinsic topology in a suitable sense, and all morphisms are…