Related papers: k-nets embedded in a projective plane over a field
A fundamental characteristic of computer networks is their topological structure. The question of the description of the structural characteristics of computer networks represents a problem that is not completely solved. Search methods for…
Let K be a valued field of characteristic p>0 with non-p-divisible value group. We show that every finite embedding problem for K whose kernel is a p-group is properly solvable.
In the NP-hard Edge Dominating Set problem (EDS) we are given a graph $G=(V,E)$ and an integer $k$, and need to determine whether there is a set $F\subseteq E$ of at most $k$ edges that are incident with all (other) edges of $G$. It is…
The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…
An injective $k$-edge-coloring of a graph $G$ is an assignment of colors, i.e. integers in $\{1, \ldots , k\}$, to the edges of $G$ such that any two edges each incident with one distinct endpoint of a third edge, receive distinct colors.…
We study computable embeddings for pairs of structures, i.e. for classes containing precisely two non-isomorphic structures. Surprisingly, even for some pairs of simple linear orders, computable embeddings induce a non-trivial degree…
Given an undirected $n$-vertex graph $G(V,E)$ and an integer $k$, let $T_k(G)$ denote the random vertex induced subgraph of $G$ generated by ordering $V$ according to a random permutation $\pi$ and including in $T_k(G)$ those vertices with…
An embedding of a graph in a book, called book embedding, consists of a linear ordering of its vertices along the spine of the book and an assignment of its edges to the pages of the book, so that no two edges on the same page cross. The…
In the previous paper by Pereira and the author, it was proved that any pencil of plane curves of degree greater than one with irreducible generic fiber can have at most five completely reducible fibers although no examples with five such…
We propose a network characterization of combinatorial fitness landscapes by adapting the notion of inherent networks proposed for energy surfaces. We use the well-known family of NK landscapes as an example. In our case the inherent…
Given a finite set of points $S\subset\mathbb{R}^d$, a $k$-set of $S$ is a subset $A \subset S$ of size $k$ which can be strictly separated from $S \setminus A $ by a hyperplane. Similarly, a $k$-facet of a point set $S$ in general position…
Let n be any integer greater than two. We prove that there exists a projection P having the following properties. (1) P is not the projection of any unknotted knot. (2) The singular point set of P consists of double points. (3) P is the…
We prove that if T is a theory of large, bounded, fields of characteristic zero, with almost quantifier elimination, and T_D is the model companion of T + "D is a derivation", then for any model U of T_D, and differential subfield K of U…
A $k$-stack layout (also called a $k$-page book embedding) of a graph consists of a total order of the vertices, and a partition of the edges into $k$ sets of non-crossing edges with respect to the vertex order. The stack number (book…
Approximately 1% of the known protein structures display knotted configurations in their native fold but their function is not understood. It has been speculated that the entanglement may inhibit mechanical protein unfolding or transport,…
A $k$-connected set in an infinite graph, where $k > 0$ is an integer, is a set of vertices such that any two of its subsets of the same size $\ell \leq k$ can be connected by $\ell$ disjoint paths in the whole graph. We characterise the…
Let EMBED(k,d) be the following algorithmic problem: Given a finite simplicial complex K of dimension at most k, does there exist a (piecewise linear) embedding of K into R^d? Known results easily imply polynomiality of EMBED(k,2) (k=1,2;…
A spectral characterization of the matching number (the size of a maximum matching) of a graph is given. More precisely, it is shown that the graphs G of order n whose matching number is k are precisely those graphs with the maximum skew…
We introduce a new technique that is used to show that the complex projective plane blown up at 6, 7, or 8 points has infinitely many distinct smooth structures. None of these smooth structures admit smoothly embedded spheres with…
Let $k$ be a field of characteristic $0$. We consider principal bundles over a $k$-scheme with reductive structure group (not necessarily of finite type). It is showm in particular that for $k$ algebraically closed there exists on any…