Pages that link to "Item:Q2833123"

From MaRDI portal

← Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths (Q2833123)

Jump to:navigation, search

The following pages link to Edmonds' Branching Theorem in Digraphs Without Forward-Infinite Paths (Q2833123):

Displaying 3 items.

Old and new results on packing arborescences in directed hypergraphs (Q1744239) (← links)
An analogue of Edmonds' branching theorem for infinite digraphs (Q2225436) (← links)
Packing Countably Many Branchings with Prescribed Root‐Sets in Infinite Digraphs (Q4604019) (← links)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:WhatLinksHere"