On a packing problem for infinite graphs and independence spaces

DOI10.1016/0095-8956(79)90050-9zbMath0416.05030OpenAlexW2019190176MaRDI QIDQ754225

James G. Oxley

Publication date: 1979

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

Full work available at URL: https://doi.org/10.1016/0095-8956(79)90050-9

zbMATH Keywords

infinite graphpacking problemedge-disjoint spanning treesindependence space

Mathematics Subject Classification ID

Trees (05C05) Combinatorial aspects of matroids and geometric lattices (05B35) Graph theory (05C99) Combinatorial aspects of packing and covering (05B40)

Related Items (5)

Balancing connected colourings of graphs ⋮ An analogue of Edmonds' branching theorem for infinite digraphs ⋮ Arboricity and tree-packing in locally finite graphs ⋮ On posets and independence spaces ⋮ Extremal infinite graph theory

Cites Work

• Unnamed Item
• Unnamed Item
• Transversal theory. An account of some aspects of combinatorial mathematics
• Über drei kombinatorische Probleme am \(n\)-dimensionalen Würfel und Würfelgitter
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Transversals and matroid partition
• Infinite graphs—A survey
• Lehmans switching game and a theorem of Tutte and Nash-Williams
• Matroids and duality
• Admissible Mappings between Dependence Spaces
• On Families of Finite Independence Structures
• Sur la Dualite en Theorie des Matroides

This page was built for publication: On a packing problem for infinite graphs and independence spaces