Enlarging vertex-flames in countable digraphs

DOI10.1016/J.JCTB.2021.06.011MaRDI QIDQ1984520zbMATH OpenOpenAlexFDO

Authors Joshua Erde, J. Pascal Gollin, Attila Joó

Publication date 16 September 2021

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2003.06178

zbMATH Keywords

flameinfinite digraphlocal connectivity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30) Infinite graphs (05C63)

Abstract: A rooted digraph is a vertex-flame if for every vertex $v$ there is a set of internally disjoint directed paths from the root to $v$ whose set of terminal edges covers all ingoing edges of $v$. It was shown by Lov'{a}sz that every finite rooted digraph admits a spanning subdigraph which is a vertex-flame and large, where the latter means that it preserves the local connectivity to each vertex from the root. A structural generalisation of vertex-flames and largeness to infinite digraphs was given by the third author and the analogue of Lov'{a}sz' result for countable digraphs was shown. We strengthen this result by proving that in every countable rooted digraph each vertex-flame can be extended to a large vertex-flame.

Recommendations

• Vertex-flames in countable rooted digraphs preserving an Erdős-Menger separation for each vertex
• Greedoids from flames
• Common root functions of two digraphs
• Packing countably many branchings with prescribed root-sets in infinite digraphs
• An analogue of Edmonds' branching theorem for infinite digraphs

Cites work

• Connectivity in digraphs
• Graph theory
• Menger's theorem for infinite graphs
• Packing countably many branchings with prescribed root-sets in infinite digraphs
• The Linking of Sets in Graphs
• Vertex-flames in countable rooted digraphs preserving an Erdős-Menger separation for each vertex

Cited in

(3)

• Vertex-flames in countable rooted digraphs preserving an Erdős-Menger separation for each vertex
• Greedoids from flames
• Large vertex-flames in uncountable digraphs

This page was built for publication: Enlarging vertex-flames in countable digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1984520)