Related papers: The complexity of L(p,q)-Edge-Labelling
A connected component of a vertex-coloured graph is said to be colourful if all its vertices have different colours. By extension, a graph is colourful if all its connected components are colourful. Given a vertex-coloured graph $G$ and an…
We study the complexity of locally checkable labeling (LCL) problems on $\mathbb{Z}^n$ from the point of view of descriptive set theory, computability theory, and factors of i.i.d. Our results separate various complexity classes that were…
A short account of recent existence and multiplicity theorems on the Dirichlet problem for an elliptic equation with $(p,q)$-Laplacian in a bounded domain is performed. Both eigenvalue problems and different types of perturbation terms are…
This paper completes the project started in [10]; to solve the edge-isoperimetric problem on the (generalized and extended) Sierpinski graph, S(n,m). We prove that initial segments of lexicographic order are solutions of the EIP for all…
Given a graph $G$, two edges $e_{1},e_{2}\in E(G)$ are said to have a common edge $e$ if $e$ joins an endvertex of $e_{1}$ to an endvertex of $e_{2}$. A subset $B\subseteq E(G)$ is an edge open packing set in $G$ if no two edges of $B$ have…
We consider the decision problem asking whether a partial rational symmetric matrix with an all-ones diagonal can be completed to a full positive semidefinite matrix of rank at most $k$. We show that this problem is $\NP$-hard for any fixed…
We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.
A graph is regularizable if it is possible to assign weights to its edges so that all nodes have the same degree. Weights can be positive, nonnegative or arbitrary as soon as the regularization degree is not null. Positive and nonnegative…
The mod-p cohomology ring of a non-trivial finite p-group is an infinite dimensional, finitely presented graded unital algebra over the field with p elements, with generators in positive degrees. We describe an effective algorithm to test…
We show that given a satisfiable instance of the 2-to-1 Label Cover problem, it is NP-hard to find a $(23/24 + \eps)$-satisfying assignment.
Let W_n(p,q) denote the minimum number of edges in an n x n bipartite graph G on vertex sets X,Y that satisfies the following condition; one can add the edges between X and Y that do not belong to G one after the other so that whenever a…
We prove that if $1 \leq p, q \leq \infty$, then the spaces $L_p +L_q$ and $L_p \cap L_q$ are isomorphic if and only if $p = q$. In particular, $L_2 +L_{\infty}$ and $L_2 \cap L_{\infty}$ are not isomorphic which is an answer to a question…
This paper studies the computational complexity of the Edge Packing problem and the Vertex Packing problem. The edge packing problem (denoted by $\bar{EDS}$) and the vertex packing problem (denoted by $\bar{DS} $) are linear programming…
The article studies edge coverage for control flow graphs extended with explicit constraints. Achieving a given level of white-box coverage for a given code is a classic problem in software testing. We focus on designing test sets that…
Fix distinct primes $p$ and $q$ and let $E$ be an elliptic curve defined over a number field $K$. The $(p,q)$-entanglement type of $E$ over $K$ is the isomorphism class of the group $\operatorname{Gal}(K(E[p])\cap K(E[q])/K)$. The size of…
Theoretical results are known about the completeness of a planar algebraic cubic curve as a (n,3)-arc in PG(2,q). They hold for q big enough and sometimes have restriction on the characteristic and on the value of the j-invariant. We…
In an edge modification problem, we are asked to modify at most $k$ edges to a given graph to make the graph satisfy a certain property. Depending on the operations allowed, we have the completion problems and the edge deletion problems. A…
We show that P2T - the problem of deciding whether the edge set of a simple graph can be partitioned into two trees or not - is NP-complete.
The number $Z(n):=\lfloor n/2\rfloor\lfloor (n-1)/2\rfloor$ is the smallest number of crossings in a simple planar drawing of $K_{2,n}$ in which both vertices on the 2-side have the same clockwise rotation. For two vertices $u,v$ on the…
This paper discusses the complexity of graph pebbling, dealing with both traditional pebbling and the recently introduced game of cover pebbling. Determining whether a configuration is solvable according to either the traditional definition…