Results 1 to 10 of about 1,611,510 (293)
On the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 We consider the Erd\H{o}s-P\'osa property for immersions and topological minors in tournaments. We prove that for every simple digraph $H$, $k\in \mathbb{N}$, and tournament $T$, the following statements hold: (i) If in $T$ one cannot find $k$ arc ...
Łukasz Bożyk, Michał Pilipczuk
doaj +1 more source
Measurement of the Electron Magnetic Moment. [PDF]
Physical Review Letters, 2022 The electron magnetic moment, -μ/μ_{B}=g/2=1.001 159 652 180 59 (13) [0.13 ppt], is determined 2.2 times more accurately than the value that stood for fourteen years.
X. Fan +3 more
semanticscholar +1 more source
Asymptotically sharpening the $s$-Hamiltonian index bound [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 For a non-negative integer $s\le |V(G)|-3$, a graph $G$ is $s$-Hamiltonian if the removal of any $k\le s$ vertices results in a Hamiltonian graph. Given a connected simple graph $G$ that is not isomorphic to a path, a cycle, or a $K_{1,3}$, let $\delta(G)
Sulin Song +3 more
doaj +1 more source
Discrete Mathematics & Theoretical Computer Science, 2023 Mixed graphs have both directed and undirected edges. A mixed cage is a regular mixed graph of given girth with minimum possible order. In this paper mixed cages are studied. Upper bounds are obtained by general construction methods and computer searches.
Geoffrey Exoo
doaj +1 more source
Combinatorial Conversion and Moment Bisimulation for Stochastic Rewriting Systems [PDF]
Logical Methods in Computer Science, 2020 We develop a novel method to analyze the dynamics of stochastic rewriting systems evolving over finitary adhesive, extensive categories. Our formalism is based on the so-called rule algebra framework and exhibits an intimate relationship between the ...
Nicolas Behr +2 more
doaj +1 more source
Zero-sum partitions of Abelian groups of order $2^n$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 The following problem has been known since the 80's. Let $\Gamma$ be an Abelian group of order $m$ (denoted $|\Gamma|=m$), and let $t$ and $m_i$, $1 \leq i \leq t$, be positive integers such that $\sum_{i=1}^t m_i=m-1$.
Sylwia Cichacz, Karol Suchan
doaj +1 more source
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity [PDF]
Logical Methods in Computer Science, 2019 This paper settles the computational complexity of model checking of several extensions of the monadic second order (MSO) logic on two classes of graphs: graphs of bounded treewidth and graphs of bounded neighborhood diversity.
Dušan Knop +3 more
doaj +1 more source
On the Monadic Second-Order Transduction Hierarchy [PDF]
Logical Methods in Computer Science, 2010 We compare classes of finite relational structures via monadic second-order transductions. More precisely, we study the preorder where we set C \subseteq K if, and only if, there exists a transduction {\tau} such that C\subseteq{\tau}(K).
Achim Blumensath, Bruno Courcelle
doaj +1 more source
Hitting minors, subdivisions, and immersions in tournaments [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 The Erd\H{o}s-P\'osa property relates parameters of covering and packing of combinatorial structures and has been mostly studied in the setting of undirected graphs.
Jean-Florent Raymond
doaj +1 more source
Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same. The graph $G$ is rainbow-connected if there is a rainbow path between every pair of vertices.
Melissa Keranen, Juho Lauri
doaj +1 more source