On decomposition of graphs

DOI10.1007/BF02280296zbMath0169.26601OpenAlexW2155537964MaRDI QIDQ5556306

Andras Hajnal, Paul Erdős

Publication date: 1967

Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02280296

zbMATH Keywords

topology

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

A consistent edge partition theorem for infinite graphs ⋮ Changing the Depth of an Ordered Set by Decomposition ⋮ A note on the Engelking-Karłowicz theorem ⋮ A Cantor-Bernstein-type theorem for spanning trees in infinite graphs ⋮ Embedding Graphs into Colored Graphs

Cites Work

• Teilmengen von Mengen mit Relationen
• A partition calculus in set theory
• Graph Theory and Probability
• A Construction of Graphs without Triangles having Pre-Assigned Order and Chromatic Number
• On chromatic number of graphs and set-systems
• Partition relations for cardinal numbers
• The Construction of Certain Graphs
• Decomposition of Finite Graphs Into Forests

This page was built for publication: On decomposition of graphs