اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDisjoint dijoins for classes of dicuts in finite and infinite digraphs
121
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
A dicut in a directed graph is a cut for which all of its edges are directed to a common side of the cut. A famous theorem of Lucchesi and Younger states that in every finite digraph the least size of a set of edges meeting every non-empty dicut equals the maximum number of disjoint dicuts in that digraph. Such sets are called dijoins. Woodall conjectured a dual statement. He asked whether the maximum number of disjoint dijoins in a directed graph equals the minimum size of a non-empty dicut. We study a modification of this question where we restrict our attention to certain classes of non-empty dicuts, i.e. whether for a class $mathfrak{B}$ of dicuts of a directed graph the maximum number of disjoint sets of edges meeting every dicut in $mathfrak{B}$ equals the size of a minimum dicut in $mathfrak{B}$. In particular, we verify this questions for nested classes of finite dicuts, for the class of dicuts of minimum size, and for classes of infinite dibonds, and we investigate how this generalised setting relates to a capacitated version of this question.
قيم البحث
اقرأ أيضاً
A general method for constructing sharply $k$-arc-transitive digraphs, i.e. digraphs that are $k$-arc-transitive but not $(k+1)$-arc-transitive, is presented. Using our method it is possible to construct both finite and infinite examples. The infinit
e examples can have one, two or infinitely many ends. Among the one-ended examples there are also digraphs that have polynomial growth.
We prove that every digraph of independence number at most 2 and arc-connectivity at least 2 has an out-branching $B^+$ and an in-branching $B^-$ which are arc-disjoint (we call such branchings good pair). This is best possible in terms of the arc-
connectivity as there are infinitely many strong digraphs with independence number 2 and arbitrarily high minimum in-and out-degrees that have good no pair. The result settles a conjecture by Thomassen for digraphs of independence number 2. We prove that every digraph on at most 6 vertices and arc-connectivity at least 2 has a good pair and give an example of a 2-arc-strong digraph $D$ on 10 vertices with independence number 4 that has no good pair. We also show that there are infinitely many digraphs with independence number 7 and arc-connectivity 2 that have no good pair. Finally we pose a number of open problems.
A detailed description of the structure of two-ended arc-transitive digraphs is given. It is also shown that several sets of conditions, involving such concepts as Property Z, local quasi-primitivity and prime out-valency, imply that an arc-transitiv
e digraph must be highly-arc-transitive. These are then applied to give a complete classification of two-ended highly-arc-transitive digraphs with prime in- and out-valencies.
An intersection digraph is a digraph where every vertex $v$ is represented by an ordered pair $(S_v, T_v)$ of sets such that there is an edge from $v$ to $w$ if and only if $S_v$ and $T_w$ intersect. An intersection digraph is reflexive if $S_vcap T_
v eq emptyset$ for every vertex $v$. Compared to well-known undirected intersection graphs like interval graphs and permutation graphs, not many algorithmic applications on intersection digraphs have been developed. Motivated by the successful story on algorithmic applications of intersection graphs using a graph width parameter called mim-width, we introduce its directed analogue called `bi-mim-width and prove that various classes of reflexive intersection digraphs have bounded bi-mim-width. In particular, we show that as a natural extension of $H$-graphs, reflexive $H$-digraphs have linear bi-mim-width at most $12|E(H)|$, which extends a bound on the linear mim-width of $H$-graphs [On the Tractability of Optimization Problems on $H$-Graphs. Algorithmica 2020]. For applications, we introduce a novel framework of direct
Image partition regular matrices near zero generalizes many classical results of Ram- sey Theory. There are several characterizations of finite image partition regular matrices near zero. Contrast to the finite cases there are only few classes of mat
ri- ces that are known to be infinite image partition regular near zero. In this present work we have produced several new examples of such classes.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
