Results 1 to 10 of about 68,778 (203)
Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 An equitable partition into branchings in a digraph is a partition of the arc set into branchings such that the sizes of any two branchings differ at most by one.
Kenjiro Takazawa
doaj +1 more source
Destroying Multicolored Paths and Cycles in Edge-Colored Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 We study the computational complexity of $c$-Colored $P_\ell$ Deletion and $c$-Colored $C_\ell$ Deletion. In these problems, one is given a $c$-edge-colored graph and wants to destroy all induced $c$-colored paths or cycles, respectively, on $\ell ...
Nils Jakob Eckstein +3 more
doaj +1 more source
Destroying Bicolored $P_3$s by Deleting Few Edges [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 We introduce and study the Bicolored $P_3$ Deletion problem defined as follows. The input is a graph $G=(V,E)$ where the edge set $E$ is partitioned into a set $E_r$ of red edges and a set $E_b$ of blue edges.
Niels Grüttemeier +3 more
doaj +1 more source
Pseudoperiodic Words and a Question of Shevelev [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 We generalize the familiar notion of periodicity in sequences to a new kind of pseudoperiodicity, and we prove some basic results about it. We revisit the results of a 2012 paper of Shevelev and reprove his results in a simpler and more unified manner ...
Joseph Meleshko +3 more
doaj +1 more source
Antisquares and Critical Exponents [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 The (bitwise) complement $\overline{x}$ of a binary word $x$ is obtained by changing each $0$ in $x$ to $1$ and vice versa. An $\textit{antisquare}$ is a nonempty word of the form $x\, \overline{x}$.
Aseem Baranwal +5 more
doaj +1 more source
Automatic sequences: from rational bases to trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system.
Michel Rigo, Manon Stipulanti
doaj +1 more source
On the VC-dimension of half-spaces with respect to convex sets [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A family S of convex sets in the plane defines a hypergraph H = (S, E) as follows. Every subfamily S' of S defines a hyperedge of H if and only if there exists a halfspace h that fully contains S' , and no other set of S is fully contained in h.
Nicolas Grelier +3 more
doaj +1 more source
Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 Binary relations derived from labeled rooted trees play an import role in mathematical biology as formal models of evolutionary relationships. The (symmetrized) Fitch relation formalizes xenology as the pairs of genes separated by at least one horizontal
Marc Hellmuth +2 more
doaj +1 more source
On the heapability of finite partial orders [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing such a ...
János Balogh +4 more
doaj +1 more source
Bounding the Number of Minimal Transversals in Tripartite 3-Uniform Hypergraphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 We focus on the maximum number of minimal transversals in 3-partite 3-uniform hypergraphs on n vertices. Those hypergraphs (and their minimal transversals) are commonly found in database applications.
Alexandre Bazin +3 more
doaj +1 more source