Related papers: Good sequencings for small directed triple systems
Kirkman triple systems (KTSs) are among the most popular combinatorial designs and their existence has been settled a long time ago. Yet, in comparison with Steiner triple systems, little is known about their automorphism groups. In…
Given a directed graph $G = (V, E)$, the $k$-path partition problem is to find a minimum collection of vertex-disjoint directed paths each of order at most $k$ to cover all the vertices of $V$. The problem has various applications in…
Localization transitions represent a fundamental class of continuous phase transitions, yet they occur without any accompanying symmetry breaking. We resolve this by introducing the concept of dynamical translational symmetry (DTS), which…
It is well known that a tournament (complete oriented graph) on $n$ vertices has at most ${1/4}\binom{n}{3}$ directed triangles, and that the constant 1/4 is best possible. Motivated by some geometric considerations, our aim in this paper…
Given a directed graph $D$, a set $S \subseteq V(D)$ is a total dominating set of $D$ if each vertex in $D$ has an in-neighbor in $S$. The total domination number of $D$, denoted $\gamma_t(D)$, is the minimum cardinality among all total…
Let $D$ be a digraph. We define the minimum semi-degree of $D$ as $\delta^{0}(D) := \min \{\delta^{+}(D), \delta^{-}(D)\}$. Let $k$ be a positive integer, and let $S = \{s\}$ and $T = \{t_{1}, \dots ,t_{k}\}$ be any two disjoint subsets of…
In a graph, a vertex dominates itself and its neighbors, and a dominating set is a set of vertices that together dominate the entire graph. Given a graph and two dominating sets of equal size $k$, the {\em Dominating Set Reconfiguration…
The power dominating set (PDS) problem is the following extension of the well-known dominating set problem: find a smallest-size set of nodes $S$ that power dominates all the nodes, where a node $v$ is power dominated if (1) $v$ is in $S$…
We initiate the study of extended bicolorings of Steiner triple systems (STS) which start with a $k$-bicoloring of an STS($v$) and end up with a $k$-bicoloring of an STS($2v+1$) obtained by a doubling construction, using only the original…
We study the problem Symmetric Directed Multicut from a parameterized complexity perspective. In this problem, the input is a digraph $D$, a set of cut requests $C=\{(s_1,t_1),\ldots,(s_\ell,t_\ell)\}$ and an integer $k$, and the task is to…
A digraph is strongly connected if it has a directed path from $x$ to $y$ for every ordered pair of distinct vertices $x, y$ and it is strongly $k$-connected if it has at least $k+1$ vertices and remains strongly connected when we delete…
Given a sequence of $n$ numbers and $k$ parallel First-in-First-Out (FIFO) queues, how close can one bring the sequence to sorted order? It is known that $k$ queues suffice to sort the sequence if the Longest Decreasing Subsequence (LDS) of…
Delay-tolerant networks (DTNs) are characterized by a possible absence of end-to-end communication routes at any instant. Still, connectivity can generally be established over time and space. The optimality of a temporal path (journey) in…
A $k$-regular graph is called a divisible design graph (DDG for short) if its vertex set can be partitioned into $m$ classes of size $n$, such that two distinct vertices from the same class have exactly $\lambda_1$ common neighbors, and two…
Let $k$ and $\ell$ be positive integers. The multiset star transposition graph ST$_k^\ell$ has as vertices the $k\ell$-strings $v_0\cdots v_{k\ell-1}$ on $k$ symbols, each symbol repeated $\ell$ times, and edges given by the transpositions…
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optimized. A triangulation is order-$k$ Delaunay if the…
In this work we present a version of the so called Chen and Chv\'atal's conjecture for directed graphs. A line of a directed graph D is defined by an ordered pair (u, v), with u and v two distinct vertices of D, as the set of all vertices w…
A locating-dominating set (LDS) of a graph $G$ is a dominating set $S$ of $G$ such that for every two vertices $u$ and $v$ in $V(G) \setminus S$, $N(u)\cap S \neq N(v)\cap S$. The locating-domination number $\gamma^{L}(G)$ is the minimum…
Given a graph $G$ and an integer $k$, the Feedback Vertex Set (FVS) problem asks if there is a vertex set $T$ of size at most $k$ that hits all cycles in the graph. The fixed-parameter tractability status of FVS in directed graphs was a…
Time-fluctuating signals are ubiquitous and diverse in many physical, chemical, and biological systems, among which random telegraph signals (RTSs) refer to a series of instantaneous switching events between two discrete levels from…