Dijoin
id:
dijoin-237-2730585
title:
Dijoin
text:
In mathematics, a dijoin is a subset of the edges of a directed graph, with the property that contracting every edge in the dijoin produces a strongly connected graph. Equivalently, a dijoin is a subset of the edges that, for every dicut, includes at least one edge crossing the dicut. Here, a dicut is a partition of the vertices into two subsets, so that each edge that has an endpoint in both subsets is directed from the first subset to the second. Woodall's conjecture, an unsolved problem in th
brand slug:
wiki
category slug:
encyclopedia
description:
Edges crossing all dicuts in a directed graph
original url:
https://en.wikipedia.org/wiki/Dijoin
date created:
date modified:
2024-01-13T17:57:20Z
main entity:
{"identifier":"Q115806012","url":"https://www.wikidata.org/entity/Q115806012"}
image:
fields total:
13
integrity:
14