Well-order a flame
Zsuzsanna Jank\'o, Attila Jo\'o

TL;DR
This paper characterizes infinite flames in rooted digraphs, showing they can be constructed step-by-step starting from an empty graph, extending finite concepts to infinite cases.
Contribution
It provides a transfinite construction method for infinite flames, generalizing finite results and connecting to classical theorems in graph theory.
Findings
Infinite flames can be built transfinitely from empty graphs.
Every intermediate graph in the construction remains a flame.
The approach generalizes finite flame properties to infinite digraphs.
Abstract
An -rooted (possibly infinite) digraph is a flame if for every there exists a set of edge-disjoint paths from to in that covers all ingoing edges of . Flames were first studied by Lov\'asz in his investigation of edge-minimal subgraphs of a rooted digraph that preserve all the local edge-connectivities from the root. He showed that these subgraphs are always flames. Szeszl\'er later proved a common generalisation of Lov\'asz' result and Edmonds' disjoint arborescence theorem. In this paper we focus on infinite flames and prove the following constructive characterisation. Every (possibly infinite) flame can be constructed transfinitely, starting from the empty edge set and adding a single edge at each step in such a way that every intermediate digraph is again a flame.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Computational Geometry and Mesh Generation · Topological and Geometric Data Analysis
