An Erdős-Gallai conjecture

DOI10.1007/BF02579444zbMath0581.05043WikidataQ122889057 ScholiaQ122889057MaRDI QIDQ1068106

László Pyber

Publication date: 1985

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

pathscircuit covering

Mathematics Subject Classification ID

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

Related Items (11)

An overview of graph covering and partitioning ⋮ Towards the Erdős-Gallai cycle decomposition conjecture ⋮ Decomposing Random Graphs into Few Cycles and Edges ⋮ An Erdős-Gallai theorem for matroids ⋮ Covers of Eulerian graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Path and cycle decompositions of dense graphs ⋮ Covering a graph by topological complete subgraphs ⋮ Subgraph coverings and edge switchings ⋮ Cycle packing ⋮ Any four independent edges of a 4-connected graph are contained in a circuit

Cites Work

• The Representation of a Graph by Set Intersections
• Unnamed Item
• Unnamed Item

This page was built for publication: An Erdős-Gallai conjecture