On Partitioning the Edges of an Infinite Digraph into Directed Cycles

DOI10.19086/aic.18702zbMath1477.05144arXiv1704.08830OpenAlexW3120890175MaRDI QIDQ5162866

Attila Joó

Publication date: 5 November 2021

Published in: Advances in Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

infinite digraphdirected cycleedge-partition

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Directed graphs (digraphs), tournaments (05C20) Infinite graphs (05C63)

Related Items (1)

The Lovász-Cherkassky theorem in countable graphs

Cites Work

• Nash-Williams' cycle-decomposition theorem
• Elementary submodels in infinite combinatorics
• Decomposition of Graphs Into Closed and Endless Chains

This page was built for publication: On Partitioning the Edges of an Infinite Digraph into Directed Cycles