10 papers · 1 filter
Twist Flow for Inverse Problems
Shiqin Zeng, Zijun Deng, Felix J. Herrmann
In Bayesian inverse problems, posterior sampling requires generating samples that are consistent with given observations while capturing the range of plausible solutions. Direct co…
Paths with Prescribed Endpoints in Semicomplete and Locally Semicomplete Digraphs
Hanzhi Bai, Jin Yan, Jia Zhou
We study two open path problems with prescribed endpoints posed by Bang-Jensen and Gutin. The first asks for a longest -path in a semicomplete digraph. The second asks wheth…
Ramsey--Turán Factors of Non-directed Oriented Cycles in Oriented Graphs
Jia Zhou, Yunshu Gao
Let be any orientation of the cycle which is not directed. We prove that, for every integer and every , there is a real such tha…
Dominant-Degree Conditions for Ramsey--Turán Factors of Non-Directed Cycle Orientations
Jia Zhou, Yunshu Gao
Let $\Cvec$ be a fixed orientation of the cycle , , which is not directed. For an oriented graph , let and let \[ \sigor…
A Chvátal--Erdős type condition for supereulerian digraphs with
Zirui Liu, Jin Yan, Jia Zhou
A digraph is \textbf{supereulerian} if it contains a spanning closed trail. Let denote the maximum cardinality of a vertex set inducing no 2-cycle. In this paper, we chara…
Complexity of Arc-Decompositions involving Perfect Matchings and Cycle Factors
Hangning Liu, Jørgen Bang-Jensen, Jin Yan +1
For two digraph properties and , a -arc-decomposition of a digraph is a partition such that the spanning subdigraphs $D[A_…
Sparse spanning -strong oriented subdigraphs in split digraphs
Jia Zhou, Jørgen Bang-Jensen, Jin Yan
Jackson and Thomassen conjectured that every -strong digraph admits a spanning -strong oriented subdigraph [Ann. N. Y. Acad. Sci. 555 (1989) 402-412]. The conjecture holds f…
Highly connected spanning oriented subdigraphs in generalizations of semicomplete digraphs
Jia Zhou, Jørgen Bang-Jensen, Tong Zhou +1
Let be a positive integer. Jackson and Thomassen conjectured in 1989 that there exists an integer function such that every -strong digraph admits a spanning -st…
K-Arc-Strong Orientations Of Semicomplete Digraphs
Tong Zhou, Jørgen Bang-Jensen, Jia Zhou +1
Results by Jackson and Frank imply that every 2k-arc-strong digraph D contains a spanning k-arc-strong oriented subdigraph. This is best possible, even for very dense digraphs. A d…
On the 2-Linkage Problem for Split Digraphs
Xiaoying Chen, Jørgen Bang-Jensen, Jin Yan +1
A digraph is {\bf \( k \)-linked} if for arbitary two disjoint vertex sets \(\{s_1, \ldots, s_k\}\) and \(\{t_1, \ldots, t_k\}\), there exist vertex-disjoint directed paths \(P_1,…